Download AlgoExpert + SystemsExpert Full courses 2021-7

Description

AlgoExpert + SystemsExpert Full courses is the title of a collection published by Algo Expert educational institute. AlgoExpert is a complete resource for preparing for coding interviews. The fact is that interview questions and algorithms are hard. Even when we get into the deep process of a complex algorithm, it becomes more difficult. In the AlgoExpert section, you will dominate interview questions and algorithms with more than 70 hours of quality video training. SystemsExpert is also a unique course for large-scale distributed systems.

What you will learn in AlgoExpert + SystemsExpert course set:

• Data structures
• Familiarity with algorithms and their work process
• Tips, tricks and interview management
• Basic principles of system design
• Interview questions for system design

Course details

Publisher: Algo Expert
Instructors: Clément Mihailescu
English language
Training level: introductory to advanced
Number of courses: 300
Duration: 180 hours and 26 minutes

Available courses in the AlgoExpert + SystemsExpert Full courses collection:

Become Algorithms Expert

1-Easy
01. Two Number Sum
02. Validate Subsequence
03. Find Closest Value In BST
04. Branch Sums
05. Node Depths
06. Depth-first Search
07. Linked List Construction
08. Nth Fibonacci
09. Product Sum
10. Binary Search
11. Find Three Largest Numbers
12. Insertion Sort
13. Bubble Sort
14. Selection Sort
15. Palindrome Check
16. Caesar Cipher Encryptor

2-Medium
01. Three Number Sum
02. Smallest Difference
03. Move Element To End
04. Monotonic Array
05. Spiral Traverse
06. Longest Peak
07. BST Construction
08. Validate BST
09. BST Traversal
10. Min Height BST
11. Invert Binary Tree
12. Max Subset Sum No Adjacent
13. Number Of Ways To Make Change
14. Min Number Of Coins For Change
15. Levenshtein Distance
16. Kadane’s Algorithm
17. Single Cycle Check
18. Breadth-first Search
19. River Sizes
20. Youngest Common Ancestor
21. Min Heap Construction
22. Remove Nth Node From End
23. Permutations
24. Powerset
25. Min Max Stack Construction
25. Search In Sorted Matrix
27. Balanced Brackets
28. Longest Palindromic Substring
29. Group Anagrams
30. Suffix Trie Construction

3-Hard

01. Four Number Sum
02. Subarray Sort
03. Largest Range
04. Min Rewards
05. Zigzag Traverse
06. Same BSTs
07. Max Path Sum
08. Max Sum Increasing Subsequence
09. Longest Common Subsequence
10. Min Number Of Jumps
11. Water Area
12. Knapsack Problem
13. Disk Stacking
14. Numbers In Pi
15. Topological Sort
16. Boggle Board
17. Continuous Median
18. Find Loop
19. Reverse Linked List
20. Merge Linked Lists
21. Shift Linked List
22. Lowest Common Manager
23. Interweaving Strings
24. Shifted Binary Search
25. Search For Range
26. Quickselect
27. Quick Sort
28. Heap Sort
29. Shorten Path
30. Longest Substring Without Duplication
31. Underscorify Substring
32. Pattern Matcher
33. Multi String Search

4-Very Hard
01. Apartment Hunting
02. Calendar Matching
03. Iterative In-order Traversal
04. Flatten Binary Tree
05. Right Sibling Tree
06. All Kinds Of Node Depths
07. Max Profit With K Transactions
08. Palindrome Partitioning Min Cuts
09. Longest String Chain
10. Knuth-Morris-Pratt
11. Rectangle Mania
12. Merge Sorted Arrays
13. LRU Cache
14. Rearrange Linked List
15. Number Of Binary Tree Topologies
16. Merge Sort
17. Smallest Substring Containing