Piramal

Role: Software Engineer

College: Not Specified (Applied through college TNP cell)

Interview Date: 4 Nov 2021, 5 Nov 2021

Interview Type: On-Campus

Result: Selected

Difficulty: Easy to Moderate

Rounds: 3 rounds

Topics Asked: Data Structures, Algorithms (Trees, Dynamic Programming), OOPS, Operating Systems, C

Experience:

The candidate applied through their college's Training and Placement (TNP) cell, where Piramal HRs circulated a Google form for applications, shortlisting approximately 20 students. The preparation involved practicing DSA from platforms like LeetCode and GeeksforGeeks, and studying core subjects like OS, CN, and DBMS from college materials. The candidate emphasized in-depth knowledge of advanced DSA topics, particularly Trees, which was a key factor in their selection.

Round 1: Online Coding Test (90 minutes)

This was an easy-difficulty qualifying round with two coding questions.

• Longest Increasing Subsequence.
• Optimal BST: Construct a binary search tree from given keys and frequency counts such that the total cost of all searches is minimum.

Round 2: Face to Face (60 minutes)

This round involved two medium-difficulty coding problems.

• Ninja And The Rows (a specific problem name, likely a matrix or array-based problem).
• Next Greater Element.

Round 3: Face to Face (50 minutes)

This was another coding round of easy difficulty.

• Isomorphic Trees.

Tips: The candidate advised coding daily, thoroughly studying Data Structures, maintaining confidence, and being precise about what is mentioned in the resume, including tools and technologies used in projects.