Novel Patterns Private Limited Interview Questions and Answers

2hrs aptitude test was there

2 hrs coding test was there

GD was conducted and then i passed it

Round one consist of coding problems and there's a minimum criteria of solving 2 problems at least to clear this round

Q1. First question was a coding question, merge intervals leetcode
Add your answer
Q2. Second question was again of leetcode, compare strings
Add your answer

Machine coding round where SOLID principles are evaluated for real life use case

Machine coding round.

Q1. Algorithm to calculate top k flight from source to destinaton.
Ans. 
Use Dijkstra's algorithm to find the top k shortest paths from source to destination.
• Implement Dijkstra's algorithm to find the shortest paths from source to all other nodes.

• Store the top k shortest paths found in a priority queue or heap.

• Return the top k shortest paths as the result.
Answered by AI
Add your answer

Implement phone directory search system