Selection Process: Resume Shortlisting → Online Assessment → Technical Interview Round 1 → Technical Interview Round 2 → Result via college placment cell
The online assessment consisted of MCQs and coding questions.
Question 1: Longest Consecutive Repeated-Character Run Given a lowercase string, find the longest consecutive sequence of identical characters. Return a sequence of consecutive alphabet characters starting from that character, with the same length as the longest run.
Example: Input:
accttjkloccpppqqq
Output:
pqr
Question 2: Maximum Sum Path in a Grid Given an N × N grid, find the maximum possible sum along a path from the top-left cell to the bottom-right cell. You can move only right or down. inal wording.
Technical Interview — Round 1
This round focused on DSA, algorithmic reasoning, and debugging.
The problem involves determining a valid order in which courses can be completed given their prerequisites. Explaining the logic and working through hints helped during the discussion.
The objective is to find the shortest non-empty contiguous subarray whose sum is at least K.
Last updated Oct 17, 2026
Technical Interview — Round 2 - Google Docs
Given a circular arrangement of houses, maximize the amount of money that can be robbed without robbing two adjacent houses.
Design an LRU cache that supports a Time-To-Live (TTL) mechanism.
Key Requirements:
worked through the design in a plain Google Docs document without compiler assistance.
Note: The process moved fast. R 2 was decided within an hour of R 1.