I gave 127 interviews. Top 5 Algorithms they asked me.
HTML-код
- Опубликовано: 15 июн 2023
- 1. How to learn Data Structures and Algorithms?
2. The best course to learn Data Structures and Algorithms in Java and Python
3. How to crack coding interview?
4. How to use Leetcode effectively?
I will answer all these questions in this video.
► Useful links:
1. Top k largest elements: www.geeksforgeeks.org/k-large...
2. Sliding window: leetcode.com/problems/longest...
3. Combination Sum Backtracking: replit.com/@replitshare2/Comb...
4. Combination Sum Dynamic Programming: replit.com/@replitshare2/Comb...
5. DFS and BFS: • 5.1 Graph Traversals -...
Disclosure: Resources above are all FREE in the US. However, If you pay for a Coursera or Udacity course using our link, we get paid a small amount.
► For more content like this, subscribe to our channel: / powercouple26
► Follow us on Linkedin:
/ gabag26
/ sarrabounouh
► Let's be FRIENDS! / power_couple26
► For business inquiries, reach us on: powercouplejourney@gmail.com
#datastructures #datastructuresandalgorithms #leetcode #codinginterview
DISCLAIMER: All opinions shared on this channel are our own and don't express views or opinions of our employers. We only use our experiences and public knowledge to make our content. NO CONFIDENTIAL INFORMATION of our employers is used or shared on this channel. This is not a Professional Coaching channel, it only highlights the public resources that have worked for our careers. 
Наука
1. Top-k Largest Elements
2. Sliding Window
3. Backtracking
4. Dynamic Programming
5. DFS and BFS
Vice versa
Bonus Algorithms at the end of video:
6. Topological Sort
7. Dijkstra's Algorithm
@@muneebzubair8443 8. Tree
Copied
@@muneebzubair8443😅
We want a video on top 5 most asked data structures
Yeess
+1
+1
Hi all! Thanks for the suggestion. Will post it this weekend 😊
@@sahilandsarra thank you so much
This is great work. Please continue giving info about interviews, so that I can train my students better.
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!
I like how you explain simply with a very calm voice things that might seems complex at first!
Great work!
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.
Thanks 🙏
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 🙏
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
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! 🙌💪
Thanks Kexin! Love your videos 🫶
@@sahilandsarra Thanks for your videos, i'm learning python thanks to you, where can learn GoLang, datacamp isnt teaching this programming language
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.
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.
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
It would be awesome if you make a series explaining these algorithms
Bro what an animation, how did you learn this top notch editing bro ❤
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 😅
Hey, Have you landed a job yet? What is your primary language?
bro send me money too i have pay for my college fees ( small help will be appreciated)
Thanks for sharing your knowledge with out any cost
Thanks for watching.
Right... I'm so grateful for the knowledge sharing 💕
Would be great if u upload lectures on dynamic programming! Great content go ahead.
i love your calmness while explaining
Please do a video about the top 5 data structures!
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
Thanks for sharing 👍
U can mention quick select but I won’t try to code it up in interviews
@@moneymaker7307 why?
You are calmer than the buddhist monks. Listening to you is nirvana... 😁🤓🤗 Thanks for sharing your experience 👍👍👍 love and respect
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 .
Thanks 🙏 👍
i think its his gay voice he got in iit delhi which makes him very calm
Thanks for the video!
Thank You So Much for this wonderful video..............🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
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)
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
We can solve it in O(n) time using bucket sort.
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
Please explain top 5 algorithms in detail
And make more this type of video
Yes please Top 5 Data structures.
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.
You motivated me to learn DSA.
Please make a video on top 5 data structure
Sahil, thank you . Please do a video about the top 5 data structures!
🙏👍
Definitely make a top data structures video sahil! Also love your videos
👍
yes we want a video on top 5 data structures
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❤❤❤
👍❤️❤️
Thank you for posting this helpful and detailed video
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 :)
Thanks 🙏
Requesting you to kindly start a DSA course/boot camp - it would be very much helpful - thank you
I love your videos each time something new very interesting topics
Thanks 🙏
Plz make a video on top 5 data structures
Thanks sir make a video on Android app development from java what things we follow and learn for beginning
awesome video, the way you are speaking I feel I am listening to an AI machine. Thanks :)
The music sound at the end was perfectly placed.
Nice video content selection is also good
Thanks ❤️
Amazing explanations!!
Thanks 🙏
Waiting for the top 5 system design concepts asked in Google interviews ❤
Please make a video on the top 5 datastructures
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 ❤❤
Hi Sahil, I loved your videos❤. Your voice is so dense😊. May God bless you.
Thanks ❤️
Bonus Algorithms at the end of video:
6. Topological Sort
7. Dijkstra's Algorithm
0. A*, Bellman Fords, Floyd Warshall
Really needed sir kindly teach
Would love to see the some data structure videos.
👍
can you please make a detailed video on most asked data structure Topics In an interviews ?
Thanks for sharing this. I think a better title would be "Top 5 Algorithm Patterns they asked me" other than that, great work!
What is the practical application of these algorithms?
yes, We want a video on top 5 most asked data structures
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.
Hey man why don't you start giving tutorials.I believe you can deliver them way better than many people
top 5 most asked full lecture about ds and algorithms please
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.
🎯 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
Top k-frequent elements with heap is also N * log(N) time complexity.
sir please make a detailed video on dsa as whole about topics most ques are asked
It’s already linked at the end of the video.
Kindly post videos explaining these 5 algorithms
I was asked to implement an autocomplete feature using trie data structure 😅
I always watching ur videos and learned alot
Thanks
Please do video on top 20 algorithms
127 interview to get a job ... that's what i call "Try hard". Well done man, never give up ;)
Anyway nowadays, people just need to learn the algorithms and train on it for the interview. Everything that matter is the "Interview Skills". I saw a lot of indians going to the big tech companies by only mastering the art of interview but with poor business understanding and mediocre software engineering skills.
Love you bro I inspire you
Could you please make a video on the future of developer after 5 years from now ? As chatGPT and AI is evolving.
Hey bro, Im finding it difficult to find the time complexity for back tracking sum. Can you please a video about that?
top 5 DSA asked, we need a video on this topic
Do a video contains top 5 data structures. That may be helpful
Yes, please make it
please make 1 videos on all the algos
Yss please make the video for data structure
@PowerCouple, please make one video on calculating Time complexity
Hi Power Couple, to crack coding interviews is needed to have a academic formation of data structures and algo? Thanks
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
CAN YOU PLEASE MAKE A FULL COURCE ON DSA, BCOZ YOUR WAY OF EXPLANATION IS MINDBLOWING
Spooky oO
please make a video on flow state and how to get into it
I have already made it.
Sometimes it is hard to understand you because of your English, but thank you for the video overall.
We want top 5 most asked data structures
What company is asking you dynamic programming questions? Those are really hard to answer fast in a 45 min interview and teams and companies I've interviewed do not like asking them.
"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.
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.
@@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.
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.
How long in average should take for a person to master all of these algorithms? As many things the answer is always it depends, but I would like to you from you who is reading this comment, how long did it take to you to master these algorithms? 😮
top 5 most asked data structure is needed
This guy speaks so politely it just doesn't feel he is speaking and he also must be saving a lot of energy 😂
For the "Top k elements" for your solution the complexity is actually O(nlogn), since in worst case scenario k tends to n.
no it can never exceed nlogk, assume k==1 so there is no way to make it nlogn
@@aliiucer you are considering the best case scenario, mostly folks talk about worst case complexity & average case complexity when talking about an algorithm.
@@muditjaiswal actually k is a different variable than n so nlogk is a better choice, worst case is a different thing
Bro if there is no job on the portal how to apply ? I mean i have seen people still getting a job
You are inspirational.
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)
big fan sir
Thanks 🙏
I like the way you speak!
Thanks 🙏
Sir can you please tell me the proper guild line to start programming journey
For Fe students
❤ it's too good
❤️
Thankyou sir
🙏
Must make video - Top 5 most asked Data Structures
Thank you bhaiya
Thanks 🙏
Take my sub !!
Thank you, sir
Nice video 👍
👍❤️