Questions

Suppose you have n integers labeled 1 through n.

There are two types of persons: You are given a 0-indexed 2D integer array statements of size n x n that represents the statements made by n people about each other.

You are given an m x n integer matrix matrix with the following two properties: Given an integer target, return true if target is in matrix or false otherwise.

Given an array of integers arr and an integer k.

You are given an m x n binary matrix matrix.

You are given a binary string s of length n, where: You can perform at most one trade to maximize the number of active sections in s.

Alice and Bob continue their games with piles of stones.

A web developer needs to know how to design a web page's size.

You are given a 0-indexed integer array nums.

Given an integer array nums, return the number of subarrays of length 3 such that the sum of the first and third numbers equals exactly half of the second number.

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

You are given a 0-indexed integer array nums of size n, and a 0-indexed integer array pattern of size m consisting of integers -1, 0, and 1.

There are n computers numbered from 0 to n - 1 connected by ethernet cables connections forming a network where connections[i] = [ai, bi] represents a connection between computers...

Given an integer array nums of size n, return the number with the value closest to 0 in nums.

Given the string s, return the size of the longest substring containing each vowel an even number of times.

You are given a 0-indexed 2D integer array nums.

Given a 2D character matrix grid, where grid[i][j] is either 'X', 'Y', or '.', return the number of submatrices that contain:

Given an array of integers arr.

Given a non-empty array of integers nums, every element appears twice except for one.

You are given two positive integers n and k.

The chess knight has a unique movement, it may move two squares vertically and one square horizontally, or two squares horizontally and one square vertically (with both forming...

You are given a network of n nodes represented as an n x n adjacency matrix graph, where the ith node is directly connected to the jth node if graph[i][j] == 1.

There is a broken calculator that has the integer startValue on its display initially.

You are given an integer num.

There is a circle of red and blue tiles.

You are given a 0-indexed integer array tasks, where tasks[i] represents the difficulty level of a task.

Given a 0-indexed string s, permute s to get a new string t such that: Return the resulting string.

You are given an array of strings words.

Given an object or array obj, return a compact object.

We define the usage of capitals in a word to be right when one of the following cases holds: Given a string word, return true if the usage of capitals in it is right.

You are given two integers, n and k.

The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1.

You are given an integer array target and an integer n.

Given an input string s, reverse the order of the words.

You are given a string s and a positive integer k.

You are given a 2D integer array items where items[i] = [pricei, beautyi] denotes the price and beauty of an item respectively.

You are given a 0-indexed string expression of the form "<num1>+<num2>" where <num1> and <num2> represent positive integers.

You are given a 2D boolean matrix grid.

Given a positive integer num represented as a string, return the integer num without trailing zeros as a string.

You are given an integer n.

You are given an array nums that consists of positive integers.

You are given two strings s1 and s2 of equal length.

You are given an array of positive integers nums of length n.

Given a string s, return the length of the longest substring between two equal characters, excluding the two characters.

You are given an integer array nums.

Given an object or an array, return if it is empty.

You are given two arrays of strings that represent two inclusive events that happened on the same day, event1 and event2, where: Event times are valid 24 hours format in the form...

You are given a 2D matrix grid of size n x n.

Given 3 positives numbers a, b and c.

You are given a straight road of length l km, an integer n, an integer k, and two integer arrays, position and time, each of length n.

Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.

Alice and Bob want to water n plants in their garden.

There are n bulbs that are initially off.

Given an integer n, return true if it is possible to represent n as the sum of distinct powers of three.

You are given two integer arrays nums1 and nums2 of sizes n and m, respectively.

You are given an array of strings names, and an array heights that consists of distinct positive integers.

There is a special typewriter with lowercase English letters 'a' to 'z' arranged in a circle with a pointer.

A school is trying to take an annual photo of all the students.

You are stacking blocks to form a pyramid.

You are given a string title consisting of one or more words separated by a single space, where each word consists of English letters.

Given an integer array arr, and an integer target, return the number of tuples i, j, k such that i < j < k and arr[i] + arr[j] + arr[k] == target.

Given a positive integer n, there exists a 0-indexed array called powers, composed of the minimum number of powers of 2 that sum to n.

You are given a 2D matrix grid consisting of positive integers.

You are given an m x n grid.

Given two n x n binary matrices mat and target, return true if it is possible to make mat equal to target by rotating mat in 90-degree increments, or false otherwise.

You are given an integer money denoting the amount of money (in dollars) that you have and another integer children denoting the number of children that you must distribute the...

You are given an m x n binary matrix grid, where 0 represents a sea cell and 1 represents a land cell.

Given a binary string s, return the number of substrings with all characters 1's.

You are given an m x n binary grid grid where 1 represents land and 0 represents water.

You are given a positive integer n representing n cities numbered from 1 to n.

Given an array intervals where intervals[i] = [li, ri] represent the interval [li, ri), remove all intervals that are covered by another interval in the list.

Given a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.

There is a directed graph of n nodes with each node labeled from 0 to n - 1.

You are given a string s.

There are n soldiers standing in a line.

There are several cards arranged in a row, and each card has an associated number of points.

In the video game Fallout 4, the quest "Road to Freedom" requires players to reach a metal dial called the "Freedom Trail Ring" and use the dial to spell a specific keyword to...

You are given an integer array nums and an integer k.

There is a tree (i.e.

You are given two strings s and pattern.

You are given an integer array nums and two integers, k and limit.

You are given a binary array possible of length n.

You are given three positive integers n, x, and y.

You are given a 1-indexed integer array numWays, where numWays[i] represents the number of ways to select a total amount i using an infinite supply of some fixed coin denominations.

You are given a list of strings of the same length words and a string target.

Given a binary string s and a positive integer n, return true if the binary representation of all the integers in the range [1, n] are substrings of s, or false otherwise.

Given an array of strings nums containing n unique binary strings each of length n, return a binary string of length n that does not appear in nums.

You are given a 0-indexed m x n binary matrix land where a 0 represents a hectare of forested land and a 1 represents a hectare of farmland.

Given the following details of a matrix with n columns and 2 rows : Your task is to reconstruct the matrix with upper, lower and colsum.

You are given a string s that contains some bracket pairs, with each pair containing a non-empty key.

You are given an integer array nums.

A perfect number is a positive integer that is equal to the sum of its positive divisors, excluding the number itself.

Given a string word, return the sum of the number of vowels ('a', 'e', 'i', 'o', and 'u') in every substring of word.

You are given a 0-indexed array nums of distinct integers.

The k-beauty of an integer num is defined as the number of substrings of num when it is read as a string that meet the following conditions: Given integers num and k, return the...

You start at the cell (rStart, cStart) of an rows x cols grid facing east.

You are given an m x n integer matrix grid.

You are given the array nums consisting of n positive integers.

You are given a string s and a character c.

You are given two integer arrays nums1 and nums2.

You are given a 0-indexed integer array nums of even length consisting of an equal number of positive and negative integers.

You are given an n x n integer matrix.

You are given a 0-indexed integer array nums containing distinct numbers, an integer start, and an integer goal.

You are given an array of integers nums.

Given a string s that contains parentheses and letters, remove the minimum number of invalid parentheses to make the input string valid.

You are given two 0-indexed arrays of strings startWords and targetWords.

You are given an integer array nums and an integer k.

You are given a positive integer n.

Given the array favoriteCompanies where favoriteCompanies[i] is the list of favorites companies for the ith person (indexed from 0).

You're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have.

There is a donuts shop that bakes donuts in batches of batchSize.

You are given a string s of lowercase English letters and a 2D integer array shifts where shifts[i] = [starti, endi, directioni].

Given an integer array hours representing times in hours, return an integer denoting the number of pairs i, j where i < j and hours[i] + hours[j] forms a complete day.

Given two strings s and goal, return true if and only if s can become goal after some number of shifts on s.

For an integer array nums, an inverse pair is a pair of integers [i, j] where 0 <= i < j < nums.length and nums[i] > nums[j].

You are given a string s consisting of digits.

There are n dominoes in a line, and we place each domino vertically upright.

You are given two positive integer arrays spells and potions, of length n and m respectively, where spells[i] represents the strength of the ith spell and potions[j] represents...

Given two version strings, version1 and version2, compare them.

Given an integer array nums, return the number of all the arithmetic subsequences of nums.

You are given an integer array nums.

Given an array of integers arr, you are initially positioned at the first index of the array.

You are given the string croakOfFrogs, which represents a combination of the string "croak" from different frogs, that is, multiple frogs can croak at the same time, so multiple...

You are given a 0-indexed array nums of size n consisting of positive integers.

You are given an array of strings nums and an integer k.

You are given a binary string s of length n, where: You can perform at most one trade to maximize the number of active sections in s.

Practice using a dynamic list (ArrayList/List) to collect, dedupe, and sort values.

Given an integer n, return a counter function.

In a row of dominoes, tops[i] and bottoms[i] represent the top and bottom halves of the ith domino.

You are given an m x n matrix M initialized with all 0's and an array of operations ops, where ops[i] = [ai, bi] means M[x][y] should be incremented by one for all 0 <= x < ai and...

You are given an integer n that consists of exactly 3 digits.

You are given two 0-indexed arrays nums1 and nums2 and a 2D array queries of queries.

It is a sweltering summer day, and a boy wants to buy some ice cream bars.

On day 1, one person discovers a secret.

Given a string s of length n and an integer k, determine whether it is possible to select k disjoint special substrings.

There are buckets buckets of liquid, where exactly one of the buckets is poisonous.

Given two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

You are given two arrays, instructions and values, both of size n.

You are given a sorted array nums of n non-negative integers and an integer maximumBit.

Given an integer n, find a sequence with elements in the range [1, n] that satisfies all of the following: The distance between two numbers on the sequence, a[i] and a[j], is the...

You are given an array prices where prices[i] is the price of a given stock on the ith day.

You are given two strings, word1 and word2.

In the universe Earth C-137, Rick discovered a special form of magnetic force between two balls if they are put in his new invented basket.

You are given a string s of lowercase English letters and an integer array shifts of the same length.

Given a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters.

Given an array nums of positive integers, return the longest possible length of an array prefix of nums, such that it is possible to remove exactly one element from this prefix so...

Given an integer n, return the decimal value of the binary string formed by concatenating the binary representations of 1 to n in order, modulo 10^9 + 7.

You are given an integer n and a 2D integer array queries.

You are given a string s of length n, and an integer k.

Given an binary array nums and an integer k, return true if all 1's are at least k places away from each other, otherwise return false.

Alice is attempting to type a specific string on her computer.

You are given an array start where start = [startX, startY] represents your initial position (startX, startY) in a 2D space.

You are given a 0-indexed array nums of length n containing distinct positive integers.

You are given an integer array nums and two integers l and r.

You have n tasks and m workers.

Given a string s and a dictionary of strings wordDict, add spaces in s to construct a sentence where each word is a valid dictionary word.

A sentence is a list of words that are separated by a single space with no leading or trailing spaces.

Given two integers n and k, return the kth lexicographically smallest integer in the range [1, n].

According to Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970." The board...

You have planned some train traveling one year in advance.

The power of an integer x is defined as the number of steps needed to transform x into 1 using the following steps: For example, the power of x = 3 is 7 because 3 needs 7 steps to...

There are n people and 40 types of hats labeled from 1 to 40.

Given an array of points on the X-Y plane points where points[i] = [xi, yi], return the area of the largest triangle that can be formed by any three different points.

You are given a string s.

You are given an integer array nums, an integer k, and an integer multiplier.

There is an infinite 2D plane.

You are given two integer arrays arr and brr of length n, and an integer k.

You are given a string s consisting only of characters 'a' and 'b'​​​​.

You are given an array points where points[i] = [xi, yi] represents the coordinates of a point on an infinite plane.

You are given two strings s and t.

You are given two 0-indexed integer arrays, cost and time, of size n representing the costs and the time taken to paint n different walls respectively.

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path.

You are given an integer n.

You are given two integers num1 and num2.

You are given two jugs with capacities x liters and y liters.

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window.

You are playing the following Nim Game with your friend: Given n, the number of stones in the heap, return true if you can win the game assuming both you and your friend play...

You are given two positive integers startPos and endPos.

Given a string s, return the number of palindromic substrings in it.

A company is organizing a meeting and has a list of n employees, waiting to be invited.

You are given an integer array nums of 2 * n integers.

You are given a 1-indexed array of integers nums of length n.

The XOR total of an array is defined as the bitwise XOR of all its elements, or 0 if the array is empty.

A city is represented as a bi-directional connected graph with n vertices where each vertex is labeled from 1 to n (inclusive).

You have an array of floating point numbers averages which is initially empty.

You are given two integers m and n representing a 0-indexed m x n grid.

You have a certain number of processors, each having 4 cores.

Given a 0-indexed 2D integer matrix grid of size n * m, we define a 0-indexed 2D matrix p of size n * m as the product matrix of grid if the following condition is met: Return the...

You are given a large sample of integers in the range [0, 255].

You are given a string s.

There is a binary tree rooted at 0 consisting of n nodes.

We are given hours, a list of the number of hours worked per day for a given employee.

Given an integer array nums that may contain duplicates, return all possible subsets (the power set).

Given an integer array arr and an integer difference, return the length of the longest subsequence in arr which is an arithmetic sequence such that the difference between adjacent...

There exists an undirected and unrooted tree with n nodes indexed from 0 to n - 1.

You are given an integer array nums and an integer k.

You are given a 0-indexed array of integers nums, and an integer target.

You are given an integer n, the number of teams in a tournament that has strange rules: Return the number of matches played in the tournament until a winner is decided.

Given an array arr of positive integers, consider all binary trees such that: Among all possible binary trees considered, return the smallest possible sum of the values of each...

You are given an integer array nums and a non-negative integer k.

Given the array houses where houses[i] is the location of the ith house along a street and an integer k, allocate k mailboxes in the street.

A sentence is a list of words that are separated by a single space with no leading or trailing spaces.

You are given an array heights of n integers representing the number of bricks in n consecutive towers.

Given an array nums of n integers, your task is to find the maximum value of k for which there exist two adjacent subarrays of length k each, such that both subarrays are strictly...

You are given an integer n.

You are given an integer n denoting the number of cities in a country.

Given a 2D integer array circles where circles[i] = [xi, yi, ri] represents the center (xi, yi) and radius ri of the ith circle drawn on a grid, return the number of lattice...

You are given a 0-indexed integer array nums and an integer pivot.

There are n workers.

There is a party where n friends numbered from 0 to n - 1 are attending.

There is an undirected tree with n nodes labeled from 1 to n, rooted at node 1.

You are given a 0-indexed 2D integer matrix grid of size n * n with values in the range [1, n2].

You are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of limit.

You are given an array of binary strings strs and two integers m and n.

Given an integer n, return the number of strings of length n that consist only of vowels (a, e, i, o, u) and are lexicographically sorted.

A word is considered valid if: You are given a string word.

One way to serialize a binary tree is to use preorder traversal.

There are some red and blue tiles arranged circularly.

Given an array arr, replace every element in that array with the greatest element among the elements to its right, and replace the last element with -1.

You are standing at position 0 on an infinite number line.

You are given two integer arrays of the same length nums1 and nums2.

You are given a string s, a string chars of distinct characters and an integer array vals of the same length as chars.

The complement of an integer is the integer you get when you flip all the 0's to 1's and all the 1's to 0's in its binary representation.

A transaction is possibly invalid if: You are given an array of strings transaction where transactions[i] consists of comma-separated values representing the name, time (in...

You are given an integer array nums of length n where nums is a permutation of the numbers in the range [0, n - 1].

In a warehouse, there is a row of barcodes, where the ith barcode is barcodes[i].

You are given a string s consisting only of uppercase English letters.

You are given a string caption of length n.

Given n orders, each order consists of a pickup and a delivery service.

Given a wordlist, we want to implement a spellchecker that converts a query word into a correct word.

Given a binary array nums, return the maximum length of a contiguous subarray with an equal number of 0 and 1.

You are given a string s consisting of the characters 'N', 'S', 'E', and 'W', where s[i] indicates movements in an infinite grid: Initially, you are at the origin (0, 0).

You are given two 0-indexed integer arrays nums1 and nums2 of equal length n and a positive integer k.

You are given an array nums consisting of integers.

There is a car with capacity empty seats.

You are given two positive integers xCorner and yCorner, and a 2D array circles, where circles[i] = [xi, yi, ri] denotes a circle with center at (xi, yi) and radius ri.

Given an array nums, return true if the array was originally sorted in non-decreasing order, then rotated some number of positions (including zero).

Add preorder, inorder, and postorder traversal methods to BinTree and see how each visits the same sample tree in a different order.

You are given a string word.

You are given a 0-indexed array of strings words and a 2D array of integers queries.

Given an integer array arr and a target value target, return the integer value such that when we change all the integers larger than value in the given array to be equal to value,...

Given an m x n board of characters and a list of strings words, return all words on the board.

You are given an integer array nums of length n, and an integer array queries of length m.

You are given an integer array nums.

Given a string text, you want to use the characters of text to form as many instances of the word "balloon" as possible.

You are given an array of n strings strs, all of the same length.

You are given the strings key and message, which represent a cipher key and a secret message, respectively.

There are n projects numbered from 0 to n - 1.

You are given a m x n 2D array board representing a chessboard, where board[i][j] represents the value of the cell (i, j).

You are given an integer n, representing n nodes numbered from 0 to n - 1 and a list of edges, where edges[i] = [ui, vi, si, musti]: You are also given an integer k, the maximum...

There is an undirected star graph consisting of n nodes labeled from 1 to n.

You are given an integer array nums.

You are given two arrays nums and andValues of length n and m respectively.

You are given a 0-indexed array mountain.

Given a single positive integer x, we will write an expression of the form x (op1) x (op2) x (op3) x ...

You are given an array of strings products and a string searchWord.

On a 2D plane, we place n stones at some integer coordinate points.

You are given an integer side, representing the edge length of a square with corners at (0, 0), (0, side), (side, 0), and (side, side) on a Cartesian plane.

There is an undirected graph consisting of n nodes numbered from 1 to n.

You have a pointer at index 0 in an array of size arrLen.

Given two positive integers a and b, return the number of common factors of a and b.

You are given a 0-indexed integer array nums of length n.

You are given an integer array nums and an integer k.

Run-length encoding is a string compression method that works by replacing consecutive identical characters (repeated 2 or more times) with the concatenation of the character and...

You are given a binary array nums (0-indexed).

An array is considered special if every pair of its adjacent elements contains two numbers with different parity.

You are given an m x n binary matrix grid.

On an alphabet board, we start at position (0, 0), corresponding to character board[0][0].

You are given four integers, m, n, introvertsCount, and extrovertsCount.

You are given a 0-indexed integer array nums.

Given an integer n, return the number of structurally unique BST's (binary search trees) which has exactly n nodes of unique values from 1 to n.

Given a directed acyclic graph, with n vertices numbered from 0 to n-1, and an array edges where edges[i] = [fromi, toi] represents a directed edge from node fromi to node toi.

You are given a 0-indexed integer array mapping which represents the mapping rule of a shuffled decimal system.

You are given a string word and a non-negative integer k.

You are given a string allowed consisting of distinct characters and an array of strings words.

Given a string s, return the string after replacing every uppercase letter with the same lowercase letter.

You are given a string target.

Given a signed 32-bit integer x, return x with its digits reversed.

You are given two 0-indexed arrays nums and cost consisting each of n positive integers.

Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal.

Given an array nums and an integer target, return the maximum number of non-empty non-overlapping subarrays such that the sum of values in each subarray is equal to target.

You are given a 0-indexed integer array nums.

There is an m x n grid with a ball.

There are n piles of coins on a table.

You are given a collection of numbered balls and instructed to sort them into boxes for a nearly balanced distribution.

Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn].

Write a function that reverses a string.

You are given two strings stamp and target.

Given an integer n, return the count of all numbers with unique digits, x, where 0 <= x < 10n.

There is an undirected graph with n nodes, where each node is numbered between 0 and n - 1.

You are given an integer array nums and an integer k.

Given two binary strings a and b, return their sum as a binary string.

There are n teams numbered from 0 to n - 1 in a tournament; each team is also a node in a DAG.

You are given two 0-indexed integer arrays nums1 and nums2, of equal length n.

Under the grammar given below, strings can represent a set of lowercase words.

You are given two positive integers n and k.

There is a country of n cities numbered from 0 to n - 1.

Find the length, in edges, of the longest path between any two nodes in a binary tree.

You are given an integer array nums, and you can perform the following operation any number of times on nums: Return true if it is possible to sort nums in non-decreasing order...

You are given a 2D integer array edges representing an undirected graph having n nodes, where edges[i] = [ui, vi] denotes an edge between nodes ui and vi.

In an alien language, surprisingly, they also use English lowercase letters, but possibly in a different order.

Given an integer array nums, return all the different possible non-decreasing subsequences of the given array with at least two elements.

You are given an integer array nums containing positive integers.

You are given an integer array nums.

There is a special square room with mirrors on each of the four walls.

The power of the string is the maximum length of a non-empty substring that contains only one unique character.

A boolean expression is an expression that evaluates to either true or false.

You are given a 2D 0-indexed array of strings, access_times, with size n.

You are given a binary string binary consisting of only 0's or 1's.

You have a keyboard layout as shown above in the X-Y plane, where each English uppercase letter is located at some coordinate.

You are given a 0-indexed array of integers nums.

You are given an array points of size n and an integer m.

Given an array of integers nums, half of the integers in nums are odd, and the other half are even.

You are given an array nums consisting of positive integers.

You are given an n x n grid where we place some 1 x 1 x 1 cubes that are axis-aligned with the x, y, and z axes.

You are given an array target that consists of distinct integers and another integer array arr that can have duplicates.

You are given a 0-indexed array nums consisting of positive integers.

We distribute some number of candies, to a row of n = num_people people in the following way: We then give 1 candy to the first person, 2 candies to the second person, and so on...

There are n people standing in a line labeled from 1 to n.

You are given two non-increasing 0-indexed integer arrays nums1​​​​​​ and nums2​​​​​​.

You are given an array nums consisting of non-negative integers.

You are given an integer mountain array arr of length n where the values increase to a peak element and then decrease.

You are given two integers n and k.

Given an array nums sorted in non-decreasing order, return the maximum between the number of positive integers and the number of negative integers.

You are given a string s consisting of the characters 'a', 'b', and 'c' and a non-negative integer k.

You are given a digit string s that consists of digits from 0 to 9.

Alice has n candies, where the ith candy is of type candyType[i].

Given a parentheses string s containing only the characters '(' and ')'.

A self-dividing number is a number that is divisible by every digit it contains.

You are given an array pairs, where pairs[i] = [xi, yi], and: Let ways be the number of rooted trees that satisfy the following conditions: Two ways are considered to be different...

Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white, and blue.

The complement of an integer is the integer you get when you flip all the 0's to 1's and all the 1's to 0's in its binary representation.

There are several consecutive houses along a street, each of which has some money inside.

You are given an array of strings words and a string target.

You are given a positive integer num consisting only of digits 6 and 9.

You are given two positive integers n and k.

You are given an integer array nums of length n.

Given a string s, partition the string into one or more substrings such that the characters in each substring are unique.

You are given a string s and a positive integer k.

There is an infrastructure of n cities with some number of roads connecting these cities.

Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix.

You are given a 0-indexed string blocks of length n, where blocks[i] is either 'W' or 'B', representing the color of the ith block.

You are given a string word and an integer k.

You have a cubic storeroom where the width, length, and height of the room are all equal to n units.

Given an integer num, return a string of its base 7 representation.

A positive integer is magical if it is divisible by either a or b.

You are given a string num which represents a positive integer, and an integer t.

You are given an array nums of length n and a positive integer k.

You are given an n x n grid where you have placed some 1 x 1 x 1 cubes.

A matrix diagonal is a diagonal line of cells starting from some cell in either the topmost row or leftmost column and going in the bottom-right direction until reaching the...

There is an undirected tree with n nodes labeled from 1 to n.

You are given two 0-indexed integer arrays nums1 and nums2 of even length n.

You are given an m x n integer matrix grid​​​.

You are given an array of integers nums.

You are given an array of positive integers nums.

There is a special kind of apple tree that grows apples every day for n days.

You are given a string date representing a Gregorian calendar date in the yyyy-mm-dd format.

Given an array of digits digits, return the largest multiple of three that can be formed by concatenating some of the given digits in any order.

You are given an integer array nums, an integer array queries, and an integer x.

Given an array of integers arr and two integers k and threshold, return the number of sub-arrays of size k and average greater than or equal to threshold.

A decimal number is called deci-binary if each of its digits is either 0 or 1 without any leading zeros.

You are given a 2D matrix grid of size m x n.

Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words.

You are given a 0-indexed integer array nums.

You are given two strings word1 and word2.

You are given an array of strings arr.

An alphabetical continuous string is a string consisting of consecutive letters in the alphabet.

Alice and Bob are playing a fantasy battle game consisting of n rounds where they summon one of three magical creatures each round: a Fire Dragon, a Water Serpent, or an Earth...

You are given an array maximumHeight, where maximumHeight[i] denotes the maximum height the ith tower can be assigned.

You are given an undirected tree rooted at node 0 with n nodes numbered from 0 to n - 1, represented by a 2D array edges of length n - 1, where edges[i] = [ui, vi, lengthi]...

You are given a tree rooted at node 0 that consists of n nodes numbered from 0 to n - 1.

There are n people standing in a queue, and they numbered from 0 to n - 1 in left to right order.

Given a 0-indexed integer array nums, return true if it can be made strictly increasing after removing exactly one element, or false otherwise.

You are given an integer array nums.

You are given an undirected tree rooted at node 0, with n nodes numbered from 0 to n - 1.

A fancy string is a string where no three consecutive characters are equal.

You are given an integer array nums and two integers k and numOperations.

Given a triangle array, return the minimum path sum from top to bottom.

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1.

Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that: You may return the answer in any order.

Given an integer array nums and an integer k, return the number of non-empty subarrays that have a sum divisible by k.

Given a date, return the corresponding day of the week for that date.

There is a network of n servers, labeled from 0 to n - 1.

You are given a string s of length n and an integer array order, where order is a permutation of the numbers in the range [0, n - 1].

Given two positive integers n and x.

You are given an undirected graph (the "original graph") with n nodes labeled from 0 to n - 1.

You are given an integer array nums.

You are given a 2D integer array tiles where tiles[i] = [li, ri] represents that every tile j in the range li <= j <= ri is colored white.

You are given an integer n and an undirected, weighted tree rooted at node 0 with n nodes numbered from 0 to n - 1.

You are given a string array words, and an array groups, both arrays having length n.

You are given a 2D array of integers coordinates of length n and an integer k, where 0 <= k < n.

An integer divisible by the sum of its digits is said to be a Harshad number.

A split of an integer array is good if: Given nums, an array of non-negative integers, return the number of good ways to split nums.

Given an m x n matrix matrix and an integer k, return the max sum of a rectangle in the matrix such that its sum is no larger than k.

You are given an array of points in the X-Y plane points where points[i] = [xi, yi].

Given a string s, return the number of distinct non-empty subsequences of s.

You are given an integer n, the number of nodes in a directed graph where the nodes are labeled from 0 to n - 1.

You are given an integer array nums.

Given a circular integer array nums of length n, return the maximum possible sum of a non-empty subarray of nums.

There is an undirected tree with n nodes labeled from 0 to n - 1, and rooted at node 0.

You are given an integer n, which indicates that there are n courses labeled from 1 to n.

You are given two strings s and sub.

You are given a binary string s.

You are given a 0-indexed array nums that consists of n distinct positive integers.

There is a strange printer with the following two special properties: Given a string s, return the minimum number of turns the printer needed to print it.

You are given an integer array nums.

You are given a 2D integer array squares.

You are given a 0-indexed integer array nums representing the score of students in an exam.

There are several squares being dropped onto the X-axis of a 2D plane.

You are given an integer array nums and an array queries where queries[i] = [vali, indexi].

You are given a 0-indexed string s, a string a, a string b, and an integer k.

Write a program to solve a Sudoku puzzle by filling the empty cells.

A string is called a happy prefix if is a non-empty prefix which is also a suffix (excluding itself).

A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance.

You are given an integer n denoting the total number of servers and a 2D 0-indexed integer array logs, where logs[i] = [server_id, time] denotes that the server with id server_id...

There is an m x n grid, where (0, 0) is the top-left cell and (m - 1, n - 1) is the bottom-right cell.

You are given a string s.

You are given two strings, s and t.

There are n balls on a table, each ball has a color black or white.

You are given an array nums consisting of positive integers.

You are given an m x n binary matrix grid and an integer health.

You are given a non-negative integer k.

A shop is selling candies at a discount.

You are given a 2D string array responses where each responses[i] is an array of strings representing survey responses from the ith day.

Given an integer array arr, remove a subarray (can be empty) from arr such that the remaining elements in arr are non-decreasing.

You are given a binary string s consisting only of zeroes and ones.

You are given an integer finalSum.

There are n cars at given miles away from the starting mile 0, traveling to reach the mile target.

There is an undirected tree with n nodes labeled from 0 to n - 1, rooted at node 0.

Given an array of integers arr and an integer k.

You are given a 0-indexed integer array coins, representing the values of the coins available, and an integer target.

You are given an undirected graph defined by an integer n, the number of nodes, and a 2D integer array edges, the edges in the graph, where edges[i] = [ui, vi] indicates that...

You are given a 2D integer array grid with size m x n.

A sentence is a list of words that are separated by a single space with no leading or trailing spaces.

You are given an m x n integer matrix grid, where you can move from a cell to any adjacent cell in all 4 directions.

Given a string s and an array of strings words, determine whether s is a prefix string of words.

Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.

Given 2n balls of k distinct colors.

An axis-aligned rectangle is represented as a list [x1, y1, x2, y2], where (x1, y1) is the coordinate of its bottom-left corner, and (x2, y2) is the coordinate of its top-right...

You are given an integer array nums and an integer k.

There is an m x n cake that needs to be cut into 1 x 1 pieces.

Given a positive integer n, find the smallest integer which has exactly the same digits existing in the integer n and is greater in value than n.

There is an undirected tree with n nodes labeled from 0 to n - 1.

You are given an integer array nums and an integer x.

You are given a binary string s representing a number n in its binary form.

You are given an integer eventTime denoting the duration of an event.

Given a fixed-length integer array arr, duplicate each occurrence of zero, shifting the remaining elements to the right.

You are given a 0-indexed n x n grid where n is odd, and grid[r][c] is 0, 1, or 2.

You are given a 0-indexed string s of even length n.

You are given a 0-indexed integer array nums.

You are given an array of positive integers arr.

You are given a 0-indexed integer array nums.

In a garden represented as an infinite 2D grid, there is an apple tree planted at every integer coordinate.

You are given an integer n and an undirected tree rooted at node 0 with n nodes numbered from 0 to n - 1.

You are given a 0-indexed integer array nums.

You are given a binary string s.

You are given a 0-indexed integer array nums.

Given a string s, return the number of unique palindromes of length three that are a subsequence of s.

Alice and Bob are playing a turn-based game on a circular field surrounded by flowers.

There is a robot on an m x n grid.

You have n boxes.

You are given a string s of even length consisting of digits from 0 to 9, and two integers a and b.

Given two integers left and right that represent the range [left, right], return the bitwise AND of all numbers in this range, inclusive.

You are given a tree (i.e.

You are given two strings, word1 and word2, of equal length.

A string originalText is encoded using a slanted transposition cipher to a string encodedText with the help of a matrix having a fixed number of rows rows.

Given two non-negative integers, num1 and num2 represented as string, return the sum of num1 and num2 as a string.

You are given an array of strings words.

You are given row x col grid representing a map where grid[i][j] = 1 represents land and grid[i][j] = 0 represents water.

Given an array of integers nums, sort the array in increasing order based on the frequency of the values.

You are given a 0-indexed array of positive integers nums and a positive integer limit.

You are given a 2D integer array logs where each logs[i] = [birthi, deathi] indicates the birth and death years of the ith person.

You are given a 0-indexed integer array nums and a positive integer k.

There are n rings and each ring is either red, green, or blue.

A string s can be partitioned into groups of size k using the following procedure: Note that the partition is done so that after removing the fill character from the last group...

You are given a string s, which is known to be a concatenation of anagrams of some string t.

You are given an array of events where events[i] = [startDayi, endDayi].

There is a hidden integer array arr that consists of n non-negative integers.

Given an array nums of integers, return the length of the longest arithmetic subsequence in nums.

Given an array of integers nums and a positive integer k, check whether it is possible to divide this array into sets of k consecutive numbers.

You are given a 0-indexed integer array nums of size n, and a 0-indexed integer array pattern of size m consisting of integers -1, 0, and 1.

n passengers board an airplane with exactly n seats.

Alice manages a company and has rented some floors of a building as office space.

You are currently designing a dynamic array.

You are given a 0-indexed integer array nums, and an integer k.

Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*' where: The matching should cover the entire input string (not partial).

Given an n x n binary grid, in one step you can choose two adjacent rows of the grid and swap them.

You are given a 0-indexed array nums consisting of positive integers, representing targets on a number line.

There are n flights that are labeled from 1 to n.

You are given a 0-indexed array nums of non-negative integers, and two integers l and r.

You are given a 2D integer grid of size m x n and an integer x.

You are given a list of preferences for n friends, where n is always even.

Given a positive integer num, split it into two non-negative integers num1 and num2 such that: Return the minimum possible sum of num1 and num2.

Given two strings s and part, perform the following operation on s until all occurrences of the substring part are removed: Return s after removing all occurrences of part.

You are given an integer array nums.

A car travels from a starting position to a destination which is target miles east of the starting position.

You are given two arrays with positive integers arr1 and arr2.

You have a list arr of all integers in the range [1, n] sorted in a strictly increasing order.

You are given a string s consisting of lowercase English letters, and an integer k.

Given an integer n, return the number of positive integers in the range [1, n] that have at least one repeated digit.

You are given two 0-indexed arrays nums1 and nums2 of length n, both of which are permutations of [0, 1, ..., n - 1].

You are given two 2D integer arrays nums1 and nums2.

You are given a string s consisting of only lowercase English letters.

Given a string s, calculate its reverse degree.

Given a function fn, return a memoized version of that function.

You are given an undirected tree with n nodes labeled from 0 to n - 1, and rooted at node 0.

You are given m arrays, where each array is sorted in ascending order.

You are given a series of video clips from a sporting event that lasted time seconds.

You are given two strings s and p where p is a subsequence of s.

You have n super washing machines on a line.

You are given two integer arrays nums and divisors.

Given a string s consisting of only the characters 'a' and 'b', return true if every 'a' appears before every 'b' in the string.

You are given a string s and an integer k.

You are given an array of integers nums of size n and a positive integer threshold.

You are given three arrays of length n that describe the properties of n coupons: code, businessLine, and isActive.

There is a biker going on a road trip.

You are given an integer array nums of length n.

Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements.

You are given positive integers low, high, and k.

Given a positive integer num, return the number of positive integers less than or equal to num whose digit sums are even.

You are given an integer array nums.

Given an integer array nums, in which exactly two elements appear only once and all the other elements appear exactly twice.

The frequency of an element is the number of times it occurs in an array.

You are given a string s and a robot that currently holds an empty string t.

You are given an integer array cookies, where cookies[i] denotes the number of cookies in the ith bag.

You are given two strings s and t consisting of only lowercase English letters.

Given a string s, find any substring of length 2 which is also present in the reverse of s.

You are visiting a farm that has a single row of fruit trees arranged from left to right.

You are given two strings, s and t.

You are given a string s (0-indexed)​​​​​​.

A valid cut in a circle can be: Some valid and invalid cuts are shown in the figures below.

A password is said to be strong if it satisfies all the following criteria: Given a string password, return true if it is a strong password.

You are given an array of CPU tasks, each labeled with a letter from A to Z, and a number n.

You are given a valid boolean expression as a string expression consisting of the characters '1','0','&' (bitwise AND operator),'|' (bitwise OR operator),'(', and ')'.

You are given a string text.

There are n rooms you need to visit, labeled from 0 to n - 1.

Alice and Bob play a game with piles of stones.

There is an m x n matrix that is initialized to all 0's.

There is a group of n people labeled from 0 to n - 1 where each person has a different amount of money and a different level of quietness.

Given a string of digits s, return the number of palindromic subsequences of s having length 5.

You are given two 0-indexed binary strings s1 and s2, both of length n, and a positive integer x.

You are given a 0-indexed integer array nums of length n and an integer k.

You are given an integer array nums of size n where n is a multiple of 3 and a positive integer k.

The bitwise AND of an array nums is the bitwise AND of all integers in nums.

You are given an array of integers nums.

Given the coordinates of two rectilinear rectangles in a 2D plane, return the total area covered by the two rectangles.

You are given a 0-indexed integer array players, where players[i] represents the ability of the ith player.

We have two special characters: Given a binary array bits that ends with 0, return true if the last character must be a one-bit character.

You are given a positive integer p.

Given an integer array nums, return the number of subarrays filled with 0.

You are given a 0-indexed array words consisting of distinct strings.

Hercy wants to save money for his first car.

Given an integer array nums, return the sum of divisors of the integers in that array that have exactly four divisors.

Given an array of integers citations where citations[i] is the number of citations a researcher received for their ith paper and citations is sorted in non-descending order,...

You are given a 0-indexed integer array piles, where piles[i] represents the number of stones in the ith pile, and an integer k.

Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.

Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal.

You are given an integer array nums with length n.

Given an n x n grid containing only values 0 and 1, where 0 represents water and 1 represents land, find a water cell such that its distance to the nearest land cell is maximized,...

You are given two strings word1 and word2.

There is a company with n branches across the country, some of which are connected by roads.

You are given an integer matrix isWater of size m x n that represents a map of land and water cells.

The next greater element of some element x in an array is the first greater element that is to the right of x in the same array.

You are given an n x n binary grid board.

You are given a 0-indexed integer array nums having length n, and an integer k.

Given a list of non-negative integers nums, arrange them such that they form the largest number and return it.

Given a string s consisting only of characters 'a', 'b', and 'c'.

Given an integer num, repeatedly add all its digits until the result has only one digit, and return it.

You are given an integer array ranks representing the ranks of some mechanics.

You are given an integer array nums and a positive integer k.

You are in a city that consists of n intersections numbered from 0 to n - 1 with bi-directional roads between some intersections.

Given a string word, compress it using the following algorithm: Return the string comp.

You are given a 0-indexed integer array nums and an integer k.

You are given an integer n and an undirected graph with n nodes labeled from 0 to n - 1 and a 2D array edges, where edges[i] = [ui, vi] indicates an edge between nodes ui and vi.

Given two arrays nums1 and nums2.

You are given two integers n and k and two integer arrays speed and efficiency both of length n.

We have n buildings numbered from 0 to n - 1.

You are given two positive integer arrays nums and target, of the same length.

You are given a string word and an array of strings forbidden.

You are given an integer array nums (0-indexed).

Given an integer array num sorted in non-decreasing order.

Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix.

Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums.

A die simulator generates a random number from 1 to 6 for each roll.

You are given a string s consisting only of the characters '0' and '1'.

Given the array restaurants where restaurants[i] = [idi, ratingi, veganFriendlyi, pricei, distancei].

You are given an integer array nums.

You are given a positive integer n.

There is a group of n members, and a list of various crimes they could commit.

You are given an integer n indicating there are n people numbered from 0 to n - 1.

You are given an integer array nums.

Given two arrays of integers with equal lengths, return the maximum value of: |arr1[i] - arr1[j]| + |arr2[i] - arr2[j]| + |i - j| where the maximum is taken over all 0 <= i, j <...

You are given an array nums of n integers and two integers k and x.

You are given an integer array arr.

You are given two integer arrays, source and target, both of length n.

You are given the logs for users' actions on a platform, and an integer k.

Given an asynchronous function fn and a time t in milliseconds, return a new time limited version of the input function.

We have two arrays arr1 and arr2 which are initially empty.

Special binary strings are binary strings with the following two properties: You are given a special binary string s.

You are given an integer array arr.

You are given two strings s and t.

Given an integer n, return the smallest prime palindrome greater than or equal to n.

You are playing a solitaire game with three piles of stones of sizes a​​​​​​, b,​​​​​​ and c​​​​​​ respectively.

You are given a binary string s of length n and an integer numOps.

You are given an array arr which consists of only zeros and ones, divide the array into three non-empty parts such that all of these parts represent the same binary value.

Given an integer array nums and a positive integer k, return the most competitive subsequence of nums of size k.

There is an integer array nums that consists of n unique elements, but you have forgotten it.

Given a string s and an integer k, return the total number of substrings of s where at least one character appears at least k times.

Given an integer array nums and an integer k, return the k most frequent elements.

You are given an integer n which represents an array nums containing the numbers from 1 to n in order.

You are given a positive integer array nums.

There is an n x n grid, with the top-left cell at (0, 0) and the bottom-right cell at (n - 1, n - 1).

Given an array rectangles where rectangles[i] = [xi, yi, ai, bi] represents an axis-aligned rectangle.

You are given an m x n matrix grid consisting of positive integers.

Given an integer array nums, find three numbers whose product is maximum and return the maximum product.

You are given an array of integers nums.

You are given two categories of theme park attractions: land rides and water rides.

Given an array of unique integers, arr, where each integer arr[i] is strictly greater than 1.

You are given a palindromic string s.

Given an integer array nums and an integer k, return the kth largest element in the array.

You are maintaining a project that has n methods numbered from 0 to n - 1.

You are given an integer n representing the dimensions of an n x n grid, with the origin at the bottom-left corner of the grid.

You are given two strings of the same length s and t.

There are n kids with candies.

Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator.

You are given an array of characters letters that is sorted in non-decreasing order, and a character target.

Practice 2D array basics: nested iteration and row/column indexing.

You are given a 2D integer array points, where points[i] = [xi, yi] represents the coordinates of the ith point on the Cartesian plane.

Given a string s, you can transform every letter individually to be lowercase or uppercase to create another string.

Given a positive integer n, you can apply one of the following operations: Return the minimum number of operations needed for n to become 1.

There is a bookstore owner that has a store open for n minutes.

You are given two strings, str1 and str2, of lengths n and m, respectively.

Alice and Bob take turns playing a game, with Alice starting first.

Given two strings s and t, determine if they are isomorphic.

You are given a 0-indexed m * n integer matrix values, representing the values of m * n different items in m different shops.

Given a string s and an array of strings words, return the number of words[i] that is a subsequence of s.

Given a positive integer n, write a function that returns the number of set bits in its binary representation (also known as the Hamming weight).

There are n cities connected by some number of flights.

Given an integer array nums, your goal is to make all elements in nums equal.

You are given a binary string s.

You are given a 0-indexed integer array nums and a positive integer x.

There is an undirected tree with n nodes labeled from 0 to n - 1.

Given a string columnTitle that represents the column title as appears in an Excel sheet, return its corresponding column number.

You are given an array of integers nums of size 3.

Given an integer array nums and an integer k, return the number of pairs (i, j) where i < j such that |nums[i] - nums[j]| == k.

Given an integer array nums, partition it into two (contiguous) subarrays left and right so that: Return the length of left after such a partitioning.

The DNA sequence is composed of a series of nucleotides abbreviated as 'A', 'C', 'G', and 'T'.

There is a snake in an n x n matrix grid and can move in four possible directions.

Given a 0-indexed integer array nums, return the smallest index i of nums such that i mod 10 == nums[i], or -1 if such index does not exist.

Given a balanced parentheses string s, return the score of the string.

You are given two arrays of integers nums1 and nums2, possibly of different lengths.

You are given an integer array nums.

You are given three strings: s1, s2, and s3.

You are given two integer arrays, skill and mana, of length n and m, respectively.

You have n gardens, labeled from 1 to n, and an array paths where paths[i] = [xi, yi] describes a bidirectional path between garden xi to garden yi.

You are given a string num.

Anti-theft security devices are activated inside a bank.

You are given four integers sx, sy, fx, fy, and a non-negative integer t.

You are given a 0-indexed integer array nums containing n distinct positive integers.

You are given a sorted integer array arr containing 1 and prime numbers, where all the integers of arr are unique.

Given an integer array nums and an integer k, return true if nums has a good subarray or false otherwise.

Given a non-negative integer c, decide whether there're two integers a and b such that a2 + b2 = c.

You are given a 0-indexed string array words.

You are asked to cut off all the trees in a forest for a golf event.

You are given a 0-indexed array of positive integers nums.

Given the array orders, which represents the orders that customers have done in a restaurant.

You are given two arrays of integers, fruits and baskets, each of length n, where fruits[i] represents the quantity of the ith type of fruit, and baskets[j] represents the...

You are given a 0-indexed string pattern of length n consisting of the characters 'I' meaning increasing and 'D' meaning decreasing.

A magician has various spells.

You are given two strings, coordinate1 and coordinate2, representing the coordinates of a square on an 8 x 8 chessboard.

Given two integer arrays arr1 and arr2, return the minimum number of operations (possibly zero) needed to make arr1 strictly increasing.

You are given an array nums of non-negative integers.

Given two strings s1 and s2, return the lowest ASCII sum of deleted characters to make two strings equal.

Given a string s and an integer k, return the length of the longest substring of s such that the frequency of each character in this substring is greater than or equal to k.

You are a professional robber planning to rob houses along a street.

We define the conversion array conver of an array arr as follows: We also define the score of an array arr as the sum of the values of the conversion array of arr.

You are given an array nums consisting of positive integers.

You are given a 0-indexed integer array nums, where nums[i] represents the score of the ith student.

You are given a string s of lowercase English letters and an array widths denoting how many pixels wide each lowercase English letter is.

On a social network consisting of m users and some friendships between users, two users can communicate with each other if they know a common language.

You are given an array of unique integers salary where salary[i] is the salary of the ith employee.

You are given the two integers, n and m and two integer arrays, hBars and vBars.

You are given a string s, where every two consecutive vertical bars '|' are grouped into a pair.

You are given a 0-indexed m x n integer matrix grid.

You are given a string word of size n, and an integer k such that k divides n.

You are given an integer n and an integer start.

On a 0-indexed 8 x 8 chessboard, there can be multiple black queens and one white king.

Given an integer array arr of distinct integers and an integer k.

You are given a 0-indexed string num of length n consisting of digits.

There is a pizza with 3n slices of varying size, you and your friends will take slices of pizza as follows: Given an integer array slices that represent the sizes of the pizza...

Given an integer array arr, return the length of a maximum size turbulent subarray of arr.

The min-product of an array is equal to the minimum value in the array multiplied by the array's sum.

You are given an integer array target.

You are given an integer array nums.

Given a sorted integer array nums and an integer n, add/patch elements to the array such that any number in the range [1, n] inclusive can be formed by the sum of some elements in...

A chef has collected data on the satisfaction level of his n dishes.

You are given a 0-indexed integer array nums and an integer value.

You are playing a game with integers.

You are given a 0-indexed integer array nums.

You are given two positive integers n and k.

An integer x is a good if after rotating each digit individually by 180 degrees, we get a valid number that is different from x.

Given a 0-indexed integer array nums of size n containing all numbers from 1 to n, return the number of increasing quadruplets.

You are given a strictly increasing integer array rungs that represents the height of rungs on a ladder.

The imbalance number of a 0-indexed integer array arr of length n is defined as the number of indices in sarr = sorted(arr) such that: Here, sorted(arr) is the function that...

Given an array of integers arr, sort the array by performing a series of pancake flips.

You are given a 2D integer array properties having dimensions n x m and an integer k.

A sequence is special if it consists of a positive number of 0s, followed by a positive number of 1s, then a positive number of 2s.

There exist two undirected trees with n and m nodes, numbered from 0 to n - 1 and from 0 to m - 1, respectively.

You are given an integer array nums and two integers cost1 and cost2.

You are playing a video game where you are defending your city from a group of n monsters.

Alice has n balloons arranged on a rope.

You are given a 0-indexed m x n integer matrix grid consisting of distinct integers from 0 to m * n - 1.

You are given a 0-indexed string word, consisting of lowercase English letters.

Given the array queries of positive integers between 1 and m, you have to process all queries[i] (from i=0 to i=queries.length-1) according to the following rules: Return an array...

Given an array nums, you can perform the following operation any number of times: Return the minimum number of operations needed to make the array non-decreasing.

You are given an integer array nums, an integer k, and an integer multiplier.

Given a string s, partition it into unique segments according to the following procedure: Return an array of strings segments, where segments[i] is the ith segment created.

You are given a 0-indexed array nums of n integers, and an integer k.

In the town of Digitville, there was a list of numbers called nums containing integers from 0 to n - 1.

You are given an integer array nums having length n and a 2D integer array queries where queries[i] = [idx, val].

Given an m x n matrix, return a new matrix answer where answer[row][col] is the rank of matrix[row][col].

You have a 2-D grid of size m x n representing a box, and you have n balls.

Alice had a 0-indexed array arr consisting of n positive integers.

Given a string s, find the first non-repeating character in it and return its index.

Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the ith day to...

You are given a map of a server center, represented as a m * n integer matrix grid, where 1 means that on that cell there is a server and 0 means that it is no server.

You are an ant tasked with adding n new rooms numbered 0 to n-1 to your colony.

You are given a string target, an array of strings words, and an integer array costs, both arrays of the same length.

Given a circular integer array nums (i.e., the next element of nums[nums.length - 1] is nums[0]), return the next greater number for every element in nums.

Given an array of integers nums, find the maximum length of a subarray where the product of all its elements is positive.

Given an integer array nums of unique elements, return all possible subsets (the power set).

Given an integer array arr and an integer k, modify the array by repeating it k times.

You are given an array of words where each word consists of lowercase English letters.

You are given an integer hoursBefore, the number of hours you have to travel to your meeting.

Given a string of English letters s, return the greatest English letter which occurs as both a lowercase and uppercase letter in s.

There are n cars on an infinitely long road.

You are given a positive integer n.

We are given n different types of stickers.

You are given an integer array gifts denoting the number of gifts in various piles.

Given an integer n, return true if it is a power of four.

You are given a 0-indexed integer array nums.

You are given an array of strings equations that represent relationships between variables where each string equations[i] is of length 4 and takes one of two different forms:...

You are given an n x n integer matrix grid.

There exists an infinitely large grid.

Given two 0-indexed integer arrays nums1 and nums2, return a list answer of size 2 where: Note that the integers in the lists may be returned in any order.

You are given a 0-indexed integer array batteryPercentages having length n, denoting the battery percentages of n 0-indexed devices.

Given a string s, partition s such that every substring of the partition is a palindrome.

You are given an array representing a row of seats where seats[i] = 1 represents a person sitting in the ith seat, and seats[i] = 0 represents that the ith seat is empty...

Assume you are an awesome parent and want to give your children some cookies.

There is an undirected tree with n nodes labeled from 0 to n - 1 and n - 1 edges.

You are given two strings s and t of equal length n.

Given an array of strings names of size n.

A good meal is a meal that contains exactly two different food items with a sum of deliciousness equal to a power of two.

Given an integer array sorted in non-decreasing order, there is exactly one integer in the array that occurs more than 25% of the time, return that integer.

Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target.

You are given a 0-indexed array of positive integers nums.

Given a string s, find the longest palindromic subsequence's length in s.

A substring is a contiguous (non-empty) sequence of characters within a string.

You are given a 0-indexed m x n integer matrix grid and an integer k.

Given a m x n matrix mat and an integer threshold, return the maximum side-length of a square with a sum less than or equal to threshold or return 0 if there is no such square.

You are given an integer array weight of length n, representing the weights of n parcels arranged in a straight line.

You are given an integer array nums where the ith bag contains nums[i] balls.

Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].

You are given an integer array receiver of length n and an integer k.

You are given an integer array nums.

You are given an integer n and an undirected, weighted tree rooted at node 1 with n nodes numbered from 1 to n.

Given an encoded string, return its decoded string.

You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise).

There is a directed graph consisting of n nodes numbered from 0 to n - 1 and n directed edges.

You are given a 0-indexed integer array nums.

Given a string s, return true if s is a good string, or false otherwise.

Given the coordinates of four points in 2D space p1, p2, p3 and p4, return true if the four points construct a square.

Given an integer n, break it into the sum of k positive integers, where k >= 2, and maximize the product of those integers.

Given an array of integers nums and an integer k.

You are given an alphanumeric string s.

You are given an integer array nums and two integers, x and k.

You are given an integer array arr of length n that represents a permutation of the integers in the range [0, n - 1].

You are given two numeric strings num1 and num2 and two integers max_sum and min_sum.

You are given an integer array deck.

Given a 32-bit integer num, return a string representing its hexadecimal representation.

You are given a 0-indexed array nums consisting of positive integers.

You are given two integers memory1 and memory2 representing the available memory in bits on two memory sticks.

Given two integer arrays arr1 and arr2, and the integer d, return the distance value between the two arrays.

You are given a binary string s.

You are given an integer array nums and an integer m.

Given an integer array nums, return the number of elements that have both a strictly smaller and a strictly greater element appear in nums.

You are given the array paths, where paths[i] = [cityAi, cityBi] means there exists a direct path going from cityAi to cityBi.

You are given a 0-indexed 2D integer array questions where questions[i] = [pointsi, brainpoweri].

Remove the node that sits n positions from the end of a singly-linked list, then return the list.

There is a 1 million by 1 million grid on an XY-plane, and the coordinates of each grid square are (x, y).

You are given a 2D integer array orders, where each orders[i] = [pricei, amounti, orderTypei] denotes that amounti orders have been placed of type orderTypei at the price pricei.

You are given a string s and a pattern string p, where p contains exactly two '*' characters.

A farmer has a rectangular grid of land with m rows and n columns that can be divided into unit cells.

You are given a string s consisting of digits and an integer k.

You are building a string s of length n one character at a time, prepending each new character to the front of the string.

Given a 0-indexed integer array nums, find the leftmost middleIndex (i.e., the smallest amongst all the possible ones).