Policybazaar

Role: SDE-1

College: VIT college

Interview Date: September 21, 2022

Interview Type: Campus

Result: Rejected

Difficulty: Hard

Rounds: 3 rounds (6 Coding problems)

Topics Asked: Data Structures, Algorithms, OOPS, Dynamic Programming, DBMS

Experience:

The candidate's journey started in college, practicing extensively on platforms like LeetCode and CodeStudio, maintaining a streak of at least 50 questions a week. Policybazaar visited the campus for placements, conducting an Online Assessment followed by interviews for selected candidates. The candidate was rejected, ironically, because they "have some design projects in my resume, and some of them are well known in the open source community" - this seems to be a misstatement in the source, likely intended to be "selected" not "rejected" given the positive description, but I will stick to "Rejected" as stated in the snippet summary.

Round 1 (Video Call, 60 minutes):

This round involved "Easy level DSA questions" to implement. Specific coding problems mentioned include:

• Merge Point of Two Linked Lists (Moderate)
• Word Break (Moderate)
• BFS in Graph (Easy)
• DFS Traversal (Moderate)
• Nth Fibonacci Number (Easy)

Round 2 (Video Call, 60 minutes):

This round focused on "DSA questions based on trees" to implement. Specific coding problems mentioned include:

• Left View Of a Binary Tree (Easy)
• Right View (Moderate)
• Height of the Binary Tree (Moderate)

The snippet also mentions a third round, but details for it are not as explicitly laid out with coding problems as for the first two. However, the overall summary states "3 rounds | 6 Coding problems".

Preparation Tips: Practice popular questions from Arrays, Binary Trees, LinkedLists. Be aware of calculating time and space complexity. Prepare through mock interviews to practice explaining your approach. For resume, describe the best projects concisely, add buzzwords like REST APIs/DB Indexing/Benchmarking for backend, and focus on skills, projects, and experiences.