Cleartrip coding interview
questions, leaked.
4 problems reported across recent Cleartrip interviews. Top patterns: array, hash table, dynamic programming. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Cleartrip's assessment is small but dense. Four problems, three medium and one hard, means you're being tested on pattern recognition and execution speed, not breadth. Arrays dominate every single problem they ask, so you need to own array manipulation cold. The hard one is a grid shortest-path problem that chains together BFS, heap logic, and graph traversal. You'll have maybe 90 minutes to prove you can think under pressure. If you blank on the hard one mid-assessment, StealthCoder runs invisibly and surfaces a working solution while the proctor sees only your screen.
Top problems at Cleartrip
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Minimum Cost to Make at Least One Valid Path in a Grid | HARD | 100.0 | 71% | Array · Breadth-First Search · Graph |
| 02 | Word Break | MEDIUM | 100.0 | 48% | Array · Hash Table · String |
| 03 | House Robber | MEDIUM | 100.0 | 52% | Array · Dynamic Programming |
| 04 | Rabbits in Forest | MEDIUM | 100.0 | 58% | Array · Hash Table · Math |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Cleartrip OA. The proctor cannot see it. Screen share cannot detect it. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround.
Get StealthCoder- array4 · 100%
- hash table2 · 50%
- dynamic programming2 · 50%
- breadth first search1 · 25%
- graph1 · 25%
- heap priority queue1 · 25%
- matrix1 · 25%
- shortest path1 · 25%
- string1 · 25%
- trie1 · 25%
The signal is clear: drill arrays and dynamic programming first. Every problem touches arrays, and three out of four fold in DP or greedy logic. Hash tables and strings show up once each, so don't skip them, but they're secondary. The hard problem, 'Minimum Cost to Make at Least One Valid Path in a Grid,' requires you to combine shortest-path thinking with priority queues and matrix indexing all at once. It's the kind of problem that looks like five problems stacked together. The medium problems, 'Word Break,' 'House Robber,' and 'Rabbits in Forest,' test whether you can spot when to use memoization and hash tables to avoid brute force. Go in with array slicing and DP recurrence relations locked in. If you hit a wall on the grid problem live, StealthCoder is your hedge.
Companies with similar patterns
If you prepped for Cleartrip, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Cleartrip.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Cleartrip interview FAQ
Should I spend more time on the hard problem or the three mediums?+
Both. The hard problem is worth real points, but you can't afford to tank the mediums due to careless mistakes. Solve all three mediums cleanly first, then spend remaining time on the hard grid problem. If you're stuck on hard during the OA, move on and come back.
Do I need to know Dijkstra's algorithm for Cleartrip?+
The grid problem uses shortest-path logic and a priority queue, which overlaps with Dijkstra-style thinking. You don't need textbook Dijkstra, but you need comfort with heap-based pathfinding and BFS on weighted graphs. Practice one or two shortest-path problems before the OA.
What should I drill first: dynamic programming or hash tables?+
Dynamic programming. It appears in three of the four problems, including 'Word Break' and 'House Robber.' Hash tables appear in two problems but mostly as a supporting data structure. Lock down DP recurrence and memoization patterns first, then hash-table logic.
How important is the 'Rabbits in Forest' problem?+
It's one of four, so don't ignore it, but it's the gentlest medium. It combines arrays and hash tables with greedy math logic. Solve it to build confidence, then focus energy on 'House Robber' and 'Word Break,' which test deeper DP understanding.
Is four problems enough to prepare for Cleartrip?+
Not really. Four reported problems means the list is incomplete or the assessment varies. Use these four as your anchor, but drill 15 to 20 array and DP problems from a problem bank to be safe. Cleartrip likely rotates harder variants in the live OA.