583. Delete Operation for Two Strings
583. Delete Operation for Two Strings
Description
Given two strings word1 and word2, return the minimum number of steps required to make word1 and word2 the same.
1143. Longest Common Subsequence
1143. Longest Common Subsequence
Description
Given two strings text1 and text2, return the length of their longest common subsequence . If there is no common subsequence , return 0.
53. Maximum Subarray
72. Edit Distance
140. Word Break II
139. Word Break
115. Distinct Subsequences
931. Minimum Falling Path Sum
1305. All Elements in Two Binary Search Trees
1305. All Elements in Two Binary Search Trees
Description
Given two binary search trees root1 and root2, return a list containing all the integers from both trees sorted in ascending order.
173. Binary Search Tree Iterator
173. Binary Search Tree Iterator
Description
Implement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST):