Data Structure and Algorithms Analysis - Job Interview
- Description
- Curriculum
- FAQ
- Reviews
This course prepared depending on my real Software Engineer job interviews experiences with Google, Microsoft, Amazon, and Snapchat.
In this course you will learn how to Analysis algorithms like Sorting, Searching, and Graph algorithms. And how to reduce the code complexity from one Big-O level to another level. Furthermore, you will learn different type of Data Structure for your code. Also you will learn how to find Big-O for every data structure, and how to apply correct Data Structure to your problem in Java. By the end you will be able to write code that run faster and use low memory. You Also will learn how to analysis problems using Dynamic programming.
We will discus code complexity in Different algorithms like Sorting algorithms ( Bubble, Merge, Heap, and quick sort) , searching algorithms ( Binary search, linear search, and Interpolation), Graph algorithms( Binary tree, DFS, BFS, Nearest Neighbor and Shortest path, Dijkstra’s Algorithm, and A* Algorithm). and Data Structure like Dynamic Array, Linked List, Stack, Queue, and Hash-Table
-
9
Why Data Structure? -
10
One-Dimension Array
-
11
One-Dimension Array implementation in Java
-
12
Amazon Interview: Find longest sequence of 1’s with one flip
-
13
Two-Dimension Array
-
14
Two-Dimension Array implementation in Java
-
15
Facebook Interview: Spiral Matrix
-
16
Dynamic Array
-
17
Dynamic Array implementation in Java
-
18
Linked List
-
19
Linked List implementation in Java
-
20
Doubly Linked List implementation in Java
-
21
Amazon Interview: Remove Kth Node From End of List
-
22
HW||Combine two Linked List (Google Interview Question)
-
23
Compare Linked List vs Array
-
24
Hash-Table
-
25
Hash-Table implementation in Java
-
26
Amazon Interview: Find unique number in Array
-
27
Amazon Interview: Key Phrase problem: TF-IDF
-
28
Stack
-
29
Stack implementation in Java Use Array
-
30
Amazon Interview: Recursive Staircase Problem
-
31
Uber Interview question: word distance
-
32
Coding Interview : Parentheses Expression
-
33
Stack implementation in Java Use Dynamic Array
-
34
Stack implementation in Java Use Linked List
-
35
Queue
In this section you will learn how to work with queue
-
36
Queue implementation in Java Use Array
-
37
Microsoft Interview question: Friend Circles
-
38
Queue implementation in Java Use Dynamic Array
-
39
Queue implementation in Java Use Linked List
-
40
Priority queue
-
41
Amazon Interview: Kth top movies
-
42
HW||Best data structure for Array With Many Zeros (Google Interview Question)
-
58
Bubble sort
-
59
Bubble Sort implementation in Java
-
60
Selection Sort
-
61
Select Sort implementation in Java
-
62
Quick Sort
-
63
Quick Sort implementation in Java
-
64
Merge Sort
-
65
Merge Sort implementation in Java
-
66
Heap Sort
-
67
Heap Sort implementation in Java
-
68
Coding Interview: Two words have same characters job interview
-
69
Binary Tree and Binary Search Tree
-
70
Binary Search Tree implementation in Java
-
71
Amazon Interview: Find path between two nodes
-
72
Facebook Interview: Find if two binary search trees are equal
-
73
Google Interview: Determines if two BST are equal ( Another solution)
-
74
Coding Interview: Serialize and Deserialize a Binary Tree
-
75
Google Interview Question: Check if two trees are Mirror
-
76
Amazon Interview Question: Level by Level Printing of Binary Tree
-
77
HW||Find SubTrees (Google Interview Question)
-
78
Problem of the Day
-
79
Red-Black Tree
