A structured approach works best. Focus on problem-solving patterns such as sliding window, graphs, BFS/DFS, heaps, dynamic programming, and trees. Many candidates use the Namaste DSA course to build these foundations systematically before solving company-specific problems.
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.
Yes. Problems like Longest Increasing Subsequence, Coin Change, and other optimization-based DP questions have appeared in interview experiences shared by candidates.
Browse all our FAQs or reach out to our support team
Your learning library
Find your next course. Build something great.
