Dynamic Programming

Learn memoization, tabulation, and optimal substructure — the category that separates good candidates from great ones in technical interviews.

8 exercises

mediumPython

Minimum Jumps to Reach End

# Minimum Jumps to Reach End Implement a function that finds the minimum number of jumps needed to reach the last index...

arraysgreedydynamic-programming+4

hardPython

0/1 Knapsack Problem Solver

Implement a solution to the classic 0/1 knapsack problem using dynamic programming. Given a knapsack with a weight capa...

dynamic-programming

mediumPython

Word Break Problem

Build a function that determines if a string can be segmented into words from a given dictionary. ## Function Signature...

dynamic-programming

mediumPython

Longest Increasing Subsequence

# Longest Increasing Subsequence Implement a function that finds the length of the longest increasing subsequence (LIS)...

dynamic-programming

easyPython

Fibonacci with O(1) Space

Write a function that returns the nth Fibonacci number using O(1) space complexity (no arrays or additional data structu...

fibonacci

easyPython

Climbing Stairs

Build a function that computes how many distinct ways you can climb n stairs, taking 1 or 2 steps at a time. For exampl...

dynamic-programming

mediumPython

Island Counter - 2D Grid Traversal

Write a function that counts the number of islands in a 2D binary grid. An island is surrounded by water and is formed b...

algorithms

hardPython

Longest Palindromic Substring

Implement a function that finds the longest palindromic substring in a given string. ## Requirements - Return the long...

strings