Google Dynamic Programming Problems | PrepFlow | PrepFlow

PrepFlow

Jobs
ATS Checker
Companies
DSA Sheets
Compiler

PrepFlow

Streamline your DSA prep with structured sheets and company-wise problems.

Quick Links

Jobs
ATS Checker
Companies
DSA Sheets
Compiler

Developed and Maintained By

Rayudu Bharani

Cygnuxxs

© 2026 PrepFlow. All rights reserved.

Privacy Policy | Terms of Service

Login Required!

You need to log in to access your saved progress.

Companies
Google
Dynamic Programming

Dynamic Programming

Overall Progress0/121(0%)

Easy

0/5

Medium

0/62

Hard

0/54

Maximum Subarray

Medium

Trapping Rain Water

Hard

Best Time to Buy and Sell Stock

Easy

Longest Palindromic Substring

Medium

Climbing Stairs

Easy

Generate Parentheses

Medium

Longest Increasing Subsequence

Medium

Medium

Maximum Product Subarray

Medium

Medium

Binary Tree Maximum Path Sum

Hard

Medium

Medium

Pascal's Triangle

Easy

Palindrome Partitioning

Medium

Minimum Path Sum

Medium

Regular Expression Matching

Hard

Medium

Perfect Squares

Medium

Palindromic Substrings

Medium

Maximal Rectangle

Hard

Medium

House Robber II

Medium

Split Array Largest Sum

Hard

Best Time to Buy and Sell Stock III

Hard

Hard

Longest Increasing Path in a Matrix

Hard

Wildcard Matching

Hard

Fibonacci Number

Easy

Sum of Subarray Minimums

Medium

Unique Binary Search Trees II

Medium

Best Time to Buy and Sell Stock IV

Hard

Longest String Chain

Medium

Hard

Partition to K Equal Sum Subsets

Medium

Maximum Length of Repeated Subarray

Medium

Distinct Subsequences

Hard

Russian Doll Envelopes

Hard

Predict the Winner

Medium

Delete Operation for Two Strings

Medium

Hard

Sum of Distances in Tree

Hard

Palindrome Partitioning II

Hard

Number of Matching Subsequences

Medium

Ones and Zeroes

Medium

Binary Tree Cameras

Hard

Count Square Submatrices with All Ones

Medium

Medium

All Possible Full Binary Trees

Medium

Pascal's Triangle II

Easy

Longest Arithmetic Subsequence

Medium

Minimum Number of Refueling Stops

Hard

Minimum Cost to Cut a Stick

Hard

Shortest Path Visiting All Nodes

Hard

Cherry Pickup II

Hard

As Far from Land as Possible

Medium

Domino and Tromino Tiling

Medium

Medium

Arithmetic Slices II - Subsequence

Hard

Medium

Longest Arithmetic Subsequence of Given Difference

Medium

Number of Ways to Arrive at Destination

Medium

Medium

Student Attendance Record II

Hard

Hard

Super Ugly Number

Medium

Guess Number Higher or Lower II

Medium

Smallest Sufficient Team

Hard

Count Submatrices With All Ones

Medium

Number of Good Ways to Split a String

Medium

Hard

Medium

Kth Ancestor of a Tree Node

Hard

Count Different Palindromic Subsequences

Hard

Hard

Profitable Schemes

Hard

Number of Ways of Cutting a Pizza

Hard

Number of Ways to Reorder Array to Get Same BST

Hard

Maximum Score Words Formed by Letters

Hard

Find Two Non-overlapping Sub-arrays Each With Target Sum

Medium

Hard

Rotate Function

Medium

Medium

Minimum Number of Increments on Subarrays to Form a Target Array

Hard

Count Numbers with Unique Digits

Medium

Shopping Offers

Medium

Optimal Account Balancing

Hard

Sort Integers by The Power Value

Medium

Unique Substrings in Wraparound String

Medium

Minimum Window Subsequence

Hard

Find the Shortest Superstring

Hard

Integer Replacement

Medium

Sentence Screen Fitting

Medium

Number of Restricted Paths From First to Last Node

Medium

Pizza With 3n Slices

Hard

Minimum Distance to Type a Word Using Two Fingers

Hard

Medium

Minimum Number of Days to Eat N Oranges

Hard

Medium

Campus Bikes II

Medium

Hard

Longest Line of Consecutive One in Matrix

Medium

Maximum Non Negative Product in a Matrix

Medium

Medium

4 Keys Keyboard

Medium

Closest Dessert Cost

Medium

Longest Repeating Substring

Medium

Form Largest Integer With Digits That Add up to Target

Hard

Longest Chunked Palindrome Decomposition

Hard

Encode String with Shortest Length

Hard

Medium

Delete Columns to Make Sorted III

Hard

Maximum Vacation Days

Hard

Shortest Distance to Target Color

Medium

Minimum Cost to Connect Two Groups of Points

Hard

Distribute Repeating Integers

Hard

The Most Similar Path in a Graph

Hard

Maximum Number of Groups Getting Fresh Donuts

Hard

Cat and Mouse II

Hard

Hard

Count Ways to Distribute Candies

Hard

Visitors5

Compiler Status