AlgoExpert + SystemsExpert Full courses 2021-7 – Full Version

Description

AlgoExpert + SystemsExpert Complete Courses is a collection edited by Algo Expert. AlgoExpert is the perfect resource to prepare for coded interviews. The thing is, interview questions and algorithms are tough. Even when it comes to understanding the in-depth process of a complex algorithm, the task becomes even more difficult. In the AlgoExpert section, with more than 70 hours of quality video training, you will overcome interview questions and algorithms. SystemsExpert is also a unique course for large-scale distributed systems.

What you will learn in the AlgoExpert + SystemsExpert course suite:

• Data structures
• Familiarity with algorithms and their workflow
• Tips, tricks and interview management
• Fundamentals of System Design
• System Design Interview Questions

Course specifications

Publisher: Algo Expert
Instructors: Clement Mihailescu
French language
Level: Introductory to Advanced
Number of Courses: 300
Duration: 180 hours and 26 minutes

Courses in AlgoExpert + SystemsExpert Complete courses:

Become an expert in algorithms

1-Easy
01. Two-digit sum
02. Validate the sub-sequence
03. Find nearest value in BST
04. Sums of branches
05. Knot Depths
06. Depth First Search
07. Linked List Building
08. Nth Fibonacci
09. Sum of product
10. Binary Search
11. Find the three largest numbers
12. Insertion Sort
13. Bubble Sort
14. Selection Sort
15. Verification of the palindrome
16. Caesar cipher cipher

2-Medium
01. Sum of three digits
02. The smallest difference
03. Move item to end
04. Monotonous painting
05. Spiral Traverse
06. Longest Peak
07. BST Construction
08. Validate BST
09. Crossing the BST
10. BST minimum height
11. Reverse Binary Tree
12. Maximum sum of non-adjacent subset
13. Number of ways to make changes
14. Minimum number of parts to be changed
15. Levenchtein Distance
16. Kadane’s Algorithm
17. Single Cycle Verification
18. Extensive search first
19. River Sizes
20. Youngest common ancestor
21. Minimum heap construction
22. Delete the nth node from the end
23. Permutations
24. Power set
25. Min Max stack construction
25. Search in a Sorted Matrix
27. Balanced Brackets
28. Longest palindromic substring
29. Group Anagrams
30. Construction of the suffix

3-Difficult

01. Four digit sum
02. Sorting sub-arrays
03. The largest range
04. Minimum Rewards
05. Zigzag Traverse
06. Same BST
07. Maximum path sum
08. Increasing subsequence of the maximum sum
09. Longest common subsequence
10. Minimum number of jumps
11. Aquatic area
12. Backpack Problem
13.Disc stacking
14. Numbers in Pi
15. Topological sorting
16. Boggle Board
17. Continuous median
18. Find the Loop
19. Reverse Linked List
20. Merge linked lists
21. Shift Linked List
22. Lowest Common Manager
23.
String interleaving 24. Shifted binary search
25. Find a beach
26. Quick Selection
27. Quick Sort
28. Heap Sort
29. Shorten the Path
30. Longest non-duplicate substring
31. Underscorify the substring
32. Pattern Matcher
33. Multi-Channel Search

4-Very hard
01. Flat Hunt
02. Calendar match
03. Iterative traversal in order
04. Flatten Binary Tree
05. Right Sibling Tree
06. All kinds of knot depths
07. Maximum profit with K trades
08. Palindrome Partitioning Minimal Cuts
09 Longest chain
10. Knuth–Morris–Pratt
11. Rectangle Madness
12. Merge sorted arrays
13.LRU Cache
14. Reorder Linked List
15. Number of binary tree topologies
16. Merge Sort
17. Smallest substring containing