schlumberger | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The interview consisted of three simple algorithm questions. The first question involved determining whether a scenario could be implemented using a hashmap. The second question focused on the complexity of a heap, including operations such as inserting elements, searching for elements, updating elements, heapifying, and retrieving the top element. The third question was about recursively reversing a linked list, discussing time complexity (TC) and space complexity (SC).
Following these, there were two additional questions that felt like easy to medium difficulty. The first involved checking the legality of moving in a grid and using depth-first search (DFS) to find the endpoint. Candidates were required to write their own test cases. The interview was conducted in a way that felt quite human, but nerves affected performance, leading to mistakes such as accidentally deleting a bracket, which consumed a lot of time. The second DFS question was completed under time constraints, primarily due to a lack of experience.
Technical Questions
- Reverse Linked List (Linked List, Recursion)
Tips & Insights
Stay calm during the interview to avoid mistakes. Practice writing test cases and be familiar with DFS and grid-related problems.