Interview Preparation Tips
Interview Preparation Tips
Please find below certain pointers on what you can expect from the interview: (60 Mins). Would
also recommend that you explore more questions on glassdoor.com, geeksforgeeks.com and
careercup.com for interviews.
● What’s your technical strengths and weaknesses – vis-à-vis last years of professional
work?
● What are the two most significant accomplishments – 1) Where you innovated 2)
Where you drove against the tide
● You will be expected to write a working and bug free production ready code and not a
pseudo code
● Optimize the code and check for edge cases, null cases, happy cases, etc. before you
present the code.
● Syntax, Return statements, Function declaration, Recursive code.
● Pointer manipulation, scope of variables, O(log n) lock and O(log n) unlock,
initialization.
● Should be able to take into account run-time/space-time complexity, In order &
preorder traversals, whether a null is a BST and whether a single node is a BST.
● Should be able to optimize the code, modular programming, & Dynamic
Programming.
Design: OOPS:
· Overloading vs. Overriding.
· Encapsulation and inheritance.
· inheritance and polymorphism
· HLD (Component wise segregation) – HLD provides an overview of a solution,
platform, system, product, service or process depicting the components, interfaces and
networks that need to be further specified or developed.
· LLD (Class & sequence diagram) – is like detailing the HLD. It defines the actual logic
for each and every component of the system. Class diagrams with all the methods and
relations between classes come under the LLD.
· Design patterns. Design tool if you’ve worked on any.
Page1
Problem Solving Skills
● Listen & understand the problem statement completely before attempting the solution
and avoid jumping on to the solutions abruptly(seek 100% information).
● Ask more clarifying questions and be receptive to hints provided by the interviewers.
Articulate and express thoughts clearly & crisp. Make the interviewing experience more
interactive.
● Should be able to deal with ambiguity.
Algorithm
● Sorting, Merging, Searching algorithms techniques.
Data Structures
● Uses and implementation of DS like link-list, queues, arrays, trees, binary trees, stacks,
and hashmap etc. The person should not only have conceptual knowledge, but should
use it).
● BFS, DFS, maximum number of nodes at a level of binary trees.
Other:
● Core Concepts of Programming
● Database
● Multithreading
● Microservices
2 focus
● How do you code
● Problem-solving
Page2