DS - ALGO + Design Round .
Linked Lists: Be prepared to perform operations such as deleting a node from a linked list.
Trees and Graphs: Practice implementing traversal algorithms like BFS and Depth-First Search (DFS).
Arrays and Strings: Understand various manipulation, searching, and sorting techniques.
Stacks and Queues: Know their applications, especially in expression evaluation and parsing.
Hashing: Learn about hash tables, collision resolution, and their applications.
Dynamic Programming: Work on problems related to optimization and decision-making.
Recursion and Backtracking: Solve problems that require exploring all possibilities, such as generating permutations and combinations.
Sorting and Searching: Be proficient in various sorting algorithms and search techniques.
Domande di colloquio [1]
Domanda 1
Linked Lists: Be prepared to perform operations such as deleting a node from a linked list.
Trees and Graphs: Practice implementing traversal algorithms like BFS and Depth-First Search (DFS).
Arrays and Strings: Understand various manipulation, searching, and sorting techniques.
Stacks and Queues: Know their applications, especially in expression evaluation and parsing.
Hashing: Learn about hash tables, collision resolution, and their applications.
Dynamic Programming: Work on problems related to optimization and decision-making.
Recursion and Backtracking: Solve problems that require exploring all possibilities, such as generating permutations and combinations.
Sorting and Searching: Be proficient in various sorting algorithms and search techniques.
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Primetrace (Bengaluru)
Colloquio
Phone call with HR regarding the company followed by online technical rounds on a 3rd party software. They will ask you to code the solution and run given testcases. Check for all the corner cases
Domande di colloquio [1]
Domanda 1
Given a list of object have prices , items sort the list based on minimum prices of the items
