Education: B.Tech in Computer Science and Engineering from a Tier-1 College
YOE: 0 (Campus Placement)
There was a DSA round followed by 3 interviews:
Round I – Online Assessment (DSA)
3 Questions:
Question 1 (50 points)
You are given an integer array of size n, where the i-th element represents the capacity of the i-th room.
You are also given an array of queries. Initially, you are at the first element. There are 3 types of queries:
- Type 1: Given X → Move the current position X rooms to the right.
- Type 2: Given Y → Move the current position Y rooms to the left.
- Type 3: Given A and B → If you are at the i-th element, remove the room at position i+1 and add 2 new rooms immediately to the right of room i with capacities A and B.
Return the final array after performing all operations.
Constraints: n ≤ 10^5 , q≤ 10^5
Topics Involved: Arrays, Doubly Linked List
Question 2 (50 points)
Minimum Time for K Connected Components – a slightly modified version.
We had to find the minimum time when all components become connected.
Constraints: Graph size ≤ 10^5
Topics Involved: Binary Search, DSU
Question 3 (100 points)
You are given a string of length 10^4 representing a large numberand another number X(in the range [1,100]), and Q queries (Q ≤ 10^6). Each query contains a number K (0,99). For each query, determine whether there exists a subsequence such that the number formed by the subsequence modulo X equals K.
Topics Involved: Digit DP
Performance: Solved all 3/3; shortlisted for the next round.
Round II – Technical Interview (DSA)
You are given a tree-like structure where each node represents a category, and its children represent subcategories, for example:
Fashion
|
|-------Mens
| |--->Shirts
| |--->Round Neck
| |--->V Neck
|
|-------Womens
|--Dresses
|--JeansConstraints:
- Max Depth: 20
- Large number of nodes
There will be Q queries (Q ≤ 10^5) of 2 types:
- Type 1:
IngestOrder(Date, Quantity, Category)– An order with quantity Q of category C placed on date D. - Type 2:
Query(Category, StartDate, EndDate)– Returns the number of orders of that category within the date range [StartDate, EndDate].
Only Pseudocode was expected
Topics Involved: DFS, Segment Tree/Fenwick Tree (BIT)
Performance: Solved in ~25 minutes.
Round III – Machine Coding
Problem: Design a carpooling system.
Details and sample solution: Link here
Performance: Slightly over-engineered a few classes and couldn’t run the code due to time constraints, but the interviewer appreciated the approach and thought process. Cleared this round.
Round IV – Resume + CS Fundamentals + Behavioural Interview
- Questions around resume and previous internship experience.
- Discussions about tech stack, motivations, and design choices.
- CS Fundamentals:
- Processes vs Threads
- C vs C++ vs Java vs Python
- Networking layers
- Behavioural questions
Performance: Cleared this round as well.
