https://leetcode.com/problems/continuous-subarrays/description/
Count subarrays with difference <= 2 #medium #monotonic_queue #tree_set
Count subarrays with difference <= 2 #medium #monotonic_queue #tree_set
🔥2👍1
https://leetcode.com/problems/maximum-average-pass-ratio/description/
Arrange
Arrange
passed
students to improve average score #medium #heap👍2
https://leetcode.com/problems/construct-string-with-repeat-limit/description/
Max lexical ordered with
Max lexical ordered with
repeat_limit
string #medium #bucket_sort👍4
https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/description/
Subtract next smaller value #easy #monotonic_stack
Subtract next smaller value #easy #monotonic_stack
👍2
https://leetcode.com/problems/max-chunks-to-make-sorted/description/
Maximum independent chunks to merge-sort array #medium
Maximum independent chunks to merge-sort array #medium
👍2
https://leetcode.com/problems/reverse-odd-levels-of-binary-tree/description/
Odd-levels reversal in a perfect tree #medium #dfs #bfs #tree
Odd-levels reversal in a perfect tree #medium #dfs #bfs #tree
👍2
https://leetcode.com/problems/maximum-number-of-k-divisible-components/description/
Max connected components divisible by
Max connected components divisible by
k
in graph #hard #toposort👍3
https://leetcode.com/problems/find-building-where-alice-and-bob-can-meet/description/
Common indices t, h[t] > h[a], h[t] > h[b] for queries q[][a,b] #hard #monotonic_stack
Common indices t, h[t] > h[a], h[t] > h[b] for queries q[][a,b] #hard #monotonic_stack
👍3
https://leetcode.com/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level/description/
Min swaps to sort tree layers #medium #cycle-sort #bfs
Min swaps to sort tree layers #medium #cycle-sort #bfs
👍3
https://leetcode.com/problems/find-minimum-diameter-after-merging-two-trees/description/
Diameter of 2 connected trees #hard #graph #toposort
Diameter of 2 connected trees #hard #graph #toposort
👍4
https://leetcode.com/problems/target-sum/description/
Count signs permutations to sum equal target #medium #dynamic_programming
Count signs permutations to sum equal target #medium #dynamic_programming
👍1
https://leetcode.com/problems/best-sightseeing-pair/description/
Max (a[i] + a[j] + i - j), i > j #medium #arithmetics
Max (a[i] + a[j] + i - j), i > j #medium #arithmetics
👍3
https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/description/
3 max non-intersecting intervals #hard #dynamic_programming #sliding_window
3 max non-intersecting intervals #hard #dynamic_programming #sliding_window
👍2
https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary/description/
Ways to make target with increasing positions in words #hard #dynamic_programming
Ways to make target with increasing positions in words #hard #dynamic_programming
👍2
https://leetcode.com/problems/count-ways-to-build-good-strings/description/
Ways to make
Ways to make
01
-string length of low..high
#medium #dynamic_programming👍2
https://leetcode.com/problems/minimum-cost-for-tickets/description/
Min sum buying 1,7,30-days tickets to travel all days #medium #dymanic_programming
Min sum buying 1,7,30-days tickets to travel all days #medium #dymanic_programming
🎄4
This media is not supported in your browser
VIEW IN TELEGRAM
Anything you will do on a daily basis will gain x365 improvement.
Here is my post from 1 year ago https://t.me/leetcode_daily_unstoppable/456
Happy new year 🎄
Here is my post from 1 year ago https://t.me/leetcode_daily_unstoppable/456
Happy new year 🎄
🔥9👏2⚡1🫡1
https://leetcode.com/problems/maximum-score-after-splitting-a-string/description/
Max(left_zeros + right_ones) #easy
Max(left_zeros + right_ones) #easy
👍3
https://leetcode.com/problems/count-vowel-strings-in-ranges/description/
Count words[q[0]..q[1]] starting and ending with "aeiou" #medium
Count words[q[0]..q[1]] starting and ending with "aeiou" #medium
👍2