Piramal

Role: SDE-1

College: Not Specified

Interview Date: March 2022

Interview Type: Not Specified

Result: Not Specified

Difficulty: Not Specified

Rounds: 1 Coding Round

Topics Asked: Data Structures, Algorithms (Array, Binary Tree)

Experience:

This experience details a coding round for an SDE-1 position at Piramal.

Round 1: Coding Round

Two coding questions were asked in this round.

• Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product and return the product. It is guaranteed that the answer will fit in a 32-bit integer. A subarray is a contiguous subsequence of the array.
• Given a binary tree, a target node in the binary tree, and an integer value k, print all the nodes that are at a distance k from the given target node. No parent pointers are available.