
50 Essential Algorithms for Every Programmer in 7 Minutes Each
Master Key Concepts Quickly to Boost Your Coding SkillsBy Nietsnie TreblaLength5h 18m
About this audiobook
Unlock the world of programming algorithms with 50 Essential Algorithms for Every Programmer in 7 Minutes Each. This concise yet comprehensive guide is designed for both novice coders and seasoned developers looking to brush up on their algorithm knowledge in a time-efficient manner.
Each algorithm is presented in a clear, digestible format, allowing you to grasp essential concepts and implementations in just seven minutes. Whether you're preparing for coding interviews, tackling competitive programming challenges, or simply wanting to enhance your coding skills, this book provides the perfect blend of theory and practical application.
Audiobook details
GenreTechnology
Length5 hrs 18 mins
Narrated byListen with 1,000+ voices
FormateBook with Audio
Publish dateJan 15, 2025
LanguageEnglish
Table of contents
1Introduction
2Foreword
3Introduction
4Bubble Sort
5Selection Sort
Show all chaptersShow less
6Insertion Sort
7Merge Sort
8Quick Sort
9Heap Sort
10Binary Search
11Linear Search
12Breadth-First Search (BFS)
13Depth-First Search (DFS)
14Dijkstra's Algorithm
15A* Search Algorithm
16Floyd-Warshall Algorithm
17Kruskal's Algorithm
18Prim's Algorithm
19Dynamic Programming - Fibonacci
20Dynamic Programming - Knapsack
21Longest Common Subsequence
22Longest Increasing Subsequence
23Backtracking - N-Queens Problem
24Backtracking - Sudoku Solver
25Graph Representation - Adjacency List
26Graph Representation - Adjacency Matrix
27Binary Tree Traversal - Preorder
28Binary Tree Traversal - Inorder
29Binary Tree Traversal - Postorder
30Graph Cycle Detection
31Topological Sorting
32Union-Find Algorithm
33Segment Tree
34Trie Data Structure
35Counting Sort
36Radix Sort
37Bucket Sort
38Depth-First Search for Connected Components
39Bellman-Ford Algorithm
40Branch and Bound
41Greedy Algorithm - Coin Change
42Greedy Algorithm - Activity Selection
43Matrix Chain Multiplication
44String Matching - Naive Approach
45String Matching - Knuth-Morris-Pratt (KMP)
46String Matching - Rabin-Karp
47Bit Manipulation - Counting Set Bits
48Bit Manipulation - Finding the Only Odd Occurring Number
49Dynamic Programming - Edit Distance
50Dynamic Programming - Coin Change Problem
