id int64 1 2k | content stringlengths 272 88.9k | title stringlengths 3 77 | title_slug stringlengths 3 79 | question_content stringlengths 230 5k | question_hints stringclasses 695
values | tag stringclasses 618
values | level stringclasses 3
values | similar_question_ids stringclasses 822
values |
|---|---|---|---|---|---|---|---|---|
527 | hey what's up guys chung here again so today let's take a look at another little problem here uh number 527 word abbreviation it's a hard problem but it gets as almost more than half of downwards because you know i don't quite like it you know but i still want to talk about this because it's a even it's still like a ve... | Word Abbreviation | word-abbreviation | Given an array of **distinct** strings `words`, return _the minimal possible **abbreviations** for every word_.
The following are the rules for a string abbreviation:
1. The **initial** abbreviation for each word is: the first character, then the number of characters in between, followed by the last character.
2. I... | null | Array,String,Greedy,Trie,Sorting | Hard | 408,411 |
141 | hey everyone welcome back and today we'll be doing another lead code problem one for one linked list cycle this is an easy one given the head of the link list determine if the linked list has a cycle in it so what is the cycle in the link list in which the last node points to any other node but in this case you may ass... | Linked List Cycle | linked-list-cycle | Given `head`, the head of a linked list, determine if the linked list has a cycle in it.
There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the `next` pointer. Internally, `pos` is used to denote the index of the node that tail's `next` pointer is co... | null | Hash Table,Linked List,Two Pointers | Easy | 142,202 |
1,812 | Show More Hello Everyone Today Bread Tak Hum 1812 Off List Co Dormant Color Obscuritism Many Time Champion More Questions in Interview For This Channel Don't Forget to Subscribe Thumbs Up to WhatsApp Return Roo Agri Boys Voices Are Doing Well in Time And always one more thing unicode that and all the best wishes metric... | Determine Color of a Chessboard Square | reformat-phone-number | You are given `coordinates`, a string that represents the coordinates of a square of the chessboard. Below is a chessboard for your reference.
Return `true` _if the square is white, and_ `false` _if the square is black_.
The coordinate will always represent a valid chessboard square. The coordinate will always have t... | Discard all the spaces and dashes. Use a while loop. While the string still has digits, check its length and see which rule to apply. | String | Easy | null |
5 | Jhaal Hello Hi Guys Welcome To Questions In This Video Also Single Brick Question That Is Long Spiderman Substring In This Question Explanation Something Is Vitamin E Longing For Indimension Pregnant And Follow The Example Senior Input Service BSBDA Bihar Police Baby Test Baby Only Longest And One Of Which Residence in... | Longest Palindromic Substring | longest-palindromic-substring | Given a string `s`, return _the longest_ _palindromic_ _substring_ in `s`.
**Example 1:**
**Input:** s = "babad "
**Output:** "bab "
**Explanation:** "aba " is also a valid answer.
**Example 2:**
**Input:** s = "cbbd "
**Output:** "bb "
**Constraints:**
* `1 <= s.length <= 1000`
* `s` consist of only dig... | How can we reuse a previously computed palindrome to compute a larger palindrome? If “aba” is a palindrome, is “xabax” a palindrome? Similarly is “xabay” a palindrome? Complexity based hint:
If we use brute-force and check whether for every start and end position a substring is a palindrome we have O(n^2) start - end ... | String,Dynamic Programming | Medium | 214,266,336,516,647 |
767 | back to the cracking fang youtube channel today we're going to be solving lead code problem 767 reorganize string given a string s rearrange the characters of s so that any two adjacent characters are not the same return any possible arrangement of s or return an empty string if it's not possible let's look at our firs... | Reorganize String | prime-number-of-set-bits-in-binary-representation | Given a string `s`, rearrange the characters of `s` so that any two adjacent characters are not the same.
Return _any possible rearrangement of_ `s` _or return_ `" "` _if not possible_.
**Example 1:**
**Input:** s = "aab"
**Output:** "aba"
**Example 2:**
**Input:** s = "aaab"
**Output:** ""
**Constraints:**
* ... | Write a helper function to count the number of set bits in a number, then check whether the number of set bits is 2, 3, 5, 7, 11, 13, 17 or 19. | Math,Bit Manipulation | Easy | 191 |
377 | Do that Aloo ji how 7.5 York Hotel we reached Aloo ji how 7.5 York Hotel we reached Aloo ji how 7.5 York Hotel we reached our target number 111 Here we are going to solve another question of religious Shiva its religious body If you search Dynamic Programming Road Map on YouTube from the top, we will be there in it You... | Combination Sum IV | combination-sum-iv | Given an array of **distinct** integers `nums` and a target integer `target`, return _the number of possible combinations that add up to_ `target`.
The test cases are generated so that the answer can fit in a **32-bit** integer.
**Example 1:**
**Input:** nums = \[1,2,3\], target = 4
**Output:** 7
**Explanation:**
Th... | null | Array,Dynamic Programming | Medium | 39 |
54 | So hello everyone in this video and solve spiral matrix question with lead code so in this question we have been asked to make a list in which we have to add the elements of the matrix, in this way first we have to add these elements and then this We have to add elements, then we have to add this element, then this, th... | Spiral Matrix | spiral-matrix | Given an `m x n` `matrix`, return _all elements of the_ `matrix` _in spiral order_.
**Example 1:**
**Input:** matrix = \[\[1,2,3\],\[4,5,6\],\[7,8,9\]\]
**Output:** \[1,2,3,6,9,8,7,4,5\]
**Example 2:**
**Input:** matrix = \[\[1,2,3,4\],\[5,6,7,8\],\[9,10,11,12\]\]
**Output:** \[1,2,3,4,8,12,11,10,9,5,6,7\]
**Const... | Well for some problems, the best way really is to come up with some algorithms for simulation. Basically, you need to simulate what the problem asks us to do. We go boundary by boundary and move inwards. That is the essential operation. First row, last column, last row, first column and then we move inwards by 1 and th... | Array,Matrix,Simulation | Medium | 59,921 |
78 | hey guys thanks for joining in this video we're going to take a look at problem 78 on leak code subsets so we'll do is first we'll go over the problem description and take a look at the examples they provide then we'll discuss different ways we can approach implementing the solution we'll call out any edge cases that w... | Subsets | subsets | Given an integer array `nums` of **unique** elements, return _all possible_ _subsets_ _(the power set)_.
The solution set **must not** contain duplicate subsets. Return the solution in **any order**.
**Example 1:**
**Input:** nums = \[1,2,3\]
**Output:** \[\[\],\[1\],\[2\],\[1,2\],\[3\],\[1,3\],\[2,3\],\[1,2,3\]\]
... | null | Array,Backtracking,Bit Manipulation | Medium | 90,320,800,2109,2170 |
51 | hey everybody this is larry this is day 22nd of the made eco day challenge hit the like button hit the subscribe button join me in discord let me know what you think about today's farm or today in general or whatever you like and today's farm it's going to be ann queens i'm having like terrible allergies in new york th... | N-Queens | n-queens | The **n-queens** puzzle is the problem of placing `n` queens on an `n x n` chessboard such that no two queens attack each other.
Given an integer `n`, return _all distinct solutions to the **n-queens puzzle**_. You may return the answer in **any order**.
Each solution contains a distinct board configuration of the n-... | null | Array,Backtracking | Hard | 52,1043 |
636 | hello everyone welcome back in this video lecture we will be solving this problem exclusive time of functions which is a lead code medium problem in this problem we are given a single threaded CPU so what do we have in a single threaded CPU we execute a program which contains and functions each function has a unique ID... | Exclusive Time of Functions | exclusive-time-of-functions | On a **single-threaded** CPU, we execute a program containing `n` functions. Each function has a unique ID between `0` and `n-1`.
Function calls are **stored in a [call stack](https://en.wikipedia.org/wiki/Call_stack)**: when a function call starts, its ID is pushed onto the stack, and when a function call ends, its I... | null | Array,Stack | Medium | null |
368 | hi everyone welcome back to the channel and today we solve Le code daily challenge problem number 368 largest divisible subset so we'll first check out the problem statement then we look into the approach which you're going to use and we'll be using dynamic programming to solve this one and towards the end we'll see th... | Largest Divisible Subset | largest-divisible-subset | Given a set of **distinct** positive integers `nums`, return the largest subset `answer` such that every pair `(answer[i], answer[j])` of elements in this subset satisfies:
* `answer[i] % answer[j] == 0`, or
* `answer[j] % answer[i] == 0`
If there are multiple solutions, return any of them.
**Example 1:**
**Inp... | null | Array,Math,Dynamic Programming,Sorting | Medium | null |
35 | hey programmers headquarters what's up so today we are going to solve the one of the good question i think yeah it's kind of like easy not too hard yeah it's easy so this is search insert position so basically what we have to do in the question is like we have to uh check like just like the question we have to uh retur... | Search Insert Position | search-insert-position | Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You must write an algorithm with `O(log n)` runtime complexity.
**Example 1:**
**Input:** nums = \[1,3,5,6\], target = 5
**Output:** 2
**Exa... | null | Array,Binary Search | Easy | 278 |
221 | cool I'd given it to the binary matrix for sales and once find a larger square containing only ones and return it to area not a lie so I have seen this problem before I mean to some degree I've seen a lot of these farms before but this one for me I feel is more of it for me a few is like a little bit of like there's a ... | Maximal Square | maximal-square | Given an `m x n` binary `matrix` filled with `0`'s and `1`'s, _find the largest square containing only_ `1`'s _and return its area_.
**Example 1:**
**Input:** matrix = \[\[ "1 ", "0 ", "1 ", "0 ", "0 "\],\[ "1 ", "0 ", "1 ", "1 ", "1 "\],\[ "1 ", "1 ", "1 ", "1 ", "1 "\],\[ "1 ", "0 ", "0 ", "1 ", "0 "\]\]
**Output:*... | null | Array,Dynamic Programming,Matrix | Medium | 85,769,1312,2200 |
509 | hello everyone so in this video we are going to solve a question complete code that is fibonacci number this is 509th question lead code and this comes under easy category all right so let's start with the problem statement the fibonacci number commonly denoted fn forms a sequence called the fibonacci sequence such tha... | Fibonacci Number | inorder-successor-in-bst-ii | 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`. That is,
F(0) = 0, F(1) = 1
F(n) = F(n - 1) + F(n - 2), for n > 1.
Given `n`, calculate `F(n)`.
**Example 1:**
**Input:** n = ... | null | Tree,Binary Search Tree,Binary Tree | Medium | 285 |
326 | hi guys this is khushboo and welcome to algorithms made easy in this video we will see the question power of 3 given an integer n return true if it is a power of 3 otherwise written false now we can say that n is a power of 3 if there is a integer x such that n is equal to 3 raised to x so in the given example 1 we can... | Power of Three | power-of-three | Given an integer `n`, return _`true` if it is a power of three. Otherwise, return `false`_.
An integer `n` is a power of three, if there exists an integer `x` such that `n == 3x`.
**Example 1:**
**Input:** n = 27
**Output:** true
**Explanation:** 27 = 33
**Example 2:**
**Input:** n = 0
**Output:** false
**Explanat... | null | Math,Recursion | Easy | 231,342,1889 |
894 | hey everybody this is Larry this is me doing the daily problem for day 23 of July uh hit the like button hit the Subscribe button join me on Discord let me know what you think about today's problem so oh a new problem I haven't done this one before nice so I'm excited about that uh just a quick Interruption I guess or ... | All Possible Full Binary Trees | random-pick-with-blacklist | Given an integer `n`, return _a list of all possible **full binary trees** with_ `n` _nodes_. Each node of each tree in the answer must have `Node.val == 0`.
Each element of the answer is the root node of one possible tree. You may return the final list of trees in **any order**.
A **full binary tree** is a binary tr... | null | Hash Table,Math,Binary Search,Sorting,Randomized | Hard | 398,912,2107 |
354 | hey everybody this is larry this is day 25 of the leeco daily challenge hit the like button to subscribe on drum and discord let me know what you think about today's forum so just a quick update as i do usually about this thing is loading anyway um yeah i'm just curious what people uh what sports do people watch i've b... | Russian Doll Envelopes | russian-doll-envelopes | You are given a 2D array of integers `envelopes` where `envelopes[i] = [wi, hi]` represents the width and the height of an envelope.
One envelope can fit into another if and only if both the width and height of one envelope are greater than the other envelope's width and height.
Return _the maximum number of envelope... | null | Array,Binary Search,Dynamic Programming,Sorting | Hard | 300,2123 |
1,553 | hello guys my name is lazdor and today i'm going to be doing a lee code problem this problem is called minimum number of days to eat and oranges there are n oranges in the kitchen and you decide to eat some of these oranges every day as follows we can either eat one orange or if the number of remaining oranges n is div... | Minimum Number of Days to Eat N Oranges | count-triplets-that-can-form-two-arrays-of-equal-xor | There are `n` oranges in the kitchen and you decided to eat some of these oranges every day as follows:
* Eat one orange.
* If the number of remaining oranges `n` is divisible by `2` then you can eat `n / 2` oranges.
* If the number of remaining oranges `n` is divisible by `3` then you can eat `2 * (n / 3)` oran... | We are searching for sub-array of length ≥ 2 and we need to split it to 2 non-empty arrays so that the xor of the first array is equal to the xor of the second array. This is equivalent to searching for sub-array with xor = 0. Keep the prefix xor of arr in another array, check the xor of all sub-arrays in O(n^2), if th... | Array,Hash Table,Math,Bit Manipulation,Prefix Sum | Medium | null |
190 | hi guys welcome to algorithms made easy today we will go through the day 12 problem from the July lead coding challenge the worst bits please like the video and if you are new don't forget to subscribe to our channel so that you never miss any update we need to reverse the bits of a given 32-bit unsigned the bits of a ... | Reverse Bits | reverse-bits | Reverse bits of a given 32 bits unsigned integer.
**Note:**
* Note that in some languages, such as Java, there is no unsigned integer type. In this case, both input and output will be given as a signed integer type. They should not affect your implementation, as the integer's internal binary representation is the s... | null | Divide and Conquer,Bit Manipulation | Easy | 7,191,2238 |
454 | Loot Hello Guys Welcome Bar Tum Meri Ye Siddha Question For Some Part 2 In This Question Angry Bird Flu ABCD Of India Limited Computer subscribe to the Page if you liked The Video then subscribe to the Page Ko Nashamukt To Values Strong Negative Of Ko Nashamukt To Values Strong Negative Of Ko Nashamukt To Values ... | 4Sum II | 4sum-ii | Given four integer arrays `nums1`, `nums2`, `nums3`, and `nums4` all of length `n`, return the number of tuples `(i, j, k, l)` such that:
* `0 <= i, j, k, l < n`
* `nums1[i] + nums2[j] + nums3[k] + nums4[l] == 0`
**Example 1:**
**Input:** nums1 = \[1,2\], nums2 = \[-2,-1\], nums3 = \[-1,2\], nums4 = \[0,2\]
**Ou... | null | Array,Hash Table | Medium | 18 |
1,675 | good evening millennials today we look at an elite current heart problem rarely asked in fact interview companies but it's often tested in other companies such as visa so let's look at the question this is the 1675th in the lead code website called minimum minimize deviation in array and it's a hard problem so let's re... | Minimize Deviation in Array | magnetic-force-between-two-balls | You are given an array `nums` of `n` positive integers.
You can perform two types of operations on any element of the array any number of times:
* If the element is **even**, **divide** it by `2`.
* For example, if the array is `[1,2,3,4]`, then you can do this operation on the last element, and the array wil... | If you can place balls such that the answer is x then you can do it for y where y < x. Similarly if you cannot place balls such that the answer is x then you can do it for y where y > x. Binary search on the answer and greedily see if it is possible. | Array,Binary Search,Sorting | Medium | 2188 |
117 | hello everyone welcome to day 13 of lead code may challenge today we have question number 117 populating next write pointer in each node 2. in this question they have given us a binary tree and we have to populate each next pointer to point to its next right node if there is no next night right node then the next point... | Populating Next Right Pointers in Each Node II | populating-next-right-pointers-in-each-node-ii | Given a binary tree
struct Node {
int val;
Node \*left;
Node \*right;
Node \*next;
}
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to `NULL`.
Initially, all next pointers are set to `NULL`.
**Example 1:**
**Input:** root = \[1,2,3... | null | Linked List,Tree,Depth-First Search,Breadth-First Search,Binary Tree | Medium | 116 |
1,857 | right hello today we're going to approach problem 1857 largest color value in a directed graph full disclosure this is not the first time that I've approached this problem I uh solve this problem a few minutes ago but due to some technical difficulties the recording was corrupted so I'm just going to go through this pr... | Largest Color Value in a Directed Graph | largest-color-value-in-a-directed-graph | There is a **directed graph** of `n` colored nodes and `m` edges. The nodes are numbered from `0` to `n - 1`.
You are given a string `colors` where `colors[i]` is a lowercase English letter representing the **color** of the `ith` node in this graph (**0-indexed**). You are also given a 2D array `edges` where `edges[j]... | null | null | Hard | null |
1,192 | all right so this question is critical Connections in a network so you are given the 2D array connections so a b represent a connection between a two server and yeah so it's by Direction by directional so zero can go to two can go to zero so you want to re return a critical connection which can be what um you know disc... | Critical Connections in a Network | divide-chocolate | There are `n` servers numbered from `0` to `n - 1` connected by undirected server-to-server `connections` forming a network where `connections[i] = [ai, bi]` represents a connection between servers `ai` and `bi`. Any server can reach other servers directly or indirectly through the network.
A _critical connection_ is ... | After dividing the array into K+1 sub-arrays, you will pick the sub-array with the minimum sum. Divide the sub-array into K+1 sub-arrays such that the minimum sub-array sum is as maximum as possible. Use binary search with greedy check. | Array,Binary Search | Hard | 410,1056 |
15 | hello everyone and welcome to python programming practice in this episode we're going to be tackling lead code number 15 called three sum this is a medium difficulty problem so it's probably going to take a decent bit of thinking to come up with a good solution we're just going to start by looking at the description an... | 3Sum | 3sum | Given an integer array nums, return all the triplets `[nums[i], nums[j], nums[k]]` such that `i != j`, `i != k`, and `j != k`, and `nums[i] + nums[j] + nums[k] == 0`.
Notice that the solution set must not contain duplicate triplets.
**Example 1:**
**Input:** nums = \[-1,0,1,2,-1,-4\]
**Output:** \[\[-1,-1,2\],\[-1,0... | So, we essentially need to find three numbers x, y, and z such that they add up to the given value. If we fix one of the numbers say x, we are left with the two-sum problem at hand! For the two-sum problem, if we fix one of the numbers, say x, we have to scan the entire array to find the next numbery which is value - x... | Array,Two Pointers,Sorting | Medium | 1,16,18,259 |
991 | hello everyone and welcome back to another video so as you can see behind me the setup is different i'm currently moved on to campus but anyways so this time we're going to be solving the lika question broken calculator and in this question we're going to be given a broken calculator and it's not working except for two... | Broken Calculator | array-of-doubled-pairs | There is a broken calculator that has the integer `startValue` on its display initially. In one operation, you can:
* multiply the number on display by `2`, or
* subtract `1` from the number on display.
Given two integers `startValue` and `target`, return _the minimum number of operations needed to display_ `targ... | null | Array,Hash Table,Greedy,Sorting | Medium | 2117 |
313 | hello um so today we will see this uh lead code problem super ugly number um which i should just increase the mic so insert it okay fine so uh super ugly problem it's similar to ugly number uh it's just that uh i instead of three numbers two three five i have given is it is a vector of more it can be of any size so yea... | Super Ugly Number | super-ugly-number | A **super ugly number** is a positive integer whose prime factors are in the array `primes`.
Given an integer `n` and an array of integers `primes`, return _the_ `nth` _**super ugly number**_.
The `nth` **super ugly number** is **guaranteed** to fit in a **32-bit** signed integer.
**Example 1:**
**Input:** n = 12, ... | null | Array,Hash Table,Math,Dynamic Programming,Heap (Priority Queue) | Medium | 264 |
993 | any hello there so today silicone challenge question is called a cousin sing binary tree we have a binary tree and the rule notice at the depth 0 the children of each steps K node at the depth k plus 1 so we draw the tree rule node on the top and the Leafs nodes on the button and draw that in the level by level kind of... | Cousins in Binary Tree | tallest-billboard | Given the `root` of a binary tree with unique values and the values of two different nodes of the tree `x` and `y`, return `true` _if the nodes corresponding to the values_ `x` _and_ `y` _in the tree are **cousins**, or_ `false` _otherwise._
Two nodes of a binary tree are **cousins** if they have the same depth with d... | null | Array,Dynamic Programming | Hard | 2162 |
735 | hello everyone welcome back here is vanamsen and today we have a very exciting problem we will try to solve it in C plus so it's involved uh with asteroids so let's navigate to the problem so each asteroid absolute value represent its size and the sign represent its direction and we are given an array of integer that r... | Asteroid Collision | asteroid-collision | We are given an array `asteroids` of integers representing asteroids in a row.
For each asteroid, the absolute value represents its size, and the sign represents its direction (positive meaning right, negative meaning left). Each asteroid moves at the same speed.
Find out the state of the asteroids after all collisio... | Say a row of asteroids is stable. What happens when a new asteroid is added on the right? | Array,Stack | Medium | 605,2245,2317 |
1,647 | hey everyone today we are going to solve the little question minimum deletions to make character frequencies unique a string s is called good if there are no two different characters in s that have the same frequency given a string as return the minimum number of characters you need to delete to make S good so let's se... | Minimum Deletions to Make Character Frequencies Unique | can-convert-string-in-k-moves | A string `s` is called **good** if there are no two different characters in `s` that have the same **frequency**.
Given a string `s`, return _the **minimum** number of characters you need to delete to make_ `s` _**good**._
The **frequency** of a character in a string is the number of times it appears in the string. F... | Observe that shifting a letter x times has the same effect of shifting the letter x + 26 times. You need to check whether k is large enough to cover all shifts with the same remainder after modulo 26. | Hash Table,String | Medium | null |
1,822 | hello guys welcome back to my channel and today we will solving a new lead code question that is sign of the product of an array so the question says there is a function sign function X that returns 1 if x is positive minus 1 if x is negative 0 if x is equal to 0 you are given an integer array dumps it let Buddha to be... | Sign of the Product of an Array | longest-palindromic-subsequence-ii | There is a function `signFunc(x)` that returns:
* `1` if `x` is positive.
* `-1` if `x` is negative.
* `0` if `x` is equal to `0`.
You are given an integer array `nums`. Let `product` be the product of all values in the array `nums`.
Return `signFunc(product)`.
**Example 1:**
**Input:** nums = \[-1,-2,-3,-4,... | As with any good dp problem that uses palindromes, try building the palindrome from the edges The prime point is to check that no two adjacent characters are equal, so save the past character while building the palindrome. | String,Dynamic Programming | Medium | 516 |
315 | welcome to june 26th lead code challenge count of smaller numbers after self you're given a number uh you're given an integer array nums and you have to return the new counts array the count array has a property where the count at i is the number of smallest elements to the right of nums i so say we're given this array... | Count of Smaller Numbers After Self | count-of-smaller-numbers-after-self | Given an integer array `nums`, return _an integer array_ `counts` _where_ `counts[i]` _is the number of smaller elements to the right of_ `nums[i]`.
**Example 1:**
**Input:** nums = \[5,2,6,1\]
**Output:** \[2,1,1,0\]
**Explanation:**
To the right of 5 there are **2** smaller elements (2 and 1).
To the right of 2 the... | null | Array,Binary Search,Divide and Conquer,Binary Indexed Tree,Segment Tree,Merge Sort,Ordered Set | Hard | 327,406,493,1482,2280 |
54 | okay lit code number 54 spiral matrix okay not a rocket science task by itself but might be implementation heavy so we have the matrix we just have to spiral around the matrix and collect all the elements and return them in the order that we went through them so the spiraling would be first moving to the right and when... | Spiral Matrix | spiral-matrix | Given an `m x n` `matrix`, return _all elements of the_ `matrix` _in spiral order_.
**Example 1:**
**Input:** matrix = \[\[1,2,3\],\[4,5,6\],\[7,8,9\]\]
**Output:** \[1,2,3,6,9,8,7,4,5\]
**Example 2:**
**Input:** matrix = \[\[1,2,3,4\],\[5,6,7,8\],\[9,10,11,12\]\]
**Output:** \[1,2,3,4,8,12,11,10,9,5,6,7\]
**Const... | Well for some problems, the best way really is to come up with some algorithms for simulation. Basically, you need to simulate what the problem asks us to do. We go boundary by boundary and move inwards. That is the essential operation. First row, last column, last row, first column and then we move inwards by 1 and th... | Array,Matrix,Simulation | Medium | 59,921 |
45 | Hello friends welcome to code Sutra in this video I will discuss about leeco problem number 45 Jump game 2. in this problem you are given an array in this array each point indicates the maximum that jump you can take for example 3 indicates you can travel to this or this that is you can travel Three Steps from this par... | Jump Game II | jump-game-ii | You are given a **0-indexed** array of integers `nums` of length `n`. You are initially positioned at `nums[0]`.
Each element `nums[i]` represents the maximum length of a forward jump from index `i`. In other words, if you are at `nums[i]`, you can jump to any `nums[i + j]` where:
* `0 <= j <= nums[i]` and
* `i +... | null | Array,Dynamic Programming,Greedy | Medium | 55,1428,2001 |
100 | hello everyone my name is Scott and today we're going to go through leak code problem 100 which is same tree given the roots of two binary trees p and Q write a function to check if they are the same or not two binary trees are considered the same if they are structurally identical and the nodes have the same value so ... | Same Tree | same-tree | Given the roots of two binary trees `p` and `q`, write a function to check if they are the same or not.
Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.
**Example 1:**
**Input:** p = \[1,2,3\], q = \[1,2,3\]
**Output:** true
**Example 2:**
**Input:** p... | null | Tree,Depth-First Search,Breadth-First Search,Binary Tree | Easy | null |
162 | hey everyone my name is puru rhoda and i welcome you all to this channel today we are looking at the problem find peak element this is a medium level problem on lead code and it is a very nice problem that makes you think over your basic skills now let's look at this problem a peak element is an element that is strictl... | Find Peak Element | find-peak-element | A peak element is an element that is strictly greater than its neighbors.
Given a **0-indexed** integer array `nums`, find a peak element, and return its index. If the array contains multiple peaks, return the index to **any of the peaks**.
You may imagine that `nums[-1] = nums[n] = -∞`. In other words, an element is... | null | Array,Binary Search | Medium | 882,2047,2273,2316 |
99 | hey everybody this is larry this is day 19. yeah on the leeco april daily challenge hit the like button hit the subscribe button join me on discord let me know what you think about today's prom i played softball earlier today i'm really tired so hopefully we'll just this will be good and we lost on a very heartbreaking... | Recover Binary Search Tree | recover-binary-search-tree | You are given the `root` of a binary search tree (BST), where the values of **exactly** two nodes of the tree were swapped by mistake. _Recover the tree without changing its structure_.
**Example 1:**
**Input:** root = \[1,3,null,null,2\]
**Output:** \[3,1,null,null,2\]
**Explanation:** 3 cannot be a left child of 1 ... | null | Tree,Depth-First Search,Binary Search Tree,Binary Tree | Medium | null |
2,000 | hey everyone uh today i'll be going over problem 2000 a reverse prefix of a word so as i always do i'm just going to get the test case and explain what they want uh the link is in the description so you could just check it out so we're given this test case and we're given some word and a character and basically we want... | Reverse Prefix of Word | minimum-speed-to-arrive-on-time | Given a **0-indexed** string `word` and a character `ch`, **reverse** the segment of `word` that starts at index `0` and ends at the index of the **first occurrence** of `ch` (**inclusive**). If the character `ch` does not exist in `word`, do nothing.
* For example, if `word = "abcdefd "` and `ch = "d "`, then you s... | Given the speed the trains are traveling at, can you find the total time it takes for you to arrive? Is there a cutoff where any speeds larger will always allow you to arrive on time? | Array,Binary Search | Medium | 1335,2013,2294 |
796 | what's up guys Nick white tear tech encoding stuff on Twitch on YouTube and we are doing rotate string today very easy problem really could just message to this or make like a status update but to even explain this one it's so easy but it's kind of a trick solution it's kind of something you have to know is kind of som... | Rotate String | reaching-points | Given two strings `s` and `goal`, return `true` _if and only if_ `s` _can become_ `goal` _after some number of **shifts** on_ `s`.
A **shift** on `s` consists of moving the leftmost character of `s` to the rightmost position.
* For example, if `s = "abcde "`, then it will be `"bcdea "` after one shift.
**Example 1... | null | Math | Hard | null |
2 | hello everybody today we're gonna be solving leak code number two of the top 100 which is add two numbers so you're given the non empty linked list representing two non-negative integers representing two non-negative integers representing two non-negative integers the digits are stored in reverse order and each of thei... | Add Two Numbers | add-two-numbers | You are given two **non-empty** linked lists representing two non-negative integers. The digits are stored in **reverse order**, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 ... | null | Linked List,Math,Recursion | Medium | 43,67,371,415,445,1031,1774 |
315 | hello YouTube is it another Nikko problem called of smaller numbers after sales you have to being an integer really nuts and you have to return a link concentrate the console Ray has a property belkin's I is the number of smaller elements to the right of non sign so we just need you turn the smaller number to the right... | Count of Smaller Numbers After Self | count-of-smaller-numbers-after-self | Given an integer array `nums`, return _an integer array_ `counts` _where_ `counts[i]` _is the number of smaller elements to the right of_ `nums[i]`.
**Example 1:**
**Input:** nums = \[5,2,6,1\]
**Output:** \[2,1,1,0\]
**Explanation:**
To the right of 5 there are **2** smaller elements (2 and 1).
To the right of 2 the... | null | Array,Binary Search,Divide and Conquer,Binary Indexed Tree,Segment Tree,Merge Sort,Ordered Set | Hard | 327,406,493,1482,2280 |
516 | everyone The Tech Teacher here today we are going to go through an interesting lead code problem it's called longest palindromic subsequence before we start if you like our Channel like the video subscribe to the channel enable the notifications so that you receive our updates as fast as possible let's go back to our p... | Longest Palindromic Subsequence | longest-palindromic-subsequence | Given a string `s`, find _the longest palindromic **subsequence**'s length in_ `s`.
A **subsequence** is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.
**Example 1:**
**Input:** s = "bbbab "
**Output:** 4
**Explanation:** On... | null | String,Dynamic Programming | Medium | 5,647,730,1250,1822,1897,2130 |
446 | Arithmetic Slos to Sub Sequence Hard Question of Lead Code Let's Do It First of all let's read its problem statement so basically Apn Ko Ek Hey Deke Rakhi Hai Nams is ok and Apn Uski Apn Ko Usi Jitni Possible Total Number of Sub Sequence Arithmetic Sub Sequences can be made, you have to return them, okay, so here we ha... | Arithmetic Slices II - Subsequence | arithmetic-slices-ii-subsequence | Given an integer array `nums`, return _the number of all the **arithmetic subsequences** of_ `nums`.
A sequence of numbers is called arithmetic if it consists of **at least three elements** and if the difference between any two consecutive elements is the same.
* For example, `[1, 3, 5, 7, 9]`, `[7, 7, 7, 7]`, and ... | null | Array,Dynamic Programming | Hard | 413 |
413 | That Self Solving List Questions More Matrix This Question Statement Is Landing Gear Is Called Educated Consist Of At Least Three Elements And Difference Between Any Two Consecutive Elements Name For Example 1579 70 Electro Arithmetic Sequences And Generate Returns Of The Survey Of Subscribe And Contact Us He is asking... | Arithmetic Slices | arithmetic-slices | An integer array is called arithmetic if it consists of **at least three elements** and if the difference between any two consecutive elements is the same.
* For example, `[1,3,5,7,9]`, `[7,7,7,7]`, and `[3,-1,-5,-9]` are arithmetic sequences.
Given an integer array `nums`, return _the number of arithmetic **subarr... | null | Array,Dynamic Programming | Medium | 446,1752 |
943 | hello everyone welcome to quartus cam so we are a 23rd day of mail lead code challenge and the problem we are going to cover in this video is find the shortest superstring the input given here is a string array which consists of strings and we have to return the minimum or the smallest string that contains each string ... | Find the Shortest Superstring | sum-of-subarray-minimums | Given an array of strings `words`, return _the smallest string that contains each string in_ `words` _as a substring_. If there are multiple valid strings of the smallest length, return **any of them**.
You may assume that no string in `words` is a substring of another string in `words`.
**Example 1:**
**Input:** wo... | null | Array,Dynamic Programming,Stack,Monotonic Stack | Medium | 2227 |
1,662 | Hello friends, in today's problem we have been given two arrays of strings. We have to tell whether they are equivalent or not. When will they be equivalent? When we combine these two strings, like ABC, what will become of it, ABC and Vertu, which is in it? Given ABC, what will be formed if we combine it, ABC are both ... | Check If Two String Arrays are Equivalent | minimum-numbers-of-function-calls-to-make-target-array | Given two string arrays `word1` and `word2`, return `true` _if the two arrays **represent** the same string, and_ `false` _otherwise._
A string is **represented** by an array if the array elements concatenated **in order** forms the string.
**Example 1:**
**Input:** word1 = \[ "ab ", "c "\], word2 = \[ "a ", "bc "... | Work backwards: try to go from nums to arr. You should try to divide by 2 as much as possible, but you can only divide by 2 if everything is even. | Array,Greedy | Medium | null |
59 | welcome back today let's try to solve another lead crew problem 59 spelling Matrix 2 so we are getting a positive integer in generate air n times n Matrix filled with elements from 1 to n Square in Sparrow order so this means if we are getting a number of n equals to 3 so it means we'll have a range of one to nine so i... | Spiral Matrix II | spiral-matrix-ii | Given a positive integer `n`, generate an `n x n` `matrix` filled with elements from `1` to `n2` in spiral order.
**Example 1:**
**Input:** n = 3
**Output:** \[\[1,2,3\],\[8,9,4\],\[7,6,5\]\]
**Example 2:**
**Input:** n = 1
**Output:** \[\[1\]\]
**Constraints:**
* `1 <= n <= 20` | null | Array,Matrix,Simulation | Medium | 54,921 |
173 | hello all welcome to my youtube channel today we are going to solve lead code problem number 173 and the problem name is binary search tree iterator the problem is of medium category let's read out the problem statement implement the binary search reiterator class that represents an iterator over in order traversal of ... | Binary Search Tree Iterator | binary-search-tree-iterator | Implement the `BSTIterator` class that represents an iterator over the **[in-order traversal](https://en.wikipedia.org/wiki/Tree_traversal#In-order_(LNR))** of a binary search tree (BST):
* `BSTIterator(TreeNode root)` Initializes an object of the `BSTIterator` class. The `root` of the BST is given as part of the co... | null | Stack,Tree,Design,Binary Search Tree,Binary Tree,Iterator | Medium | 94,251,281,284,285,1729 |
1,732 | Yes, we have come to week two, it is fun seeing your consistency, everyone is participating so much, solving questions very consistently, it feels very good, keep going in this manner from New Year. First of all, we will enter the New Year by learning DSA in a better way. Let's move towards the solution. Okay, so let's... | Find the Highest Altitude | minimum-one-bit-operations-to-make-integers-zero | There is a biker going on a road trip. The road trip consists of `n + 1` points at different altitudes. The biker starts his trip on point `0` with altitude equal `0`.
You are given an integer array `gain` of length `n` where `gain[i]` is the **net gain in altitude** between points `i` and `i + 1` for all (`0 <=... | The fastest way to convert n to zero is to remove all set bits starting from the leftmost one. Try some simple examples to learn the rule of how many steps are needed to remove one set bit. consider n=2^k case first, then solve for all n. | Dynamic Programming,Bit Manipulation,Memoization | Hard | 2119 |
4 | Hello friends I actually have great news for all of you guys uh I just want to give you a quick update that I got a job at Microsoft and I will be starting next week I am going to make a whole separate video on the whole interview process and how I get the job it's a really crazy story so I hope you like it uh and now ... | Median of Two Sorted Arrays | median-of-two-sorted-arrays | Given two sorted arrays `nums1` and `nums2` of size `m` and `n` respectively, return **the median** of the two sorted arrays.
The overall run time complexity should be `O(log (m+n))`.
**Example 1:**
**Input:** nums1 = \[1,3\], nums2 = \[2\]
**Output:** 2.00000
**Explanation:** merged array = \[1,2,3\] and median is ... | null | Array,Binary Search,Divide and Conquer | Hard | null |
6 | hey everybody this is Larry this is day three of the legal daily challenge hit the like button hit the Subscribe button join me on Discord let me know what you think about today's problem six sack conversion I think uh yeah let's see what uh what this is about so I'm a little bit later today I'm feeling a little bit ti... | Zigzag Conversion | zigzag-conversion | The string `"PAYPALISHIRING "` is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
P A H N
A P L S I I G
Y I R
And then read line by line: `"PAHNAPLSIIGYIR "`
Write the code that will take a string and make this co... | null | String | Medium | null |
1,690 | On Do Hello Everyone Suggest Also Solving Stone Game Seven Features Adda 11:00 Off Junit Game Seven Features Adda 11:00 Off Junit Game Seven Features Adda 11:00 Off Junit Challenge Delhi Tennis A Question Choose Like This Lesson For Boy Playing Game Play Starting First And Tours In Europe In This Player Subscribe 210 W... | Stone Game VII | maximum-length-of-subarray-with-positive-product | Alice and Bob take turns playing a game, with **Alice starting first**.
There are `n` stones arranged in a row. On each player's turn, they can **remove** either the leftmost stone or the rightmost stone from the row and receive points equal to the **sum** of the remaining stones' values in the row. The winner is the ... | Split the whole array into subarrays by zeroes since a subarray with positive product cannot contain any zero. If the subarray has even number of negative numbers, the whole subarray has positive product. Otherwise, we have two choices, either - remove the prefix till the first negative element in this subarray, or rem... | Array,Dynamic Programming,Greedy | Medium | null |
314 | hi guys today we're going to look at problem 314 which is binary tree vertical order traversal let's see what this problem is given a binary tree returned the vertical order traversal of its nodes values ie from top to bottom column by column if two nodes are in the same row and column the order should be from left to ... | Binary Tree Vertical Order Traversal | binary-tree-vertical-order-traversal | Given the `root` of a binary tree, return _**the vertical order traversal** of its nodes' values_. (i.e., from top to bottom, column by column).
If two nodes are in the same row and column, the order should be from **left to right**.
**Example 1:**
**Input:** root = \[3,9,20,null,null,15,7\]
**Output:** \[\[9\],\[3,... | null | Hash Table,Tree,Depth-First Search,Breadth-First Search,Binary Tree | Medium | 102 |
1,413 | hi guys today we are going to this question that came in little Polly judges minimum value to get positive step by step so let's read the question given an array of integers nonce you start with a positive value what starts so there is a variable names start value and which has some usual positive I will don't know wha... | Minimum Value to Get Positive Step by Step Sum | maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold | Given an array of integers `nums`, you start with an initial **positive** value _startValue__._
In each iteration, you calculate the step by step sum of _startValue_ plus elements in `nums` (from left to right).
Return the minimum **positive** value of _startValue_ such that the step by step sum is never less than 1.... | Store prefix sum of all grids in another 2D array. Try all possible solutions and if you cannot find one return -1. If x is a valid answer then any y < x is also valid answer. Use binary search to find answer. | Array,Binary Search,Matrix,Prefix Sum | Medium | null |
1,528 | Hello hello everyone welcome to my YouTube channel today weir solving list code problem number 1528 successful string problem hind this problem weir giving relief from 021 minus one and strength of length and what we do it is the will have to reach this string according to researchers are Of India That Is That Point To... | Shuffle String | kids-with-the-greatest-number-of-candies | You are given a string `s` and an integer array `indices` of the **same length**. The string `s` will be shuffled such that the character at the `ith` position moves to `indices[i]` in the shuffled string.
Return _the shuffled string_.
**Example 1:**
**Input:** s = "codeleet ", `indices` = \[4,5,6,7,0,2,1,3\]
**Out... | Use greedy approach. For each kid check if candies[i] + extraCandies ≥ maximum in Candies[i]. | Array | Easy | null |
92 | hello everyone and this is a video on purity of lead code 7 September 2023 so this is our question uh it's pretty easy question uh what we have to do is we have to reverse this linked list from the left position to a right position left and right position are provided with the input so I'll use the easiest approach thi... | Reverse Linked List II | reverse-linked-list-ii | Given the `head` of a singly linked list and two integers `left` and `right` where `left <= right`, reverse the nodes of the list from position `left` to position `right`, and return _the reversed list_.
**Example 1:**
**Input:** head = \[1,2,3,4,5\], left = 2, right = 4
**Output:** \[1,4,3,2,5\]
**Example 2:**
**I... | null | Linked List | Medium | 206 |
1,603 | hey there and welcome back to another Elite code video so today the problem of the day is design parking system and we're designing a system for parking lot it has three kinds of spaces big medium small with a fixed number of slots for each size and come with the park system cap class initialize the object of the park ... | Design Parking System | running-sum-of-1d-array | Design a parking system for a parking lot. The parking lot has three kinds of parking spaces: big, medium, and small, with a fixed number of slots for each size.
Implement the `ParkingSystem` class:
* `ParkingSystem(int big, int medium, int small)` Initializes object of the `ParkingSystem` class. The number of slot... | Think about how we can calculate the i-th number in the running sum from the (i-1)-th number. | Array,Prefix Sum | Easy | null |
1,662 | hello hi guys good morning welcome back to the new video I hope that you guys are doing good problem check if two string arrays are equivalent now this has been asked by Apple and Facebook um it's an easy question but it's just that if you solve it optimally cool let's see the problem St what the problem States uh it s... | Check If Two String Arrays are Equivalent | minimum-numbers-of-function-calls-to-make-target-array | Given two string arrays `word1` and `word2`, return `true` _if the two arrays **represent** the same string, and_ `false` _otherwise._
A string is **represented** by an array if the array elements concatenated **in order** forms the string.
**Example 1:**
**Input:** word1 = \[ "ab ", "c "\], word2 = \[ "a ", "bc "... | Work backwards: try to go from nums to arr. You should try to divide by 2 as much as possible, but you can only divide by 2 if everything is even. | Array,Greedy | Medium | null |
319 | Hello gas I am Lalita Agarwal welcome to those coding channel advice so let's start today this lead card problem aaj ki let's problem kya bol rahi hai achcha before going towards d problem na 1 m session par dose inko problem achhe se understand a Whatever else is left to do, there are six remaining questions. Look, th... | Bulb Switcher | bulb-switcher | There are `n` bulbs that are initially off. You first turn on all the bulbs, then you turn off every second bulb.
On the third round, you toggle every third bulb (turning on if it's off or turning off if it's on). For the `ith` round, you toggle every `i` bulb. For the `nth` round, you only toggle the last bulb.
Retu... | null | Math,Brainteaser | Medium | 672,1037,1491 |
389 | hi welcome guys welcome to my little song in section so this is uh 389 find a difference hope you guys subscribe to my channel so you given uh snt and is generated by rendering shuffle s and add one is important one more letter in a random position and return that the ladder so if you ste so more e and uh the there's a... | Find the Difference | find-the-difference | You are given two strings `s` and `t`.
String `t` is generated by random shuffling string `s` and then add one more letter at a random position.
Return the letter that was added to `t`.
**Example 1:**
**Input:** s = "abcd ", t = "abcde "
**Output:** "e "
**Explanation:** 'e' is the letter that was added.
**Exam... | null | Hash Table,String,Bit Manipulation,Sorting | Easy | 136 |
213 | Hello everyone welcome to our coders in this video we are going to do our blind 75 lead code problem number 22 and our dynamic programming problem number eight which is house rubber problem two let's go to our problem and Let's see what is our today's problem. Our today's problem is house rubber you are a professional ... | House Robber II | house-robber-ii | You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are **arranged in a circle.** That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and **it will automatical... | Since House[1] and House[n] are adjacent, they cannot be robbed together. Therefore, the problem becomes to rob either House[1]-House[n-1] or House[2]-House[n], depending on which choice offers more money. Now the problem has degenerated to the House Robber, which is already been solved. | Array,Dynamic Programming | Medium | 198,256,276,337,600,656 |
1,609 | hey everyone welcome back and let's write some more neat code today so today let's solve the problem even odd tree we're given a binary tree and we want to know if it satisfies the conditions of being even odd the first one isn't really a condition in my opinion it's more of just defining like what a level in a tree is... | Even Odd Tree | find-all-the-lonely-nodes | A binary tree is named **Even-Odd** if it meets the following conditions:
* The root of the binary tree is at level index `0`, its children are at level index `1`, their children are at level index `2`, etc.
* For every **even-indexed** level, all nodes at the level have **odd** integer values in **strictly increa... | Do a simple tree traversal, try to check if the current node is lonely or not. Node is lonely if at least one of the left/right pointers is null. | Tree,Depth-First Search,Breadth-First Search,Binary Tree | Easy | 563,1005 |
1,007 | hello everyone welcome to day 28th of march eco challenge and i hope all of you are having a great time today's solution would be 613 solution of the lead code daily contest and the question that we have in today's minimum domino rotations for equal row here in this question we are given n dominoes wherein we are given... | Minimum Domino Rotations For Equal Row | numbers-with-same-consecutive-differences | In a row of dominoes, `tops[i]` and `bottoms[i]` represent the top and bottom halves of the `ith` domino. (A domino is a tile with two numbers from 1 to 6 - one on each half of the tile.)
We may rotate the `ith` domino, so that `tops[i]` and `bottoms[i]` swap values.
Return the minimum number of rotations so that all... | null | Backtracking,Breadth-First Search | Medium | null |
1,679 | That today we are going to do the question about the maximum number of sums. This means that it is okay to tell us the maximum number of numbers by adding them. This is a very similar question of tourism. If you have not seen the tuition video, I will tell you. I am sure that you have watched the tuition video which we... | Max Number of K-Sum Pairs | shortest-subarray-to-be-removed-to-make-array-sorted | You are given an integer array `nums` and an integer `k`.
In one operation, you can pick two numbers from the array whose sum equals `k` and remove them from the array.
Return _the maximum number of operations you can perform on the array_.
**Example 1:**
**Input:** nums = \[1,2,3,4\], k = 5
**Output:** 2
**Explana... | The key is to find the longest non-decreasing subarray starting with the first element or ending with the last element, respectively. After removing some subarray, the result is the concatenation of a sorted prefix and a sorted suffix, where the last element of the prefix is smaller than the first element of the suffix... | Array,Two Pointers,Binary Search,Stack,Monotonic Stack | Medium | null |
92 | hello everyone today let's see how to solve the reverse link list to problem so we're given a linked list and we are given two questions left and right so for this example they are given left equal to and write equal to 4 so second left is the element in second position one two so this is left and right is the element ... | Reverse Linked List II | reverse-linked-list-ii | Given the `head` of a singly linked list and two integers `left` and `right` where `left <= right`, reverse the nodes of the list from position `left` to position `right`, and return _the reversed list_.
**Example 1:**
**Input:** head = \[1,2,3,4,5\], left = 2, right = 4
**Output:** \[1,4,3,2,5\]
**Example 2:**
**I... | null | Linked List | Medium | 206 |
1,721 | foreign from the end the list is one minus index okay so kth node so it is the input one two three four five and K is 2 eighth note from the beginning to K92 second note from the end second note is four it will be replaced 4 and 2. okay same way but this is less than five one two three five seven then one two three fou... | Swapping Nodes in a Linked List | maximum-profit-of-operating-a-centennial-wheel | You are given the `head` of a linked list, and an integer `k`.
Return _the head of the linked list after **swapping** the values of the_ `kth` _node from the beginning and the_ `kth` _node from the end (the list is **1-indexed**)._
**Example 1:**
**Input:** head = \[1,2,3,4,5\], k = 2
**Output:** \[1,4,3,2,5\]
**Ex... | Think simulation Note that the number of turns will never be more than 50 / 4 * n | Array,Simulation | Medium | null |
95 | hello everyone and welcome back to another video so today we're going to be solving the lead code question unique binary search tree 2. all right so in this question we're going to be given an integer n where the goal is to return all structurally unique binary search trees which has exactly n nodes of unique values fr... | Unique Binary Search Trees II | unique-binary-search-trees-ii | Given an integer `n`, return _all the structurally unique **BST'**s (binary search trees), which has exactly_ `n` _nodes of unique values from_ `1` _to_ `n`. Return the answer in **any order**.
**Example 1:**
**Input:** n = 3
**Output:** \[\[1,null,2,null,3\],\[1,null,3,2\],\[2,1,3\],\[3,1,null,null,2\],\[3,2,null,1\... | null | Dynamic Programming,Backtracking,Tree,Binary Search Tree,Binary Tree | Medium | 96,241 |
44 | yeah all right guys and welcome to the second part of the wildcard matching and this part will deal with uh bottom-up bottom-up bottom-up dynamic programming and which is also called tabulation so let's jump right in and with a recap of wild card matching so the task was that you're given two strings and one of which i... | Wildcard Matching | wildcard-matching | Given an input string (`s`) and a pattern (`p`), implement wildcard pattern matching with support for `'?'` and `'*'` where:
* `'?'` Matches any single character.
* `'*'` Matches any sequence of characters (including the empty sequence).
The matching should cover the **entire** input string (not partial).
**Exam... | null | String,Dynamic Programming,Greedy,Recursion | Hard | 10 |
207 | welcome back to agujes today's question is leak code 207 course schedule so there are a total number of courses you have to take labeled from zero to num courses minus one you're given an array of prerequisites where prerequisites i a b indicates that you must take course B before course a so if we have zeros and ones ... | Course Schedule | course-schedule | There are a total of `numCourses` courses you have to take, labeled from `0` to `numCourses - 1`. You are given an array `prerequisites` where `prerequisites[i] = [ai, bi]` indicates that you **must** take course `bi` first if you want to take course `ai`.
* For example, the pair `[0, 1]`, indicates that to take cou... | This problem is equivalent to finding if a cycle exists in a directed graph. If a cycle exists, no topological ordering exists and therefore it will be impossible to take all courses. Topological Sort via DFS - A great video tutorial (21 minutes) on Coursera explaining the basic concepts of Topological Sort. Topologica... | Depth-First Search,Breadth-First Search,Graph,Topological Sort | Medium | 210,261,310,630 |
2 | today we are looking at lead code number two it's called add two numbers um so this is a tricky problem in the sense that you really have to look at the um prompt you could go down one path and end up finding out that was the wrong way to go if you don't really kind of clear clearly read what this problem is asking and... | Add Two Numbers | add-two-numbers | You are given two **non-empty** linked lists representing two non-negative integers. The digits are stored in **reverse order**, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 ... | null | Linked List,Math,Recursion | Medium | 43,67,371,415,445,1031,1774 |
1,921 | Hello everyone welcome to my channel Quote Sorry with Mike So today I am going to do video number 21 of my greedy playlist. The lead is marked number 1921 medium but it is quite an easy question actually it is fine. Let me explain to you the name of the question. Eliminate maximum number of monsters is a very famous ca... | Eliminate Maximum Number of Monsters | eliminate-maximum-number-of-monsters | You are playing a video game where you are defending your city from a group of `n` monsters. You are given a **0-indexed** integer array `dist` of size `n`, where `dist[i]` is the **initial distance** in kilometers of the `ith` monster from the city.
The monsters walk toward the city at a **constant** speed. The speed... | null | null | Medium | null |
230 | hello everyone my name is alvaro and in this video i will be solving another problem from the blind lead code 75 problem list today i will be solving problem 230 which is called kate's smallest element in a binary search tree so let's get to read the problem statement given the root of a binary search tree and an integ... | Kth Smallest Element in a BST | kth-smallest-element-in-a-bst | Given the `root` of a binary search tree, and an integer `k`, return _the_ `kth` _smallest value (**1-indexed**) of all the values of the nodes in the tree_.
**Example 1:**
**Input:** root = \[3,1,4,null,2\], k = 1
**Output:** 1
**Example 2:**
**Input:** root = \[5,3,6,2,4,null,null,1\], k = 3
**Output:** 3
**Cons... | Try to utilize the property of a BST. Try in-order traversal. (Credits to @chan13) What if you could modify the BST node's structure? The optimal runtime complexity is O(height of BST). | Tree,Depth-First Search,Binary Search Tree,Binary Tree | Medium | 94,671 |
1,918 | hey everybody this is Larry this is me doing extra Alo problem to get my money's worth on premium I hope you like it hit the like button hit the Subscribe button join me on Discord let me know what you think about this one is an RNG problem and today we have 1918 C smallest Subway sum and this is a not a premium proble... | Kth Smallest Subarray Sum | maximum-score-of-a-good-subarray | Given an integer array `nums` of length `n` and an integer `k`, return _the_ `kth` _**smallest subarray sum**._
A **subarray** is defined as a **non-empty** contiguous sequence of elements in an array. A **subarray sum** is the sum of all elements in the subarray.
**Example 1:**
**Input:** nums = \[2,1,3\], k = 4
**... | Try thinking about the prefix before index k and the suffix after index k as two separate arrays. Using two pointers or binary search, we can find the maximum prefix of each array where the numbers are less than or equal to a certain value | Array,Two Pointers,Binary Search,Stack,Monotonic Stack | Hard | 84 |
138 | Hello hi friends welcome to episode 123 and first series now this is this top emergency now the questions that are going to come share with friends any actress's birds are very frequently of interviews don't give questions these questions have to be done definitely okay So that shades copy less random but again is a ve... | Copy List with Random Pointer | copy-list-with-random-pointer | A linked list of length `n` is given such that each node contains an additional random pointer, which could point to any node in the list, or `null`.
Construct a [**deep copy**](https://en.wikipedia.org/wiki/Object_copying#Deep_copy) of the list. The deep copy should consist of exactly `n` **brand new** nodes, where e... | Just iterate the linked list and create copies of the nodes on the go. Since a node can be referenced from multiple nodes due to the random pointers, make sure you are not making multiple copies of the same node. You may want to use extra space to keep old node ---> new node mapping to prevent creating multiples copies... | Hash Table,Linked List | Medium | 133,1624,1634 |
855 | Hello gas welcome to my YouTube channel, today we will try to set the exam room in D state, maximum seat number is 0, so if multiple students come and sit in it, then we have to seat such students so that the distance which is being input to us first, then I am at zero only. I am sitting like this, I have to set the ma... | Exam Room | count-unique-characters-of-all-substrings-of-a-given-string | There is an exam room with `n` seats in a single row labeled from `0` to `n - 1`.
When a student enters the room, they must sit in the seat that maximizes the distance to the closest person. If there are multiple such seats, they sit in the seat with the lowest number. If no one is in the room, then the student sits a... | null | String,Dynamic Programming | Hard | null |
374 | hello to the let's talk about a guess number higher or lower so basically you have to use the function of guess to know if your guess number is higher or lower right or equal so negative one represent higher one represent lower zero percent equal and basically you can use fabric so you can actually use a linear like us... | Guess Number Higher or Lower | guess-number-higher-or-lower | We are playing the Guess Game. The game is as follows:
I pick a number from `1` to `n`. You have to guess which number I picked.
Every time you guess wrong, I will tell you whether the number I picked is higher or lower than your guess.
You call a pre-defined API `int guess(int num)`, which returns three possible re... | null | Binary Search,Interactive | Easy | 278,375,658 |
1,094 | Hello Hi Guys Welcome Interesting Video Day Robbers Car Pooling Members and Delhi Challenge Today Only School Government Science Subject When Skirts The Best and Worst Passengers by Distance and Tours Numbers of Senses Mind and Soul Who Represent a Prominent Location Kilometers from All Passengers Subscribe 158 Hai So ... | Car Pooling | matrix-cells-in-distance-order | There is a car with `capacity` empty seats. The vehicle only drives east (i.e., it cannot turn around and drive west).
You are given the integer `capacity` and an array `trips` where `trips[i] = [numPassengersi, fromi, toi]` indicates that the `ith` trip has `numPassengersi` passengers and the locations to pick them u... | null | Array,Math,Geometry,Sorting,Matrix | Easy | 2304 |
242 | hey everyone so today we're going to be solving leak code 242 valid integram given two strings s and t return true if T is an anagram of s and false otherwise so an anagram is a word or phrase form by rearranging the letters of a different order phrase using all the original letters only once so to break down this prob... | Valid Anagram | valid-anagram | Given two strings `s` and `t`, return `true` _if_ `t` _is an anagram of_ `s`_, and_ `false` _otherwise_.
An **Anagram** is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.
**Example 1:**
**Input:** s = "anagram", t = "nagaram"
**... | null | Hash Table,String,Sorting | Easy | 49,266,438 |
287 | Hello everyone Chirag this side and in today's video we will do our problem number 287 which is find d duplicate number this is a medium level problem so let's discuss the question first question what is given and are of integer numbers continue n+ 1 inteasers where h wait is numbers continue n+ 1 inteasers where h wai... | Find the Duplicate Number | find-the-duplicate-number | Given an array of integers `nums` containing `n + 1` integers where each integer is in the range `[1, n]` inclusive.
There is only **one repeated number** in `nums`, return _this repeated number_.
You must solve the problem **without** modifying the array `nums` and uses only constant extra space.
**Example 1:**
**... | null | Array,Two Pointers,Binary Search,Bit Manipulation | Medium | 41,136,142,268,645 |
797 | hello guys welcome to code enzyme and in this video we are going to discuss the problem 797 of lead code all pairs from source to Target so let's read the problem statement given a directed acyclic graph dag of nodes labeled from 0 to n minus 1. find all the paths from 0 to node n minus 1 and return them in any order t... | All Paths From Source to Target | rabbits-in-forest | Given a directed acyclic graph (**DAG**) of `n` nodes labeled from `0` to `n - 1`, find all possible paths from node `0` to node `n - 1` and return them in **any order**.
The graph is given as follows: `graph[i]` is a list of all nodes you can visit from node `i` (i.e., there is a directed edge from node `i` to node `... | null | Array,Hash Table,Math,Greedy | Medium | null |
1,805 | I'll be solving number of different integers in a string and there's multiple ways and there's like a really simple way that you use regular expression but I'll now be using regular expression in my first approach so the basic idea is that we want to iterate through our pointer it's going to iterate through everything ... | Number of Different Integers in a String | minimum-adjacent-swaps-for-k-consecutive-ones | You are given a string `word` that consists of digits and lowercase English letters.
You will replace every non-digit character with a space. For example, `"a123bc34d8ef34 "` will become `" 123 34 8 34 "`. Notice that you are left with some integers that are separated by at least one space: `"123 "`, `"34 "`, `"8 "`, ... | Choose k 1s and determine how many steps are required to move them into 1 group. Maintain a sliding window of k 1s, and maintain the steps required to group them. When you slide the window across, should you move the group to the right? Once you move the group to the right, it will never need to slide to the left again... | Array,Greedy,Sliding Window,Prefix Sum | Hard | 1107,2119 |
51 | yes today I'll be solving on number Tijuana nickel called n-queens and the Tijuana nickel called n-queens and the Tijuana nickel called n-queens and the politics that the N Queens problem puzzle is the problem or placing N Queens on an N by n chess board such that no two queens are attacking each other so given the int... | N-Queens | n-queens | The **n-queens** puzzle is the problem of placing `n` queens on an `n x n` chessboard such that no two queens attack each other.
Given an integer `n`, return _all distinct solutions to the **n-queens puzzle**_. You may return the answer in **any order**.
Each solution contains a distinct board configuration of the n-... | null | Array,Backtracking | Hard | 52,1043 |
1,979 | hello guys my name is arsalan welcome back to my Channel today we will be solving a new report question that is fine greatest common divisors of array we will be following this question with the help of JavaScript so let's read out the question and the question says given an integer Arena return the greatest common dev... | Find Greatest Common Divisor of Array | maximum-number-of-people-that-can-be-caught-in-tag | Given an integer array `nums`, return _the **greatest common divisor** of the smallest number and largest number in_ `nums`.
The **greatest common divisor** of two numbers is the largest positive integer that evenly divides both numbers.
**Example 1:**
**Input:** nums = \[2,5,6,9,10\]
**Output:** 2
**Explanation:**
... | Try to use as much of the range of a person who is "it" as possible. Find the leftmost person who is "it" that has not caught anyone yet, and the leftmost person who is not "it" that has not been caught yet. If the person who is not "it" can be caught, pair them together and repeat the process. If the person who is not... | Array,Greedy | Medium | 2191 |
204 | hey everyone uh in this video we are gonna be solving this lead code problem 2 0 for count primes so let's see what is the problem given it is said given an integer n written the number of prime numbers that are strictly less than n so essentially we are given a number and we have to return the number of primes present... | Count Primes | count-primes | Given an integer `n`, return _the number of prime numbers that are strictly less than_ `n`.
**Example 1:**
**Input:** n = 10
**Output:** 4
**Explanation:** There are 4 prime numbers less than 10, they are 2, 3, 5, 7.
**Example 2:**
**Input:** n = 0
**Output:** 0
**Example 3:**
**Input:** n = 1
**Output:** 0
**Co... | Let's start with a isPrime function. To determine if a number is prime, we need to check if it is not divisible by any number less than n. The runtime complexity of isPrime function would be O(n) and hence counting the total prime numbers up to n would be O(n2). Could we do better? As we know the number must not be div... | Array,Math,Enumeration,Number Theory | Medium | 263,264,279 |
695 | welcome to june's leeco challenge today's problem is max area of island you are given an m times n binary matrix grid an island is a group of ones representing land connected four directionally horizontal or vertical you may assume all four edges of the grid are surrounded by water so zero is water and one is land now ... | Max Area of Island | max-area-of-island | You are given an `m x n` binary matrix `grid`. An island is a group of `1`'s (representing land) connected **4-directionally** (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.
The **area** of an island is the number of cells with a value `1` in the island.
Return _the maxim... | null | Array,Depth-First Search,Breadth-First Search,Union Find,Matrix | Medium | 200,463,1845,2206 |
1,862 | hello everyone welcome to our channel code with sunny and in this video i will be talking about the question the sum of load pairs index number is 1862 and the problem in the one of the hard problems of the lead code okay so this problem is actually the interesting one it requires the basically mathematical approach an... | Sum of Floored Pairs | count-apples-and-oranges | Given an integer array `nums`, return the sum of `floor(nums[i] / nums[j])` for all pairs of indices `0 <= i, j < nums.length` in the array. Since the answer may be too large, return it **modulo** `109 + 7`.
The `floor()` function returns the integer part of the division.
**Example 1:**
**Input:** nums = \[2,5,9\]
*... | null | Database | Medium | null |
905 | so today's problem is an easy level problem number 905 also called as sort array by parity now the question is saying that we are given an integer array nums and we need to move all integers to the beginning of the array and followed by all the order integers now and we need to return an array that satisfies this condi... | Sort Array By Parity | length-of-longest-fibonacci-subsequence | Given an integer array `nums`, move all the even integers at the beginning of the array followed by all the odd integers.
Return _**any array** that satisfies this condition_.
**Example 1:**
**Input:** nums = \[3,1,2,4\]
**Output:** \[2,4,3,1\]
**Explanation:** The outputs \[4,2,3,1\], \[2,4,1,3\], and \[4,2,1,3\] w... | null | Array,Hash Table,Dynamic Programming | Medium | 1013 |
1,915 | hey everybody this is larry this is me going with q3 of the weekly contest 247 number of wonderful substrings so this one is tricky uh hit the like button hit the subscribe button join me in discord let me know what you think about this problem in general so this one there are so the key thing to know is that there are... | Number of Wonderful Substrings | check-if-one-string-swap-can-make-strings-equal | A **wonderful** string is a string where **at most one** letter appears an **odd** number of times.
* For example, `"ccjjc "` and `"abab "` are wonderful, but `"ab "` is not.
Given a string `word` that consists of the first ten lowercase English letters (`'a'` through `'j'`), return _the **number of wonderful non-e... | The answer is false if the number of nonequal positions in the strings is not equal to 0 or 2. Check that these positions have the same set of characters. | Hash Table,String,Counting | Easy | 889 |
213 | hey guys welcome back to another video and today we're going to be solving the leakout question house robber 2. all right so in this question we are a professional robber and we plan to rob houses along the street and each house has a certain amount of money stashed all houses in this place are arranged in a circle so ... | House Robber II | house-robber-ii | You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are **arranged in a circle.** That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and **it will automatical... | Since House[1] and House[n] are adjacent, they cannot be robbed together. Therefore, the problem becomes to rob either House[1]-House[n-1] or House[2]-House[n], depending on which choice offers more money. Now the problem has degenerated to the House Robber, which is already been solved. | Array,Dynamic Programming | Medium | 198,256,276,337,600,656 |
342 | welcome to august leeco challenge today's problem is power of four given an integer sign 32 bits write a function to check whether it is a power of four and notice it's a power of four not a multiple of four and up would be to do it without loops or recursion but let's start by doing it with a loop just so that we can ... | Power of Four | power-of-four | Given an integer `n`, return _`true` if it is a power of four. Otherwise, return `false`_.
An integer `n` is a power of four, if there exists an integer `x` such that `n == 4x`.
**Example 1:**
**Input:** n = 16
**Output:** true
**Example 2:**
**Input:** n = 5
**Output:** false
**Example 3:**
**Input:** n = 1
**O... | null | Math,Bit Manipulation,Recursion | Easy | 231,326 |
451 | hey hello there so today sleep coding challenge Christina sword characters by frequency we have an input string and we need to sort the string and the descending order based on the frequencies of the characters example we have the infrastructure you need characters TR and E t appear ones are appear ones e has a frequen... | Sort Characters By Frequency | sort-characters-by-frequency | Given a string `s`, sort it in **decreasing order** based on the **frequency** of the characters. The **frequency** of a character is the number of times it appears in the string.
Return _the sorted string_. If there are multiple answers, return _any of them_.
**Example 1:**
**Input:** s = "tree "
**Output:** "eer... | null | Hash Table,String,Sorting,Heap (Priority Queue),Bucket Sort,Counting | Medium | 347,387,1741 |
94 | hey guys persistent programmer here and welcome back to my channel so in this channel we solve a lot of algorithms and go over legal questions so if you haven't subscribed already go ahead and hit the subscribe button smash that like button because that helps me create this content for you guys so without further ado l... | Binary Tree Inorder Traversal | binary-tree-inorder-traversal | Given the `root` of a binary tree, return _the inorder traversal of its nodes' values_.
**Example 1:**
**Input:** root = \[1,null,2,3\]
**Output:** \[1,3,2\]
**Example 2:**
**Input:** root = \[\]
**Output:** \[\]
**Example 3:**
**Input:** root = \[1\]
**Output:** \[1\]
**Constraints:**
* The number of nodes i... | null | Stack,Tree,Depth-First Search,Binary Tree | Easy | 98,144,145,173,230,272,285,758,799 |
152 | Set A Girl Saw This Question Maximum Product Time To Solve This Question Is We Will Have Any Life Now We Will Be Into This And Related To This In The Meantime America Product Maximum Level Has To Be Returned America's Product Maximum Level Has To Be Returned So This Time Subscribe - - Subscribe - - Subscribe - - 08 Thi... | Maximum Product Subarray | maximum-product-subarray | Given an integer array `nums`, find a subarray that has the largest product, and return _the product_.
The test cases are generated so that the answer will fit in a **32-bit** integer.
**Example 1:**
**Input:** nums = \[2,3,-2,4\]
**Output:** 6
**Explanation:** \[2,3\] has the largest product 6.
**Example 2:**
**I... | null | Array,Dynamic Programming | Medium | 53,198,238,628,713 |
1,678 | all right so let's talk about the powerful interpretation so basically like this is the idea so if you see g then you have to add character g into the string and if you see the opening and closing currency you have to just pan the character all into the string and if you see the opening kl closing and you just have to ... | Goal Parser Interpretation | number-of-ways-to-split-a-string | You own a **Goal Parser** that can interpret a string `command`. The `command` consists of an alphabet of `"G "`, `"() "` and/or `"(al) "` in some order. The Goal Parser will interpret `"G "` as the string `"G "`, `"() "` as the string `"o "`, and `"(al) "` as the string `"al "`. The interpreted strings are then concat... | There is no way if the sum (number of '1's) is not divisible by the number of splits. So sum%3 should be 0. Preffix s1 , and suffix s3 should have sum/3 characters '1'. Follow up: Can you generalize the problem with numbers between [-10^9, 10^9] such the sum between subarrays s1, s2, s3 are the same? | Math,String | Medium | 548 |
315 | foreign and sorry for the in the previous seven days I have not been not around to the lead code because my health is not good so I am preparing for the previous one first I have been uploading this question and after solving and then after that I will upload that the previous uh problem which is in a week scheduled th... | Count of Smaller Numbers After Self | count-of-smaller-numbers-after-self | Given an integer array `nums`, return _an integer array_ `counts` _where_ `counts[i]` _is the number of smaller elements to the right of_ `nums[i]`.
**Example 1:**
**Input:** nums = \[5,2,6,1\]
**Output:** \[2,1,1,0\]
**Explanation:**
To the right of 5 there are **2** smaller elements (2 and 1).
To the right of 2 the... | null | Array,Binary Search,Divide and Conquer,Binary Indexed Tree,Segment Tree,Merge Sort,Ordered Set | Hard | 327,406,493,1482,2280 |
966 | hello everyone welcome to day 22nd of march eco channel and today's question is vowel spell checker in this question we are given a list of words and a set of queries we need to tell whether the queries matches with any of these words or not and there are few rules that we can we have to use while checking whether the ... | Vowel Spellchecker | binary-subarrays-with-sum | Given a `wordlist`, we want to implement a spellchecker that converts a query word into a correct word.
For a given `query` word, the spell checker handles two categories of spelling mistakes:
* Capitalization: If the query matches a word in the wordlist (**case-insensitive**), then the query word is returned with ... | null | Array,Hash Table,Sliding Window,Prefix Sum | Medium | null |
901 | hey everybody this is Larry let's get this started hit the like button hit the subscribe button and let me know what you think how did you do let's go let's get this going why the class stock spanner which collects daily price codes for some stocks and we turn the span of that stocks price for the current day the span ... | Online Stock Span | advantage-shuffle | Design an algorithm that collects daily price quotes for some stock and returns **the span** of that stock's price for the current day.
The **span** of the stock's price in one day is the maximum number of consecutive days (starting from that day and going backward) for which the stock price was less than or equal to ... | null | Array,Greedy,Sorting | Medium | null |
1,760 | hey what's up guys this is jung here so today uh let's take a look at a 1760 minimum limit of boss in the back so you're given like integer array numbers right where uh the ice element contains uh this number of bars and you also have like this kind of integer of max operations and you can perform the following operati... | Minimum Limit of Balls in a Bag | check-array-formation-through-concatenation | You are given an integer array `nums` where the `ith` bag contains `nums[i]` balls. You are also given an integer `maxOperations`.
You can perform the following operation at most `maxOperations` times:
* Take any bag of balls and divide it into two new bags with a **positive** number of balls.
* For example, ... | Note that the distinct part means that every position in the array belongs to only one piece Note that you can get the piece every position belongs to naively | Array,Hash Table | Easy | null |
221 | hello everyone today we are going to solve the lead code question number 221 maximum Square given an M cross n binary Matrix filled with zeros and ones find the largest Square containing only once and return its area we are given an example here which has the list of on and zeros in this Matrix we have two large square... | Maximal Square | maximal-square | Given an `m x n` binary `matrix` filled with `0`'s and `1`'s, _find the largest square containing only_ `1`'s _and return its area_.
**Example 1:**
**Input:** matrix = \[\[ "1 ", "0 ", "1 ", "0 ", "0 "\],\[ "1 ", "0 ", "1 ", "1 ", "1 "\],\[ "1 ", "1 ", "1 ", "1 ", "1 "\],\[ "1 ", "0 ", "0 ", "1 ", "0 "\]\]
**Output:*... | null | Array,Dynamic Programming,Matrix | Medium | 85,769,1312,2200 |
53 | if y'all come back to the channel I hope you guys are doing extremely well so this is another video from the stripers A to Z DSA course just in case you're for the first time here this is world's most in-depth course when it comes to DS most in-depth course when it comes to DS most in-depth course when it comes to DS a... | Maximum Subarray | maximum-subarray | Given an integer array `nums`, find the subarray with the largest sum, and return _its sum_.
**Example 1:**
**Input:** nums = \[-2,1,-3,4,-1,2,1,-5,4\]
**Output:** 6
**Explanation:** The subarray \[4,-1,2,1\] has the largest sum 6.
**Example 2:**
**Input:** nums = \[1\]
**Output:** 1
**Explanation:** The subarray \... | null | Array,Divide and Conquer,Dynamic Programming | Easy | 121,152,697,1020,1849,1893 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.