**OA :** Complex Greedy Question & simple DFS with Bit Manipulation\n\n**Interview 1 :** Project Discussion & Variation of https://leetcode.com/problems/leaf-similar-trees/description/ (expected solution with a single DFS call)\n\n**Interview 2 :** \n* A long problem description (like that on CodeForces or CodeChef) but boiled down to a simple DFS with edge case handling \n* Detecting start of a cycle in a Linked List (with mathematical derivation of the solution and why slow & fast pointers would work)\n\n**Interview 3 :** Behavourial Questions, Project Discussion & https://leetcode.com/problems/peeking-iterator/description/ (Discussion on Pros & Cons of Eager and Lazy Evaluation)\n\n*HM Round was scheduled but recruiter mentioned that someone else was already hired, so they won\'t be going ahead with the candidature but might callback in future.*\n\nYOE :  1.5yrs \nExisting Comp : 50 lpa in FAANG \nApplication : Referral

OA : Complex Greedy Question & simple DFS with Bit Manipulation\n\nInterview 1 : Project Discussion & Variation of https://leetcode.com/problems/leaf-similar-tr