home
data-structures-and-algorithms-in-java-levelup
dynamic-programming
Profile
Logout
Editor
Login
Theme1
Theme2
Theme3
Theme4
Redirecting to
NADOS
Lectures Summary
Resource Type
All
Video
Question
MCQ
Topic
Difficulty
All
easy
medium
hard
Largest Square Sub-matrix With All 1's
medium
Print All Paths With Minimum Jumps
medium
Print All Paths With Minimum Cost
medium
Print All Paths With Maximum Gold
medium
Print All Paths With Target Sum Subset
medium
Print All Results In 0-1 Knapsack
medium
2 Key Keyboard
medium
4 Key Keyboard
hard
Longest Increasing Subsequence
medium
Print All Longest Increasing Subsequences
easy
Maximum Sum Increasing Subsequence
easy
Longest Bitonic Subsequence
easy
Maximum Non-overlapping Bridges
easy
Russian Doll Envelopes
hard
Min Squares
easy
Catalan Number
easy
Number Of Bsts
medium
Count Of Valleys And Mountains
easy
Count Brackets
easy
Circle And Chords
easy
Number Of Ways Of Triangulation
easy
Catalan Numbers Variation
Matrix Chain Multiplication
medium
Burst Balloons
hard
Minimum Score Of Triangulation
medium
Boolean Parenthesization
easy
Optimal Binary Search Tree
easy
Rod Cutting
easy
Minimum Palindromic Cut
easy
Longest Common Subsequence
medium
Longest Palindromic Subsequences
medium
Count Palindromic Subsequences
hard
Count Palindromic Substrings
medium
Longest Palindromic Substring
medium
Count Distinct Subsequences
easy
Count Of Distinct Palindromic Subsequences
medium
Wildcard Pattern Matching
medium
Regular Expression Matching
hard
Longest Common Substring
easy
Longest Repeating Subsequence
medium
Edit Distance
hard
Scramble String
hard
Minimum Ascii Delete Sum For Two Strings
medium
Minimum Cost To Make Two Strings Identical
easy
Kadane's Algorithm
easy
K Concatenation
medium
Maximum Sum Subarray With At Least K Elements
medium
Egg Drop
hard
Optimal Strategy For A Game
easy
Cherry Pickup
hard
Probability Of Knight In The Chessboard
medium
Highway Billboard
medium
Distinct Transformations
medium
Numeric Keypad
medium
Maximum Difference Of Zeros And Ones In Binary String
easy
Maximum Sum Of Two Non-overlapping Subarrays
medium
Maximum Sum Of Three Non-overlapping Subarrays
hard
Maximum Sum Of M Non-overlapping Subarrays
hard
Arithmetic Slices 1
medium
Arithmetic Slices 2
hard
Word Break
medium
Temple Offerings
medium
Minimum Insertions To Make Palindrome
easy
Ugly Number
medium
Super Ugly Number
medium
Find Water In Glass
medium
Frog Jump
hard
Interleaving Of Two Strings
medium
Maximum Length Of Repeated Subarray
medium
Distinct Echo Substrings
hard
Minimum Cost To Cut A Stick
hard
Delete And Earn
medium
Number Of Good Ways To Split A String
medium
Minimum Cost For Tickets
medium
Minimum Ascii Delete Sum For Two Strings
medium
Maximum Alternating Subsequence Sum
medium
Stone Game
medium
Largest Multiple Of Three
hard
Longest Increasing Subsequence
Maximum Sum Increasing Subsequence
Longest Bitonic Subsequence
Temple Offerings
Count Palindromic Substrings
Minimum Score Of Triangulation
Catalan Numbers Variation
Print All Paths With Minimum Jumps
Maximum Sum Of Two Non-overlapping Subarrays
Arithmetic Slices - 2
Longest Common Substring
Count Brackets
Minimum Cost To Make Two Strings Identical
Number of Ways of Triangulation
Russian Doll Envelopes
Maximum Non - Overlapping Bridges
Kadanes Algorithm
Count Palindromic Subsequence
Circle and Chords
Optimal Strategy For a Game
Maximum Sum of 3 Non-Overlapping Subarrays
Print All Paths With Target Sum Subset
Regular Expression Matching
Number of BSTs
Count of Valleys and Mountains
Longest Palindromic Substrings
Distinct Transformations
Find Water In Glass
Arithmetic Slices - 1
Largest Square Sub Matrix with all 1s
Maximum Length of Repeated Subarray
All Repeating Except One
Min Squares
Numeric Keypad
Word Break-2
Minimum Palindromic Cuts
Rod Cutting
Burst Balloons
Maximum Sum Of M Non-overlapping Subarrays
Print All Longest Increasing Subsequences
Longest Common Subsequence
Count Distinct Subsequences
Print All Paths With Minimum Counts
Print all Paths with Maximum Gold
Print All Results In 0-1 Knapsack
Wildcard Pattern Matching
Catalan Numbers
Boolean Parenthesization
Optimal Binary Search Tree
Longest Repeating Subsequence
Minimum Ascii Delete Sum for Two Strings
Edit Distance
K Concatenation
Maximum Sum Subarray With At Least K Elements
Egg Drop
Scramble String
Highway Billboard
Minimum Insertions To Make Palindrome
Ugly Number
Super Ugly Number
Frog Jump
Interleaving of two strings
Stats
View all Stats
⟶
{ }
Run
Editor Settings
Font Size
Key Binding
Keyboard Shortcut
fold
Alt-L|Ctrl-F1
unfold
Alt-Shift-L|Ctrl-Shift-F1
Gotoend
Ctrl-End
Gotostart
Ctrl-Home
Movelinesup
Alt-Up
Movelinesdown
Alt-Down
Undo
Ctrl-Z
Redo
Ctrl-Shift-Z|Ctrl-Y
Replace
Ctrl-H
Togglecomment
Ctrl-/
ToggleBlockComment
Ctrl-Shift-/
Removeline
Ctrl-D
Id
Name