Kotak | SDE2 | Bangalore | 2025 | Offer
Summary
I received an offer for the SDE2 role at Kotak after a comprehensive interview process that included Bar Raiser, DSA, HLD, and LLD rounds.
Full Experience
Bar Raiser
- stock buy and sell simple
- search in rotated sorted array
- LLD - Design the backend components for an online marketplace where users can buy and sell products. Consider features such as user authentication, product listing, search functionality, shopping cart, and order management.
- Discuss the challenges and techniques for handling distributed session management. Explain the role of distributed messaging systems like Kafka or RabbitMQ in a backend system.
DSA
- Given an array like 1,2,2,2,3,3,3,4,5,6 change it in place such that any character repeats only twice and return the length of the new array output 1,2,2,3,3,4,5,6,5,6 . Array ends at index 7 where the first 6 is present . Any element after index 7 can be ignored .
- In a binary tree any random node is put on fire . How much time will it take for the tree to be burnt if 1 edge takes 1 unit time . Equates to finding the farthest node from a tree node .
3. HLD and LLD - Flight ticket booking system . First HLD was asked then LLD on entities and DB schema . Questions on auth and authorization
Offer - https://leetcode.com/discuss/post/6700523/kotak-sde2-bangalore-offer-by-anonymous_-r8jh/
Interview Questions (6)
Given a rotated sorted array, search for a target element in it.
Design the backend components for an online marketplace where users can buy and sell products. Consider features such as user authentication, product listing, search functionality, shopping cart, and order management.
Discuss the challenges and techniques for handling distributed session management. Explain the role of distributed messaging systems like Kafka or RabbitMQ in a backend system.
Given an array like 1,2,2,2,3,3,3,4,5,6 change it in place such that any character repeats only twice and return the length of the new array. For example, for input 1,2,2,2,3,3,3,4,5,6, the output should effectively represent 1,2,2,3,3,4,5,6, with the array ending at index 7 (where the first 6 is present). Any elements after this index can be ignored.
In a binary tree, if any random node is put on fire, how much time will it take for the entire tree to be burnt if 1 edge takes 1 unit time? This problem equates to finding the farthest node from a given tree node.
Design a flight ticket booking system. First, an HLD (High-Level Design) was asked, followed by LLD (Low-Level Design) focusing on entities and database schema. Additionally, questions on authentication and authorization were discussed.