ROUND 1: Coding + Data Structures & Algorithms (Intermediate)
Arrays & Strings
1. Given an array of integers, find the length of the longest subarray with sum = K.
2. Check whether two strings are one edit away (insert, delete, or replace one
character).
3. Rotate an array to the right by k steps without using extra space.
4. Find the first non-repeating character in a string.
Linked List
5. Detect a cycle in a linked list and return the node where the cycle begins.
6. Reverse a linked list in groups of size k.
7. Find the middle element of a linked list in one traversal.
Stack & Queue
8. Implement a stack using queues.
9. Given a string of brackets, check if it is balanced.
10. Design a queue that supports getMin() in O(1).
Trees
11. Check if a binary tree is height balanced.
12. Find the lowest common ancestor (LCA) of two nodes in a binary tree.
13. Print the top view of a binary tree.
Searching & Sorting
14. Explain Quick Sort and analyze its best, average, and worst case.
15. Find the kth largest element in an unsorted array efficiently.
16. Search an element in a rotated sorted array.
Dynamic Programming (Intermediate)
17. Solve Longest Common Subsequence (LCS) using DP.
18. Given coin denominations, find the minimum number of coins to make a value.
19. House Robber problem – explain your approach.
ROUND 2: Design + Problem Solving (Intermediate)
System / Low-Level Design
20. Design a URL shortener (basic design).
21. How would you design a parking lot system? (classes, objects, flow)
22. Design a rate limiter for an API.
23. Explain how caching improves system performance. Where would you use it?
Open-Ended Problem Solving
24. You are given millions of logs. How will you detect duplicate logs efficiently?
25. How would you handle a system where read requests are much higher than write
requests?
26. If a system becomes slow suddenly, how will you debug the issue?
ROUND 3: AI + Logical Thinking (Intermediate)
AI / ML Basics
27. Difference between supervised and unsupervised learning.
28. What is overfitting? How do you prevent it?
29. Explain precision, recall, and F1-score with examples.
30. Difference between classification and regression.
Applied AI Thinking
31. How would you detect spam emails? (high-level pipeline)
32. How does a recommendation system work?
33. If your model performs well on training data but poorly on test data, what does it
mean?
CCAT / Cognitive Aptitude (Very Important)
34. Find the next number in the series:
2, 6, 12, 20, 30, ?
35. If ALL BLOOPS are RAZZIES and ALL RAZZIES are LAZZIES, are ALL BLOOPS LAZZIES?
36. A clock shows 3:15. What is the angle between the hour and minute hand?
37. Logical puzzle:
• 5 people sit in a row
• A sits next to B
• C cannot sit at the ends
• D sits to the right of C
→ Find all valid arrangements.
Resume + Behavioral (Trilogy Style)
38. Explain a complex problem you solved using code.
39. A time when your solution failed—what did you learn?
40. Why should we hire you as a problem solver, not just a coder?
41. How do you handle ambiguous requirements?