Dataford
Dataford
Top 50
Topic roadmap
Updated weekly · Last refresh Nov 1

Top 50 Dynamic Programming Interview Questions

The most frequently asked Dynamic Programming questions across all roles and companies, ranked by real interview frequency. Updated daily.

50questions
~21htotal time
402companies covered
Track your progressSign up free to work through all 50 questions and resume where you left off.
Start practicing free →
1
Dynamic ProgrammingStart here. 25 questions · ~625 min
Maximum Sum Contiguous SubarrayEasy
Practice
Recently asked

Use Kadane's algorithm to find the contiguous subarray with the largest sum in linear time.

Dynamic ProgrammingArraysGreedyMetaPublicis GroupeSmbc Global Foundation
Longest Common SubstringHard
Practice
Recently asked

Find the longest contiguous substring shared by two strings using dynamic programming.

Dynamic ProgrammingArraysStringsRentableEncompass HealthMORSE
Longest Palindromic SubstringHard
Practice
Recently asked

Find the earliest longest palindromic substring using Manacher's linear-time string algorithm.

Dynamic ProgrammingRobert SlackFFarm FamilyStarr Companies
More Dynamic Programming questions with a free account
2
Recursion14 questions · ~350 min
Reverse a Singly Linked ListEasy
Practice
Recently asked

Problem Given the head of a singly linked list, reverse the list, and return the new head node. The linked list is defined as follows: python class ListNo...

RecursionStackDynamic ProgrammingConstellation EnergyMeta ITSchneider Electric
Longest Common SubsequenceHard
Practice
Recently asked

Use dynamic programming to reconstruct a longest common subsequence shared by two Meta content strings.

RecursionDynamic ProgrammingStringsUnifyAdtalem Global EducationVirtual Vocations
Compute Nth Fibonacci NumberEasy
Practice
Recently asked

Compute the nth Fibonacci number using an iterative dynamic programming approach with O(n) time and O(1) space.

RecursionMathDynamic ProgrammingAAnnalectExperianAstyra
More Recursion questions with a free account

Sign up to see every question

Create a free account to unlock this list and practice real interview questions.

Get my prep plan
3
More topics11 questions · ~275 min
Maximum Subarray Using KadaneEasy
Practice
Recently asked

Compute the maximum contiguous subarray sum in O(n) time using Kadane's Algorithm.

Basic AlgorithmsDynamic ProgrammingArraysJJP Morgan ChaseRupeekPymetrics
Maintainable and Scalable CodeMedium
Practice
Recently asked

Implement a modular top-k frequency algorithm that scales with input size and preserves deterministic tie ordering.

clean codecode qualityDynamic ProgrammingTotalEnergiesJohnson & JohnsonL3Harris Technologies
More questions with a free account
The finish line: interview-readyComplete all 50 questions to finish this plan.