https://leetcode.com/problems/furthest-building-you-can-reach/description
Max index to climb
Max index to climb
diff = a[i +1] - a[i] > 0
using bricks -= diff
and ladders--
for each.ð3
https://leetcode.com/problems/meeting-rooms-iii/description
Most frequent room of
Most frequent room of
0..<n
where each meeting[i]=[start, end)
takes or delays until first available.ð2
This media is not supported in your browser
VIEW IN TELEGRAM
Congrats for all the earners!
ðĨ3ð1ðŦĄ1
https://leetcode.com/problems/bitwise-and-of-numbers-range/description
Bitwise AND for [left..right].
Bitwise AND for [left..right].
ð2ðĪ1
https://leetcode.com/problems/find-the-town-judge/description/
Find who trusts nobody and everybody trusts him in
Find who trusts nobody and everybody trusts him in
[trust, trusted]
array.ð2
https://leetcode.com/problems/cheapest-flights-within-k-stops/description/
Cheapest travel
Cheapest travel
src -> dst
with at most k
stops in a directed weighted graph.ð2
https://leetcode.com/problems/find-all-people-with-secret/description/
Who knows
Who knows
0
and firstPerson
's secret after group meetings at times: [personA, personB, time]
.ð2
https://leetcode.com/problems/greatest-common-divisor-traversal/description/
Are all numbers connected through
Are all numbers connected through
gcd
?ð2
https://leetcode.com/problems/diameter-of-binary-tree/description/
Max distance between any nodes in binary tree.
Max distance between any nodes in binary tree.
ð3
https://leetcode.com/problems/find-bottom-left-tree-value/description/
Leftmost node value of the last level of the Binary Tree.
Leftmost node value of the last level of the Binary Tree.
ð3
https://leetcode.com/problems/even-odd-tree/description/
Binary tree levels are odd increasing and even decreasing.
Binary tree levels are odd increasing and even decreasing.
ð3
This media is not supported in your browser
VIEW IN TELEGRAM
still not to late to celebrate
ðĨ3ð1
https://leetcode.com/problems/maximum-odd-binary-number/description/
Max odd number string rearrangement.
Max odd number string rearrangement.
ð2
https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/
Remove `n`th node from the tail of linked list. #medium
Remove `n`th node from the tail of linked list. #medium
ð4
https://leetcode.com/problems/bag-of-tokens/description/
Max
Max
score
converting power
to token[i]
and token[i]
to score
. #mediumð3
https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/description/
Min length after trimming matching prefix-suffix several times. #medium
Min length after trimming matching prefix-suffix several times. #medium
ð2