Gas Station
There are some gas stations along a circular route. You are given two integer arrays gas[] denoted as the amount of gas present […]
2033. Minimum Operations to Make a Uni-Value Grid
You are given a 2D integer grid of size m x n and an integer x. In one operation, you can add x to or subtract x from any element in
Word Break
You are given a string s and a list dictionary[] of words. Your task is to determine whether the string s can be formed by concatenating
3169. Count Days Without Meetings
You are given a positive integer days representing the total number of days an employee is available for work (starting from day
Matrix Chain Multiplication
Given an array arr[] which represents the dimensions of a sequence of matrices where the ith matrix has the dimensions (arr[i-1] x arr[i]) for i>=1, find the most efficient way to
Edit Distance
Given two strings s1 and s2. Return the minimum number of operations required to convert s1 to s2.The possible operations are permitted: Insert a character at any position
3306. Count of Substrings Containing Every Vowel and K Consonants II
You are given a string word and a non-negative integer k. Return the total number of substrings of word that contain every vowel (‘a’, ‘e’, ‘i’, ‘o’, and ‘u’) at least once
1261. Find Elements in a Contaminated Binary Tree
Given a binary tree with the following rules: root.val == 0 For any treeNode: If treeNode.val has a value x and treeNode.left != null, then treeNode.left.val ==
K Closest Points to Origin
Given an array of points where each point is represented as points[i] = [xi, yi] on the X-Y plane and an integer k,
2375. Construct Smallest Number From DI String
You are given a 0-indexed string pattern of length n consisting of the characters ‘I’ meaning increasing and ‘D’ meaning decreasing. A 0-indexed string num of length n + 1 is created using the following conditions: num consists of the
Serialize and deserialize a binary tree
Serialization is to store a tree in an array so that it can be later restored and deserialization is reading
1718. Construct the Lexicographically Largest Valid Sequence
Given an integer n, find a sequence that satisfies all of the following: The integer 1 occurs once in the sequence. Each integer