An Online Test (OLT) with two "tree" questions was conducted, and shortlisted candidates were then invited for interviews. The first round was very easy, featuring a simple LeetCode problem, as well as one question each from Operating Systems, Object-Oriented Programming, and Databases. The second round included another easy LeetCode "greedy" problem on merging intervals, plus a theoretical question on LRU cache.
No HR round.
