Ho sostenuto un colloquio presso GoComet (Bengaluru)
Colloquio
How to implement a stack which will support the following operations in O(1) time complexity? 1) push() which adds an element to the top of stack. 2) pop() which removes an element from top of stack. 3) findMiddle() which will return middle element of the stack. 4) deleteMiddle() which will delete the middle element. Push and pop are standard stack operations.
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso GoComet (Jalandhar, Punjab) nel mese di giu 2023
Colloquio
first round coding test after clearing this technical round in this round ask dsa question 2 and 1 was easy and 2nd was little bit tough. Question was create stack using queue.
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso GoComet
Colloquio
1. Aptitude and Coding Written Test for 1 hour 30 min - Candidate to Join Google Meet as per the Interview Schedule.
2. Tech Lead Interview on Logical Questions (Aptitude Round) - 30 min over a Google Meet.
3. Technical Round with Tech Manager - 1 hour over a Google Meet.
4. Final Round with CTO / CPO - 1 hour over a Google Meet.
Domande di colloquio [1]
Domanda 1
Aptitude Written Test.
F2F Aptitude Questions Asked by Tech Person
Technical Question Based on Backend
