The answer
Yes. Problems like Longest Increasing Subsequence, Coin Change, and other optimization-based DP questions have appeared in interview experiences shared by candidates.
Top DSA interview questions asked in Delhivery
Does Delhivery ask Dynamic Programming questions?
More FAQs in Top DSA interview questions asked in Delhivery
Delhivery frequently asks graph, BFS, DFS, shortest path, arrays, linked lists, dynamic programming, and caching problems. Many candidates report medium-level LeetCode-style questions during technical rounds.
Yes. Since Delhivery operates large-scale logistics and routing systems, graph-related concepts such as BFS, DFS, shortest paths, connectivity, and cycle detection are commonly discussed during interviews.
Most candidates describe the DSA rounds as LeetCode Medium level. Strong fundamentals in arrays, strings, graphs, linked lists, and trees are usually sufficient for clearing the coding rounds.
Still have questions?
Browse all our FAQs or reach out to our support team
Want to upskill yourself?
Your learning library
Small steps. Big possibilities.
Find your next course. Build something great.