Edit Distance Given two strings, word1, and word2, return the minimum number of operations required to convert word1 to word2. … Read More
Target Sum You are given an integer array nums and an integer target. You want to build an expression out of nums by adding one of the symbols … Read More
Unique Paths A robot is located at the top-left corner of a m*n grid(marked 'Start' in the diagram below). The robot can only move eith… Read More
Maximum Product Subarray Given an integer array nums, find the contiguous subarray within an array(containing at least one number) which has the l… Read More
Problem: Partition Equal Subset Sum Given a non-empty array nums containing only positive integers, find if the array can be partitioned into two … Read More
Word Break: Problem Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-seperated sequence of… Read More
Edit Distance Given two strings, word1, and word2, return the minimum number of operations required to convert word1 to word2. … Read More
Target Sum You are given an integer array nums and an integer target. You want to build an expression out of nums by adding one of the symbols … Read More
Unique Paths A robot is located at the top-left corner of a m*n grid(marked 'Start' in the diagram below). The robot can only move eith… Read More
Maximum Product Subarray Given an integer array nums, find the contiguous subarray within an array(containing at least one number) which has the l… Read More
Problem: Partition Equal Subset Sum Given a non-empty array nums containing only positive integers, find if the array can be partitioned into two … Read More
Word Break: Problem Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-seperated sequence of… Read More