Video ID: PjiH9yQZYa0
YouTube URL: https://www.youtube.com/watch?v=PjiH9yQZYa0
Added At: 27-06-25 23:55:00
Processed: No
Sentiment: Positive
Categories: Education, Tech
Tags: coding interview, programming, algorithm, topk elements, sliding window, backtracking, dynamic programming, bread for search, depth for search
Summary
Bullet points on top algorithms in coding interviews: TopK elements, Sliding window, Backtracking, Dynamic programming and Bread for search/Depth for search. These algorithms are used to solve problems like finding largest/smallest elements, longest substring, combination sum and traversing graphs.
Transcript
I have given 127 coding interviews in my life here are the top five algorithms they asked me at number five we have topk elements algorithm you need this algorithm to find topk largest elements in an array or topk most frequent elements in an array at number four we have the sliding window algorithm this algorithm is used to solve problems like longest substring without repeating characters or maximum sum subarray with length K next we have backtracking backtracking is used to solve problems like combination sum and Word ladder at number two we have dynamic programming or DP DP is used to solve problems like longest increasing subsequence and longest common subsequence at the top we have bread for search or BFS and depth for search or DFS both of these algorithms are used to Traverse graphs