I gave 127 interviews. Top 5 Algorithms they asked me.

[@sahilandsarra]

Try my free email crash course to crush technical interviews: instabyte.io/

[@ThourCS2]

1. Top-k Largest Elements 2. Sliding Window 3. Backtracking 4. Dynamic Programming 5. DFS and BFS

[@s.k.6563]

Vice versa

[@muneebzubair8443]

Bonus Algorithms at the end of video: 6. Topological Sort 7. Dijkstra's Algorithm

[@alexeyprikhodko6990]

@@muneebzubair8443 8. Tree

[@sajithgunarathna3696]

Copied

[@AbhinavRaj_P]

@@muneebzubair8443😅

[@studytable2060]

1. Top-k Largest Elements(from array) 2. Sliding Window(longest substring without repeating characters) 3. Backtracking(combination/target sum, word ladder, permutation, sudoku solver) 4. Dynamic Programming(combination/target sum) 5. DFS(implemented using stack(LIFO)) and BFS(implemented using queue(FIFO)) ex-Dijkstra's Algorithm, Topological sort

[@jojobabu5718]

We want a video on top 5 most asked data structures

[@prabhatkumarraj9709]

Yeess

[@cinzoop5250]

+1

[@iamgroot2810]

+1

[@sahilandsarra]

Hi all! Thanks for the suggestion. Will post it this weekend 😊

[@_JAGATHEESANV]

@@sahilandsarra thank you so much

[@iAPX432]

I like how you explain simply with a very calm voice things that might seems complex at first! Great work!

[@aufkeinsten7883]

Jesus christ you are an absolute beast at this, best educational content I've seen I think! Concise, informative, simple but not superficial.. Thank you so much!

[@davit_code8929]

If you don't need to return the elements in order, Top k elements can be optimised even further with quickselect to Time complexity of O(n + k) => O(n) AND bringing down the space complexity to O(1) too. Quickselect has a worse time complexity of O(n^2), but picking the pivot randomly each time gives O(n). The chances of always picking a bad pivot that would make it O(n^2) with a random pivot is so small, that papers assume it never happens.

[@tho_norlha]

Just a question: You can do one for loop to get the largest let -> n Another one to remove that won’t -> n Repeat it 2 times so we get too 3 elts ->O(5n) = O(n) Am I correct ? If it’s too 3 elts, but I see that a heap might be better if we want the top k elts and if K is very large

[@nassir2154]

🎯 Key Takeaways for quick navigation: 00:00 📚 *Introduction to Common Algorithms in Coding Interviews* - Overview of frequently asked algorithms in tech company interviews. - Emphasis on the 80-20 rule in algorithm knowledge for interviews. 00:30 💡 *"Top k Elements" Algorithm* - Explanation of the "top k elements" algorithm and its application. - Use of heap data structure for efficiency in finding k largest elements. 01:52 🖥️ *"Sliding Window" Algorithm* - Introduction to the "Sliding Window" algorithm for various problems. - Example using Largest Substring without repeating characters. 03:17 🔙 *Backtracking Method* - Concept of backtracking explored with the Combination Sum problem. - Use of recursion in backtracking algorithms. 05:07 🧮 *Dynamic Programming Approach* - Differences between backtracking and dynamic programming. - Application of dynamic programming in solving the Combination Sum problem. 07:02 🌐 *Graph Traversal: BFS and DFS* - Explanation of Breadth First Search (BFS) and Depth First Search (DFS). - Comparison of BFS and DFS in graph traversal, and their respective data structures. Made with HARPA AI

[@kkcui]

I like how you explain recursion - I always draw a stack and dive into each step but that's just cost a lot of time. And 127 interviews is just impressive! Keep up the good work power couple! 🙌💪

[@sahilandsarra]

Thanks Kexin! Love your videos 🫶

[@ohazimihevanessa3972]

@@sahilandsarra Thanks for your videos, i'm learning python thanks to you, where can learn GoLang, datacamp isnt teaching this programming language

[@sebastiantu6212]

I never really understood backtracking until I realized that it should be called quit when there’s no point going on

[@AdnanDev-su5no]

I was taught all these in university, but never told how, why or where they are used. I have started to use these in my personal projects after watching your video. Thanks a bunch for spreading this valuable knowledge. And of course I do plan to use this info for coding interviews in the future apart from my projects 😅

[@paultvshow]

Hey, Have you landed a job yet? What is your primary language?

[@AdarshGupta-hc3qv]

bro send me money too i have pay for my college fees ( small help will be appreciated)

[@dankiy3679]

I would suggest using Quick Select to solve problems where you have to return top K elements, since it has O(n) average time complexity

[@sahilandsarra]

Thanks for sharing 👍

[@moneymaker7307]

U can mention quick select but I won’t try to code it up in interviews

[@anon1963]

@@moneymaker7307 why?

[@dapygor9339]

​@@anon1963 it's kind of hard

[@alicivrilify]

This is great work. Please continue giving info about interviews, so that I can train my students better.

[@RomanKopystyrynskyi]

For k largest/smallest elements we can do heapify which works in O(n) and then take k element in constant time. Second option is counting sort which works in O(n +k)

[@JD797]

Even with heapify in linear time, taking k elements is still klogk since when the top element is removed, the heap moves the last element to the top to replace it and sifts down, which is log k operation

[@Omar_Al_Seddik]

We can solve it in O(n) time using bucket sort.

[@divakarsaragadam8420]

Thanks for sharing your knowledge with out any cost

[@sahilandsarra]

Thanks for watching.

[@abbylynn8872]

Right... I'm so grateful for the knowledge sharing 💕

[@soicooc3500]

1. Top-k Largest Elements ( 0:46 - 1:00) 2. Sliding Window (1:01 - 3:30) 3. Backtracking ( 3:30 - 5:03) 4. Dynamic Programming ( 5:06 - 7:00) 5. DFS and BFS ( 7:02 - 7:54)

[@zedddoctor]

Your videos are so helpful, I inevitably end up saving them in a playlist so I can refer to them later whenever I need guidance. Thank you so much.

[@sahilandsarra]

Thanks 🙏

[@elavarasan289]

Whenever I am getting demotivated u just create a video and it makes me think dsa is easy. I dont know whether your calming voice or the way you explain. Thanks a lot .

[@sahilandsarra]

Thanks 🙏 👍

[@TuringTested01]

i think its his gay voice he got in iit delhi which makes him very calm

[@richied90]

Nice and simple explanations! Thanks for uploading this

[@unity3dconcepts434]

You are calmer than the buddhist monks. Listening to you is nirvana... 😁🤓🤗 Thanks for sharing your experience 👍👍👍 love and respect

[@stith_pragya]

Thank You So Much for this wonderful video..............🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@wadigzonDiazwong]

Thanks for sharing this. I think a better title would be "Top 5 Algorithm Patterns they asked me" other than that, great work!

[@karanbenz]

Sahil, amazing Video. Loved the way you explained the problem with an animation. Highly recommend you launching a course in DSA using Python with similar explanation 🙏

[@CRBarchager]

Very good explication. There are algorithms here I've never heard of or for that matter never had any use for in my developer career but it's nice to broading your knowledge of things. Thank you for sharing.

[@paul_c15]

Please do a video about the top 5 data structures!

[@raidenshogun978]

It would be awesome if you make a series explaining these algorithms

[@_Aditya_Kumar_Raj]

i love your calmness while explaining

[@manishv3992]

Bro what an animation, how did you learn this top notch editing bro ❤

[@kan15hk]

Top k-frequent elements with heap is also N * log(N) time complexity.

[@larbesabdellah7079]

I'm a computer science student, I'm doing cloud computing now, I'm bad at networking and I hate it, but I'm in love with programming, please help me !!! Especially professional persons give me advices, roadmap anything to make me in the right way

[@muneebzubair8443]

Bonus Algorithms at the end of video: 6. Topological Sort 7. Dijkstra's Algorithm 0. A*, Bellman Fords, Floyd Warshall

[@elvisgarcia1822]

Wow, Nice explication even for someone who do not speak english I understand everything, Nice video editing everything was perfect, thanks for sharing your knowledge :)

[@sahilandsarra]

Thanks 🙏

[@alviahmed7388]

Definitely make a top data structures video sahil! Also love your videos

[@sahilandsarra]

👍

[@lakshyasaharan5348]

The music sound at the end was perfectly placed.

[@bhaskarkothala5169]

Hey man why don't you start giving tutorials.I believe you can deliver them way better than many people

[@Samandar-dev]

Sahil, thank you . Please do a video about the top 5 data structures!

[@sahilandsarra]

🙏👍

[@BangsarRia]

"Algorithms + Data Structures = Programs" was a 1976 book by Wirth, the designer of the Pascal programming language. Algorithms were all the rage in computing 50 years ago. Train yards and queuing in the 1960's, sorting, traversal and scheduling in the 1970's for Operations Research, an entire field that shortly disappeared. Then the focus turned to symbolic processing and other problems because algorithms were largely solved and available by calling libraries. While worthy of study for students, algorithms as questions in interviews for professional jobs shows a complete misunderstanding of solving real world problems and what a healthy code base should look like.

[@feroast1]

I'm always surprised when an interviewer doesn't follow with questions on how I'd implement in production code since, as you point out, most langauges have optimized solutions for us to leverage. However... DS-Algo challenges are the best way to determine candidate understanding of the computer science behind implementation choices. It's the best way to differentiate real coders from script-kiddies.

[@Shazam999]

@@feroast1My first developer question is always "has any of your code made into a production environment?" Most people actually answer no. I have no idea what people do all day.

[@Shazam999]

Pretty much. No one is writing algorithms by hand. That would be a colossal waste of time. Guess it sorta explains why FAANG employ so many people though.

[@snipacer]

Hi Sahil, I loved your videos❤. Your voice is so dense😊. May God bless you.

[@sahilandsarra]

Thanks ❤️

[@studiesinformation436]

Every of your video is Awesome please do a playlist on DSA I will be very thankful for considering of my comments Keep it up❤❤❤

[@sahilandsarra]

👍❤️❤️

[@hemanth_koll]

Requesting you to kindly start a DSA course/boot camp - it would be very much helpful - thank you

[@dakuta]

IIt's impressive to hear about your experience with 127 interviews and the algorithms they focused on. However, I'm curious about the circumstances that led to such a high number of interviews. Do you think there are specific factors or challenges that contributed to this? It would be really insightful to hear your thoughts on how to efficiently navigate the job market, especially for those who might find themselves in a similar situation.

[@dibyanshudash399]

Yes, pls make a video on Top 5 Data Structures

[@MaximStarikov]

Thanks for the video!

[@piyushmourya3183]

His calmness is scaring me

[@5outof5softwaretester]

😂😂

[@timhoward5]

😂

[@TricoliciSerghei]

Would love to see the some data structure videos.

[@sahilandsarra]

👍

[@sangu3939]

Thanks sir make a video on Android app development from java what things we follow and learn for beginning

[@motivationimpact181]

I love your videos each time something new very interesting topics

[@sahilandsarra]

Thanks 🙏

[@bigtime9231]

Would be great if u upload lectures on dynamic programming! Great content go ahead.

[@smartbinit2]

This guy speaks so politely it just doesn't feel he is speaking and he also must be saving a lot of energy 😂

[@Mohitsingh-bv1yp]

Please explain top 5 algorithms in detail And make more this type of video

[@RahulSharma-ht2xz]

yes we want a video on top 5 data structures

[@karanyuvrajsingh4911]

Amazing explanations!!

[@sahilandsarra]

Thanks 🙏

[@ratnadeepsaha7675]

Please make a video on most commonly used algorithms and data structures with use cases. Include not only 5 but also the other commonly used ones

[@vedparkashgaba5478]

Nice video content selection is also good

[@sahilandsarra]

Thanks ❤️

[@iirekm]

The problem is that most coding interviews are unrealistic. The reality is that in 99% of programming jobs, you'll never write a complex algorithm, all you need is to know 1) what library / tool / framework use in what situation, 2) communication skills. Low-level coding skills are for most IT jobs unimportant. Also in 99.99% of programming jobs you don't have such small hard time limit constraints (e.g. 1 hour to solve problem), but you rather can work for days (at least) and can use Google, StackOverflow, or help of colleagues. I reject job ads when they even mention that there will be a coding task. Coding interviews make sense only for maybe 1% of IT jobs where writing low-level middleware is involved (database storage engines, cryptography libraries, compression libraries, graphics libraries, ML libraries, etc). For most programming positions system design interview (e.g. what framework / library / technique would you use and why) is a much better option, sadly still few companies do it, still requiring nonsense coding interviews.

[@m_yoda]

Sometimes it is hard to understand you because of your English, but thank you for the video overall.

[@anirudhmittal5381]

Thank You for doing this. I subscribed to your channel as I love your videos. Can you recommend a best site that is good for learning and practicing these algorithms to pass most coding interview questions. Reply highly appreciated.

[@mohanseditz]

I like the way you speak!

[@sahilandsarra]

Thanks 🙏

[@biniyamabera8356]

yes, We want a video on top 5 most asked data structures

[@ishaaq5506]

Yes please Top 5 Data structures.

[@muhammadjawad7520]

Hello 1. Pls make a video on: Type Script vs Java Script (For Web Development) 2. Pls also share Budget Friendly Web Hosting & Domain options.

[@muditjaiswal]

For the "Top k elements" for your solution the complexity is actually O(nlogn), since in worst case scenario k tends to n.

[@aliiucer]

no it can never exceed nlogk, assume k==1 so there is no way to make it nlogn

[@muditjaiswal]

@@aliiucer you are considering the best case scenario, mostly folks talk about worst case complexity & average case complexity when talking about an algorithm.

[@aliiucer]

@@muditjaiswal actually k is a different variable than n so nlogk is a better choice, worst case is a different thing

[@pratyushkumarsahoo6117]

We want top 5 most asked data structures

[@shubhammergu8158]

Must make video - Top 5 most asked Data Structures

[@iosifcastrucci]

If someone is starting from 0, what do you recommend they start with? I mean, what is the best learning path?

[@rizwanullah3864]

@PowerCouple, please make one video on calculating Time complexity

[@madhav_0075]

Really needed sir kindly teach

[@ganeshreddykomitireddy5128]

Please make a video on the top 5 datastructures

[@shikhar7437]

Make a video on TOP 5 MOST ASKED DATA STRUCTURES.

[@samratsaha447]

top 5 DSA asked, we need a video on this topic

[@Vivekkumar-zc7mz]

I always watching ur videos and learned alot

[@sahilandsarra]

Thanks

[@audox4885]

im confused if these are the coding problems or the algorithms, because we use algorithms to solve these that you mentioned right?

[@mehdihassan93]

I can do these algorithms even if someone ask me in the middle of sleep. however I am still worried about the upcoming interview

[@SachinPatel-xi9fn]

Could you please make a video on the future of developer after 5 years from now ? As chatGPT and AI is evolving.

[@Raj-pi1pl]

please make 1 videos on all the algos

[@AyushKumar-pq4wi]

can you please make a detailed video on most asked data structure Topics In an interviews ?

[@codedecks]

Waiting for the top 5 system design concepts asked in Google interviews ❤

[@robertk4079]

Kindly post videos explaining these 5 algorithms

[@developer_opm]

CAN YOU PLEASE MAKE A FULL COURCE ON DSA, BCOZ YOUR WAY OF EXPLANATION IS MINDBLOWING

[@buddyreg234]

Spooky oO

[@VikasNikhil]

awesome video, the way you are speaking I feel I am listening to an AI machine. Thanks :)

[@randimadevindi5541]

Do a video contains top 5 data structures. That may be helpful

[@DigvijaySingh-se2ll]

please make a video on flow state and how to get into it

[@sahilandsarra]

I have already made it.

[@31ankitnain41]

sir please make a detailed video on dsa as whole about topics most ques are asked

[@sahilandsarra]

It’s already linked at the end of the video.

[@ritik6095]

6 months back i watched this video i don't know any of them and i was like how will i do them, today i know all of them and i can say i have mastered all of them except the dp (hehe)

[@DevangPatel-y8j]

Yes, please make it

[@jhors7777]

Thank you for posting this helpful and detailed video

[@learning-simlified]

top 5 most asked full lecture about ds and algorithms please

[@sekarrajagk8261]

top 5 most asked data structure is needed

[@Miss_Informative02]

SARRA PLEASE BRING PRODUCT MANAGEMENT CONTENT 🥺❤️

[@RakeshSingh-qo5nd]

Please make the video. I am watching Aditya Verma DSA. It is best for me

[@beinghappy9223]

Backtracking , DP , DFS & BFS

[@K9TX]

big fan sir

[@sahilandsarra]

Thanks 🙏

[@sigmamale7914]

please make a video how to Build Resumes with the help of 'AI"..............

[@Bankai-kamishininoyari]

do make the top 5 data structures

[@sahilandsarra]

👍

[@jitendaranjan7501]

Love you bro I inspire you

[@bommanahemanth4551]

Please do video on top 20 algorithms

[@almousafir4041]

Nice video 👍

[@sahilandsarra]

👍❤️

[@vinaygujjula8381]

We want video on data structures how to understand easily and what process we follow to remember easily. Try to make full length video on data structures.Thank you❤ always @power couple ❤❤

[@andreborgesuhlrich631]

What tool do you use to display the code in the video? I have a presentation to do and would like to use something similar.

[@AdnanNazirAhmed]

You are inspirational.