Problems

13 problems

• Easy

  Best Time to Buy and Sell Stock

  You are given an array prices where prices[i] is the price of …

  Arrays Dynamic Programming
• Easy

  Pascal's Triangle II

  Return the rowIndex-th row of Pascal's triangle.

  Arrays Dynamic Programming
• Easy

  Min Cost Climbing Stairs

  Return minimum cost to reach the top.

  Dynamic Programming
• Medium

  Longest Palindromic Substring Length

  Return the length of the longest palindromic substring.

  Dynamic Programming Strings
• Medium

  House Robber II

  Houses are in a circle. Return max amount you can rob.

  Dynamic Programming
• Medium

  Target Sum Ways

  Assign + or - to each number. Return number of ways to …

  Backtracking Dynamic Programming
• Medium

  Minimum Path Sum

  Move only right or down; return min path sum to bottom-right.

  Dynamic Programming Matrix
• Medium

  Word Break

  Return true if s can be segmented into dictionary words.

  Dynamic Programming Strings
• Medium

  Decode Ways

  Return number of ways to decode the string.

  Dynamic Programming Strings
• Medium

  Unique Binary Search Trees

  Return number of structurally unique BSTs that store values 1..n.

  Dynamic Programming Math
• Hard

  Edit Distance

  Return minimum number of operations to convert word1 to word2.

  Dynamic Programming Strings
• Hard

  Distinct Subsequences

  Return number of distinct subsequences of s that equal t.

  Dynamic Programming Strings
• Hard

  Regular Expression Matching

  Implement regex matching with support for '.' and '*'.

  Dynamic Programming Strings