+- Forum Rockoldies (https://rockoldies.net/forum)
+-- Forum: Fotobearbeitung - Photoshop (https://rockoldies.net/forum/forumdisplay.php?fid=16)
+--- Forum: E-Learning, Tutorials (https://rockoldies.net/forum/forumdisplay.php?fid=18)
+--- Thema: AlgoExpert + SystemsExpert (/showthread.php?tid=19388)
AlgoExpert + SystemsExpert - Panter - 02.02.2021
![[Bild: mh4szidygbfvml9ysbilhaqjeh.jpg]](https://abload.de/img/mh4szidygbfvml9ysbilhaqjeh.jpg)
AlgoExpert + SystemsExpert
Clément Mihailescu (et al.) | Duration: 90h 40m | Video: H264 1920x1080 | Audio: AAC 48 kHz 2ch | 26,41 GB | Language: English
AlgoExpert is an ultimate resource to prepare for coding interviews.
The truth is that interview questions and algorithms are difficult.
Even more difficult is trying to understand the inner workings of a complex algorithm from a book or from a poorly thought-out video shot on your grandma's camera.
Our crisp 1080p videos boast crystal-clear audio and are strategically divided into two parts to give you the most comprehensive explanations to questions.
That's over 70 hours of content specifically tailored to make interview questions and algorithms easy.
SystemsExpert is an unparalleled course on large-scale distributed systems. Everything you need to ace the systems design interviews.
We firmly believe in the effectiveness of video as an educational medium.
Our course's 25 modules are delivered in high resolution with crystal-clear audio for a truly premium experience. Concepts are explained at length and, where applicable, are showcased in action through a real code example.
Meanwhile, each of our 10 practice questions includes a thorough video mock interview, where we walk you through every step of the solution in detail.
Preparing for systems design interviews has never been easier.
Content
Become Algorithms Expert
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
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
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
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
Behavioral Interview Preparation
01. Introduction
02. What Are Behavioral Interviews
03. General Tips
04. Low Performer
05. Team Conflict
06. Interest In Company
07. Strong Disagreement
08. Sudden Onboarding
09. Work Distribution
10. Past Mistake
11. Challenging Project
12. Production Outage
13. Tough Feedback
14. Strengths And Improvements
15. Comfort Zone
Data Structures Crash Course
01. Introduction
02. What Are Data Structures
03. Complexity Analysis
04. Memory
05. Big O Notation
06. Logarithm
07. Arrays
08. Linked Lists
09. Hash Tables
10. Stacks And Queues
11. Strings
12. Graphs
13. Trees
Interview Tips Tricks
01. How To Best Use AlgoExpert
02. Coding Skills
03. Problem Solving Ability
04. Communication
05. Culture Fit
Systems Design Fundamentals
01. Introduction
02. What Are Design Fundamentals
03. Client-Server Model
04. Network Protocols
05. Storage
06. Latency And Throughput
07. Availability
08. Caching
09. Proxies
10. Load Balancers
11. Hashing
12. Relational Databases
13. Key-Value Stores
14. Specialized Storage Paradigms
15. Replication And Sharding
16. Leader Election
17. Peer-To-Peer Networks
18. Polling And Streaming
19. Configuration
20. Rate Limiting
21. Logging And Monitoring
22. Publish and Subscribe Patterns
23. MapReduce
24. Security And HTTPS
25. API Design
Systems Design Interview Questions
01. Design AlgoExpert
02. Design a Code-Deployment System
03. Design A Stockbroker
04. Design Facebook News Feed
05. Design Google Drive
06. Design The Reddit API
07. Design Netflix
08. Design the Uber API
09. Design Slack
10. Design Airbnb
Homepage
Code:
http://anonymz.com/?https://www.algoexpert.io/product![[Bild: ynsgrwt0klvf2o4ftgigcgljph.jpg]](https://abload.de/img/ynsgrwt0klvf2o4ftgigcgljph.jpg)