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 5 problems of 25
- #21hardfoundational
21. Sliding Window Maximum
Return the max in each window of size k as it slides across the array — Rappi frames this as reporting the peak courier supply in a rolling time-window during dispatch matching.
- #22hardfoundational
22. Find Median from Data Stream
Support addNum and findMedian on a streaming sequence of integers — Rappi frames this as tracking the running median delivery ETA across an open stream of in-flight orders.
- #23hardfoundational
23. LFU Cache
Implement a least-frequently-used cache with O(1) get and put — Rappi frames this as caching hot pickup-zone lookups in dispatch where stale low-traffic zones must be evicted first.
- #24hardfoundational
24. Basic Calculator
Evaluate a string containing +, -, parentheses and integers — Rappi frames this as parsing a nested promo-rule expression like '(base + tip) - discount' applied to a courier payout statement.
- #25hardfoundational
25. Maximum Number of Tasks You Can Assign
Given task strengths, worker strengths, available pills that each boost one worker by a fixed amount, find the max tasks completable — Rappi frames this as the max number of delivery orders matchable to couriers when a fixed pool of surge-credits can boost capacity.