Maximize Subarrays After Removing One Conflicting Pair You are given an integer n which represents an array nums containing the numbers from 1 to n in order. Additionally, you are given a 2D arra...

Maximum Unique Subarray Sum After Deletion You are given an integer array nums. You are allowed to delete any number of elements from nums without making it empty. After performing the deletions...

Minimum Score After Removals on a Tree There is an undirected connected tree with n nodes labeled from 0 to n - 1 and n - 1 edges. You are given a 0-indexed integer array nums of length n where ...

Maximum Score From Removing Substrings You are given a string s and two integers x and y. You can perform two types of operations any number of times. Remove substring "ab" and gain x points. ...

Delete Characters to Make Fancy String A fancy string is a string where no three consecutive characters are equal. Given a string s, delete the minimum possible number of characters from s to ma...

Remove Sub-Folders from the Filesystem Given a list of folders folder, return the folders after removing all sub-folders in those folders. You may return the answer in any order. If a folder[i] ...

Find the Maximum Length of Valid Subsequence II You are given an integer array nums and a positive integer k. A subsequence sub of nums with length x is called valid if it satisfies: (sub[0] + su...

Find the Maximum Length of Valid Subsequence I You are given an integer array nums. A subsequence sub of nums with length x is called valid if it satisfies: (sub[0] + sub[1]) % 2 == (sub[1] + sub...

Valid Word A word is considered valid if: It contains a **minimum** of 3 characters. It contains only digits (0-9), and English letters (uppercase and lowercase). It includes **at least** one **...

Convert Binary Number in a Linked List to Integer Given head which is a reference node to a singly-linked list. The value of each node in the linked list is either 0 or 1. The linked list holds t...