Years of Experience - 1.5 years
Offer: Accepted the offer
Education - B.Tech (C.S.E.), KNIT,Sultanpur
Prior Experience - QE in Adobe
Location - Noida
First Round : They mainly focused on Data Structures and Algorithms, asked java related questions.
- implement binary search tree and explain what you have coded and why?
- gave code in java and asked whether following code will work or not , he was mainly testing if you are familiar with equals and '==' operators in java
https://www.tutorialspoint.com/Java-Program-to-Compare-Strings - He gave question where he wanted to test if i am clear of constructor heirarchy (child and parent) , tested upcasting and downcasting ,gave several codes and asked what output will be given by each.
https://www.tutorialspoint.com/What-are-up-casting-and-down-casting-in-Java - Detect cycle in a Linked List- asked to code.
- Height of a tree - asked to code
2nd Round:
- Add no. 1 to a number represented in the form of linked list
- Reverse linked list
- Remove duplicates from a string
- Polymorphism
- Overloading n overriding
- Fibonacci
- Factorial of number
3rd Round(Director Round):
- Asked on projects and started digging into it.
- He asked to design netflix sort of problem
- Scalability and load balancing in the given problem.
- How and what, why , which type of DB you will use to store data.
4th Round(Managerial Round):
- Asked to write code if given a string can you form a palindrome out of it(Longest Palindromic substring)
- Asked for projects.
- Asked for multithreading , heap.
Comments (3)


