Round 1: coding round, 2 leetcode problem, 1 medium, 1 hard - Leetcode no - 64. Minimum Path Sum,295. Find Median from Data Stream Round 2: HM round, current project and some design questions Round 3: Architect round, current project and LeetCode Medium 240. Search a 2D Matrix II Round 4: Current project and Kafka Internals