#140

  Рет қаралды 2,480

Placements Ready with Avinash

Placements Ready with Avinash

Күн бұрын

Пікірлер: 9
@siddharth_helloworld1292
@siddharth_helloworld1292 10 ай бұрын
expected time complexity is O(n*k), your time complexity is O(n*(n*log(n) + k)), is thereany faster approach ?
@ShivamSingh-xv4rw
@ShivamSingh-xv4rw 10 ай бұрын
Runtime error de rha after 1070 test case
@PlacementsReady
@PlacementsReady 10 ай бұрын
bro i couldn't check that because of the compilation issue at geeksforgeeks end hope u got it correct
@ShivamSingh-xv4rw
@ShivamSingh-xv4rw 10 ай бұрын
@@PlacementsReady give us code again using priority queue if you can
@siddharth_helloworld1292
@siddharth_helloworld1292 10 ай бұрын
tle aaraha bhai ye apprach se
@PlacementsReady
@PlacementsReady 10 ай бұрын
Can you try once using priority queues
@indrajeetdevre1296
@indrajeetdevre1296 10 ай бұрын
bhai itna accha video banaya, thoda awaj bhi de deta.
@PlacementsReady
@PlacementsReady 10 ай бұрын
Will improve from next set of videos.
@stopmotion2739
@stopmotion2739 10 ай бұрын
Solution link bhi dal do
How to Solve ANY LeetCode Problem (Step-by-Step)
12:37
Codebagel
Рет қаралды 314 М.
One day.. 🙌
00:33
Celine Dept
Рет қаралды 76 МЛН
Чистка воды совком от денег
00:32
FD Vasya
Рет қаралды 5 МЛН
А я думаю что за звук такой знакомый? 😂😂😂
00:15
Денис Кукояка
Рет қаралды 6 МЛН
How I would learn Leetcode if I could start over
18:03
NeetCodeIO
Рет қаралды 717 М.
Top K Frequent Elements - Bucket Sort - Leetcode 347 - Python
13:13
5 Simple Steps for Solving Any Recursive Problem
21:03
Reducible
Рет қаралды 1,3 МЛН
Mastering Dynamic Programming - How to solve any interview problem (Part 1)
19:41
Я купил Lada Aura
41:40
Клубный сервис
Рет қаралды 608 М.
Making an Algorithm Faster
30:08
NeetCodeIO
Рет қаралды 166 М.
The Backtracking Blueprint: The Legendary 3 Keys To Backtracking Algorithms
13:44
One day.. 🙌
00:33
Celine Dept
Рет қаралды 76 МЛН