**Become an Algorithms Expert**

English | MP4 | AVC 1920×1080 | AAC 48KHz 2ch | 64h 21m | 13.5 GB

What is AlgoExpert?

65 hand-selected questions

Interview Preparation is a number game that many candidates lose. We have selected 65 of the best interview questions to truly prepare you.

50+ hours of video explanations

Algorithms are hard to learn on paper. Each of our questions is accompanied by a two-part video explanation for maximum learning. This is more than 50 hours of content, all in your hands.

Solutions in 5 languages

Not everyone speaks the same programming language. We give you solutions for every question in 5 different languages: JavaScript, Python, C ++, Java and Go.

Difficulty analysis

Understanding how much memory the algorithm uses and how fast it works is extremely important. All of our explanations include a rigorous analysis of complexity.

Experience Tips

Algorithm interviews go beyond just algorithms and data structures. Our video series of interview tips give you important tips and tricks to help you stand out.

65 questions covering 14 categories.

If you want to go through a technical interview, knowledge of all common data structures and popular problem-solving methods is paramount. 65 questions covering 14 categories and 5 difficulty levels will help you with this.

- Binary search trees
- Binary trees
- Linked Lists
- Searching
- Strings
- Arrays
- Stacks
- Dynamic programming
- Famous algorithms
- Recursion
- Sorting
- Graphs
- Heaps
- Tries

**Table of Contents**

**Easy**

1 Two Number Sum

2 Validate Subsequence

3 Find Closest Value In BST

4 Branch Sums

5 Node Depths

6 Depth-first Search

7 Linked List Construction

8 Nth Fibonacci

9 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**

17 Three Number Sum

18 Smallest Difference

19 Move Element To End

20 Monotonic Array

21 Spiral Traverse

22 Longest Peak

23 BST Construction

24 Validate BST

25 BST Traversal

26 Min Height BST

27 Invert Binary Tree

28 Max Subset Sum No Adjacent

29 Number Of Ways To Make Change

30 Min Number Of Coins For Change

31 Levenshtein Distance

32 Kadane’s Algorithm

33 Single Cycle Check

34 Breadth-first Search

35 River Sizes

36 Youngest Common Ancestor

37 Min Heap Construction

38 Remove Nth Node From End

39 Permutations

40 Powerset

41 Min Max Stack Construction

42 Search In Sorted Matrix

43 Balanced Brackets

44 Longest Palindromic Substring

45 Group Anagrams

46 Suffix Trie Construction

**Hard**

47 Four Number Sum

48 Subarray Sort

49 Largest Range

50 Min Rewards

51 Zigzag Traverse

52 Same BSTs

53 Max Path Sum

54 Max Sum Increasing Subsequence

55 Longest Common Subsequence

56 Min Number Of Jumps

57 Water Area

58 Knapsack Problem

59 Disk Stacking

60 Numbers In Pi

61 Topological Sort

62 Boggle Board

63 Continuous Median

64 Find Loop

65 Reverse Linked List

66 Merge Linked Lists

67 Shift Linked List

68 Lowest Common Manager

69 Interweaving Strings

70 Shifted Binary Search

71 Search For Range

72 Quickselect

73 Quick Sort

74 Heap Sort

75 Shorten Path

76 Longest Substring Without Duplication

77 Underscorify Substring

78 Pattern Matcher

79 Multi String Search

**Very Hard**

80 Apartment Hunting

81 Calendar Matching

82 Iterative In-order Traversal

83 Flatten Binary Tree

84 Right Sibling Tree

85 All Kinds Of Node Depths

86 Max Profit With K Transactions

87 Palindrome Partitioning Min Cuts

88 Longest String Chain

89 Knuth–Morris–Pratt

90 Rectangle Mania

91 Merge Sorted Arrays

92 LRU Cache

93 Rearrange Linked List

94 Number Of Binary Tree Topologies

95 Merge Sort

96 Smallest Substring Containing

**Extremely Hard**

97 Right Smaller Than

98 Longest Increasing Subsequence

99 Square Of Zeroes

100 Airport Connections

Resolve the captcha to access the links!