No video

2751. Robot Collisions | Stack | Sorting | Not Hard 🫡

  Рет қаралды 6,309

Aryan Mittal

Aryan Mittal

Күн бұрын

In this video, I'll talk about how to solve Leetcode 2751. Robot Collisions | Stack | Sorting | Not Hard 🫡
Let's Connect:
📱Discord (Join Community) : / discord
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / codewitharyanbhai
💻 Twitter - / aryan_mittal007
🤖 Github: github.com/ary...
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Timelines✨
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

Пікірлер: 18
@rishisoni3386
@rishisoni3386 Ай бұрын
As soon as he gave me the idea to use stack, I solved it myself. Thanks👍👍👍
@ujjwalrockriser
@ujjwalrockriser Ай бұрын
Same, with 4 wrong submissions 😂
@ARYANMITTAL
@ARYANMITTAL Ай бұрын
Aweosme man ❤️❤️🫡
@ARYANMITTAL
@ARYANMITTAL Ай бұрын
😂😂
@toxicdemonop519
@toxicdemonop519 Ай бұрын
Aryan Bhai pehli baar Bina hint ke koi hard solve Kiya tha,bahot khush hua tha mai,aur abhi tumhari video mei not hard dekh liya 🙂
@saadalish18
@saadalish18 Ай бұрын
I still think this problem is hard, because as soon as robots starts moving, robot that are more close to positions should collide first. In that case health count would be different. You are iterating from 0th index. But what if last two robots have position difference 1. I think they would collide first and impact the overall health score. Let me know, if i am getting it wrong.
@youcanyouwill2004
@youcanyouwill2004 Ай бұрын
Here the gap between robots is uniform, it is assumed else we need to consider the distance between them too.
@bharathkumar9645
@bharathkumar9645 Ай бұрын
I have done it using Priority Queue and Unordered Set , but Watching this video to know how to do it using stack.
@aurosaswatraj6837
@aurosaswatraj6837 Ай бұрын
Can you please share with me the solution!! Thanks for the efforts!
@codewith_me07
@codewith_me07 Ай бұрын
I have already done this was very easy problem
@codewith_me07
@codewith_me07 Ай бұрын
still again I want to watch your solution and approach
@cenacr007
@cenacr007 Ай бұрын
@bornmad
@bornmad Ай бұрын
my code has same complexity O(nlogn) but is giving TLE. Can you help? bool byPos(vector a, vector b){ return a[1]
@fancyblade7361
@fancyblade7361 Ай бұрын
ik last video you wrote about the title of videos still its a request if possible dont write the Data structures used if possible ....Thank you
@pratikdhoke2346
@pratikdhoke2346 Ай бұрын
maksad nhi bolna hai😄
@cameye9
@cameye9 Ай бұрын
Today's POTD is similar to Asteroid Collision(Medium) Problem which is also available on LeetCode but this is an Advanced of Asteroid Collision Only... I done this Question at 6:00 am in the morning by myself... Thoko Likes...👍
@ARYANMITTAL
@ARYANMITTAL Ай бұрын
❤️❤️🫡
Logo Matching Challenge with Alfredo Larin Family! 👍
00:36
BigSchool
Рет қаралды 18 МЛН
Schoolboy Runaway в реальной жизни🤣@onLI_gAmeS
00:31
МишАня
Рет қаралды 1,9 МЛН
I Solved 1583 Leetcode Questions  Here's What I Learned
20:37
ThePrimeTime
Рет қаралды 614 М.
10 Math Concepts for Programmers
9:32
Fireship
Рет қаралды 1,8 МЛН
Premature Optimization
12:39
CodeAesthetic
Рет қаралды 789 М.
Can You Drive On Wood Wheels?
19:42
Waterjet Channel
Рет қаралды 79 М.
Winning Google Kickstart Round A 2020 + Facecam
17:10
William Lin
Рет қаралды 9 МЛН
How This New Battery is Changing the Game
12:07
Undecided with Matt Ferrell
Рет қаралды 47 М.
How to NOT Fail a Technical Interview
8:26
Fireship
Рет қаралды 1,4 МЛН
8 patterns to solve 80% Leetcode problems
7:30
Sahil & Sarra
Рет қаралды 318 М.
Logo Matching Challenge with Alfredo Larin Family! 👍
00:36
BigSchool
Рет қаралды 18 МЛН