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

Sahil & Sarra
Sahil & Sarra
597,136
0
Published 2023-06-16
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-largestor-smallest-element…
2. Sliding window: leetcode.com/problems/longest-substring-without-re…
3. Combination Sum Backtracking: replit.com/@replitshare2/CombinationSumBacktrackin…
4. Combination Sum Dynamic Programming: replit.com/@replitshare2/CombinationSumDP#main.py
5. DFS and BFS:    • 5.1 Graph Traversals - BFS & DFS -Bre...  


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: youtube.com/PowerCouple26

► Follow us on Linkedin:
www.linkedin.com/in/gabag26
www.linkedin.com/in/sarrabounouh

► Let's be FRIENDS! www.instagram.com/power_couple26/

► For business inquiries, reach us on: [email protected]

#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.
All Comments (21)
  • @ThourCS2
    1. Top-k Largest Elements 2. Sliding Window 3. Backtracking 4. Dynamic Programming 5. DFS and BFS
  • @iAPX432
    I like how you explain simply with a very calm voice things that might seems complex at first! Great work!
  • @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
  • @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!
  • @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.
  • @alicivrilify
    This is great work. Please continue giving info about interviews, so that I can train my students better.
  • @jojobabu5718
    We want a video on top 5 most asked data structures
  • @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 🙏
  • @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 😅
  • @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! 🙌💪
  • @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.
  • @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.
  • @raidenshogun978
    It would be awesome if you make a series explaining these algorithms
  • @muneebzubair8443
    Bonus Algorithms at the end of video: 6. Topological Sort 7. Dijkstra's Algorithm 0. A*, Bellman Fords, Floyd Warshall
  • @stith_pragya
    Thank You So Much for this wonderful video..............🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻