Dynamic Programming Interview Questions
4 questions available. Practice with AI-powered feedback.
Other topics
Bloomberg Coding: Grid Shortest Path with K Breaks
Bloomberg coding: shortest path in a grid with up to k wall removals. Learn BFS-with-state, complexity O(m*n*k), optimizations and interview tips. Try it.
Google Coding Question: Task Scheduling with Precedence
Minimal makespan for DAG tasks with durations and precedence constraints on unlimited or M CPUs. Includes algorithms, complexity notes, and follow-ups.
Intuit Coding Question: Sum of Palindrome Modification Costs
Sum minimum single-character changes to make every substring of a DNA string a palindrome. Learn two-pointer and combinatorics approaches for Intuit coding prep.
Microsoft Coding Interview: Longest Palindromic Subsequence
Learn to compute the Longest Palindromic Subsequence using dynamic programming and space-optimized DP. Step-by-step approach, edge cases, and practice prompts.
Get More Real Dynamic Programming Questions
Practice dynamic programming interview questions with AI-powered hints, analysis, and feedback.
Start Free Practice