1312. Minimum Insertion Steps to Make a String Palindrome
1312. Minimum Insertion Steps to Make a String Palindrome
Description
Given a string s. In one step you can insert any character at any index of the string.
3224. Minimum Array Changes to Make Differences Equal
3224. Minimum Array Changes to Make Differences Equal
Description
You are given an integer array nums of size n where n is even , and an integer k.
3229. Minimum Operations to Make Array Equal to Target
3229. Minimum Operations to Make Array Equal to Target
Description
You are given two positive integer arrays nums and target, of the same length.
3228. Maximum Number of Operations to Move Ones to the End
3228. Maximum Number of Operations to Move Ones to the End
Description
You are given a binary string s.
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.