AlgoExpert + SystemsExpert Full Course 2021-7 – Download

explanation

AlgoExpert + SystemsExpert complete courses are a collection published by Algo Expert. AlgoExpert is the perfect resource for preparing for coded interviews. In fact, the interview questions and algorithms are difficult. The task becomes even more difficult when you understand the deep processes of complex algorithms. In the AlgoExpert section, you’ll overcome interview questions and algorithms with over 70 hours of high-quality video training. SystemsExpert is also a unique course for large-scale distributed systems.

Here’s what you’ll learn in the AlgoExpert + SystemsExpert course:

• data structure
• Knowledge of algorithms and their workflows
• Tips, Tricks and Interview Management
• Principles of System Design Fundamentals
• System Design Interview Questions

Course specifications

Publisher: Algo Expert
teacher: Clement Michaelescu
Language:English
Level: Beginner~Advanced
Number of courses: 300
Duration: 180 hours and 26 minutes

AlgoExpert + SystemsExpert Course Full Course:

Become an algorithm expert

1-Easy
01. Sum of two numbers
02. Sub-sequence verification
03. Find the closest value in BST
04. Branch totals
05. Node depth
06. Depth-first search
07. Building a linked list
08. Nth Fibonacci
09. Product total
10. Binary Search
11. Find the three largest numbers
12. Insertion sort
13. Bubble sort
14. Selection Sort
15. Palindrome test
16. Caesar Cipher Encryptor

2 – Medium
01.Sum of three digits
02. The smallest difference
03. Move element to the end
04. Monotonous arrangement
05. Spiral Traverse
06. Jangbong Choi
07. BST Construction
08. BST verification
09. BST navigation
10. Minimum height BST
11. Binary tree inversion
12. Maximum nonadjacent subset sum
13. Number of ways to make a difference
14. Minimum number of coins for change
15. Levenstein Street
16. Kadane’s Algorithm
17. Single cycle check
18. Breadth-first search
19. Size of the river
20. Youngest common ancestor
21. Building a minimal heap
22. Remove Nth node from the end
23. Permutation
24. Powerset
25. Min-Max Stack Configuration
25. Search in a sorted matrix
27. Balanced bracket
28. Longest palindrome substring
29. Change the anagram of a group
30. Constructing a suffix tree

3-hard

01. Four digit sum
02. Sort subarray
03. Widest range
04. Minimum compensation
05. Zigzag traverse
06. Same BST
07. Maximum path sum
08. Maximum sum increasing subsequence
09. Longest common subsequence
10. Minimum number of jumps
11. Water body
12. Backpack Problem
13.Disk Stacking
14. The number of pi
15. Topological alignment
16. Boggleboard
17. Continuous Median
18. Find loops
19. Reverse linked list
20. Merge linked lists
21. Shift linked list
22. Lowest level common manager
23.
String concatenation 24. Moving binary search
25. Range Search
26. Quick selection
27. Quick sort
28. Heap Sort
29. Shorten the route
30. Longest substring without duplicates
31. Underscore substrings
32. Pattern Matcher
33. Multi-string search

4 – Very difficult
01. Apartment hunting
02. Calendar matching
03. Repeated sequential traversal
04. Binary tree flattening
05. Right Brother Tree
06. All kinds of node depths
07. Maximize profits with K-transactions
08. Palindrome partitioning minimum cut
09 longest string chain
10. Knuth-Morris-Pratt
11. Rectangle Mania
12. Merge sorted arrays
13. LRU Cache
14. Reorder linked list
15. Number of binary tree topologies
16. Merge Sort
17. Smallest substring containing