Rappi Coding Interview Questions
25 Rappi coding interview problems with full optimal solutions — 8 easy, 12 medium, 5 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Rappi interviewer values, and a FAQ section.
Showing 8 problems of 25
- #1easyfoundational
1. Two Sum
Find two indices whose values sum to a target — Rappi frames this as finding two courier earnings entries that sum to a promised payout.
- #2easyfoundational
2. Same Tree
Decide if two binary trees are structurally identical — Rappi frames this as confirming two dispatch routing trees produce the same courier hand-off sequence.
- #3easyfoundational
3. Maximum Depth of Binary Tree
Compute the height of a binary tree — Rappi frames this as measuring the longest hand-off chain in a multi-courier relay routing graph.
- #4easyfoundational
4. Best Time to Buy and Sell Stock
Find the max profit from one buy and one sell in a price series — Rappi frames this as picking the best courier-rate window to lock in for a delivery cohort.
- #5easyfoundational
5. Single Number
Find the one element that appears once when every other element appears twice — Rappi frames this as finding the odd-out courier ID in a paired-shift roster.
- #6easyfoundational
6. Linked List Cycle
Detect whether a linked list contains a cycle — Rappi frames this as catching a circular hand-off in a courier-to-courier relay before it deadlocks dispatch.
- #7easyfoundational
7. Min Stack
Design a stack that supports push, pop, top, and retrieving the minimum in constant time — Rappi frames this as tracking the lowest-ETA candidate in a dispatch queue without rescanning.
- #8easyfoundational
8. Majority Element
Find the element that appears more than half the time in an array — Rappi frames this as finding the dominant pickup zone in a streaming feed of courier check-ins.