3219. Minimum Cost for Cutting Cake II
3219. Minimum Cost for Cutting Cake II
Description
There is an m x n cake that needs to be cut into 1 x 1 pieces.
3217. Delete Nodes From Linked List Present in Array
3217. Delete Nodes From Linked List Present in Array
Description
You are given an array of integers nums and the head of a linked list. Return the head of the modified linked list after removing all nodes from the linked list that have a value that exists in nums.
516. Longest Palindromic Subsequence
516. Longest Palindromic Subsequence
Description
Given a string s, find the longest palindromic subsequence ‘s length in s.
712. Minimum ASCII Delete Sum for Two Strings
712. Minimum ASCII Delete Sum for Two Strings
Description
Given two strings s1 ands2, return the lowest ASCII sum of deleted characters to make two strings equal.
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.