1st Round Questions: 1. Find a pair in a rotated sorted array whose sum is equal to a given value 'k' 2. Check parenthesis in an expression and return true/false for valid/invalid. 3. Bottom view of a Binary tree. Questions related to Java Collections 2nd Round Questions: 1. Parking lot low level design. 2. Design patterns - Singleton, Factory etc 3. Various questions related to advanced multithreading in java.
Round 1. Tweaked version of this - https://www.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1 Given a tree, find bottom view - 1 / \ 3 2 / \ / \ 4 5 6 7 Expected output - 4 3 5 6 2 7 (Not 4 3 6 2 7)
What is http? What are http headers? What are the methods? What are http verbs?
Q. Design a tailf command like functionality Q. Tell me about your previous company experience and how u handled pressure situation ?
Explain one of your project
Tech stack from the previous company
about system design and dsa
they had a dsa round+ system design round+ hr round. dsa round was an interval sort question on compiler.
Trees, dynamic programming, operating systems, DBMS
Q) Explain about the Projects done during the Final Semester?
Viewing 1961 - 1970 interview questions