filmov
tv
Top Algorithms for The Coding Interview(for Software Engineers)|Coding Interview Tips |Coding Ninjas

Показать описание
In this video, Parikh Jain, founding member of Coding Ninjas, talks about the most important algorithms that are asked frequently in coding interviews. These include searching and sorting algorithms, recursion and backtracking algorithms, graph algorithms, dynamic programming, breadth first search and depth first search and other important algorithms. Many of the coding questions can be solved with the help of these algorithms.
Let us know if you have any questions in the comments below.
0:00 - Introduction
1:23 - Searching And Sorting
2:32 - Standard Algorithms
3:55 - Recursion And Backtracking
5:02 - Slow And Fast Pointers Technique In Linked List
5:28 - Graph Algorithms
6:46 - Dynamic Programming
7:41 - Graph Algorithms
7:49 - BFS & DFS are most important concept
9:40 - Other Important Algorithms
----------------------------------------------------------------------------------------------------------------------
----------------------------------------------------------------------------------------------------------------------
Coding Ninjas is one of the leading EdTech company providing India’s Highest rated programming courses in C++, Data Structures and Algorithms, Java, Python, Machine Learning, web development, Data Science, Android Development, Kotlin, React.
-----------------------------------------------------
------------------------------------------------------
Explore more on our social media platforms:
Tags
Most important algorithms
most important data structures
Top Algorithms for Coding Interviews
Top 10 Algorithms for Coding Interviews (for software engineers)
Hashtags
#softwareengineer #interview #placements
Комментарии