- Location: Hyd
- Role: SDE
- CGPA criteria: 8 (but only 9+ shortlisted)
- No. of Rounds – 4 (1 Online Assessment and 3 rounds of online Interview)
- Platforms – HackerEarth for Online Assessment and MS Teams for Interview
- Difficulty: Medium (varied slightly for different people)
- Only B.tech(CSE/IT) eligible.
Online Assessment
Some 5000 applied and 535 were selected for OA based on CGPA+Resume
Duration: 1.5 hour
Questions: 20 MCQs and 2 Coding questions
10 MCQs from the Aptitude Section, 10 Technical MCQs, 2 coding questions.
Coding questions:
- https://www.geeksforgeeks.org/dsa/count-pairs-natural-numbers-gcd-equal-given-number/ with a constraint of 10^5
- A debugging question in Java
The Round was video and audio proctored and was held from the college lab.
Online Interview Round 1
- Started with virtual destructor
- Hands on coding and demonstrating Inheritance all types
- Use of extern keyword and volatile keyword
- In-depth project discussion and demonstration using deployed link
- Scheduling algos in OS
- OSI Model in CN (hardware layers description)
- Types of design patterns
- How to implement LRU cache.
- Rat in a maze variation coded on notepad
- One Graph problem on notepad
- A number is given which is greater than 10^18 so you can't store this number in any data type. Find the last digit of its square.
At the end, he showed me my OA code and asked me to explain it.
Answered everything in this round.
Online Interview Round 2
Started with project discussion
- Why Reactjs
- Why mongoDB
- Why JWT
- Couldn't answer one question: difference between event loop of nodejs and browser
- Payment integration on website etc
- Internal implementation of Hashmap (ordered and unordered both), collision etc.
- Write a code in which you include all the 4 pillars oops and then demonstrate all the polymorphism and abstract class through code.
- delete vs free
- how does try catch work
- What is a mutable storage class specifier?
- What is Garbage Collection in Java?
- Depth of a tree and dry run it
- Bottom view of a tree code
- Diameter of a tree code
Answered everything except one i.e. event loop of nodejs and browser
Online Interview Round 3
Discussion on project.
- What are cookies
- A puzzle.
- Diamond problem in Java
- Use of interfaces
- Static keyword
- Difference between auto and register
- Heap and stack memory
- Malloc vs calloc vs new
- use cases of merge and quick sort.
- Create a n-ary tree node and write create delete functions
- Write a code for run time polymorphism
Asked 4-5 DSA questions but I was telling the approach the next second and even question number on leetcode so he laughed, asked how many have I solved on leetcode and skipped DSA but for info., these were asked and I just told approach in 1 sentence
- Longest Common Subsequence
- Longest substring having unique characters
- 2 sorted arrays given. Find median
- Word ladder
- Sorted 2-D matrix given. Find if a given number exists in it or not without using O(n^2).
This round went really smooth for me. He told me that I answered everything, I knew stuff and asked why am I not placed till now to which I answered that those who got placed before me must be more deserving than me and it's all about the right time and the right company. I feel this is the right time and the right company for me :)
Verdict: Selected.
Note: Interview level varied for everyone. Few people had HR in the 3rd round, some had only array/linked list questions in Tech rounds.
Connect with me:
LinkedIn: https://www.linkedin.com/in/divyansh-mishra-28335b1ba/
Twitter: https://x.com/okaydivyansh
