4.34 out of 5
4.34
2549 reviews on Udemy

Data Structure and Algorithms Analysis – Job Interview

Write code run faster, use less memory and prepare for Software Engineer Interview with real interview questions
Instructor:
Hussein Alrubaye
65,613 students enrolled
English [Auto]
Write code that run faster, and use less memory
Learn Data Structure and how to apply these Data Structures on problems in Java
Solve coding questions have been seen in Google, Apple, Microsoft, and Amazon job interview.
Learn algorithms analysis and implementation.
Prepare for job interview
Learn problem solving strategies
Learn how to find complexity of code and algorithms

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

Introduction and Settings

1
Introduction
2
Interview triks
3
Install Java JDK
4
Install Eclipse
5
Exercise files

Code Complexity

1
Code Complexity|| Big-O, Omega and Theta
2
Big-O Examples
3
Code complexicity

Data Structure

1
Why Data Structure?
2
One-Dimension Array
3
One-Dimension Array implementation in Java
4
Amazon Interview: Find longest sequence of 1’s with one flip
5
Two-Dimension Array
6
Two-Dimension Array implementation in Java
7
Facebook Interview: Spiral Matrix
8
Dynamic Array
9
Dynamic Array implementation in Java
10
Linked List
11
Linked List implementation in Java
12
Doubly Linked List implementation in Java
13
Amazon Interview: Remove Kth Node From End of List
14
HW||Combine two Linked List (Google Interview Question)
15
Compare Linked List vs Array
16
Hash-Table
17
Hash-Table implementation in Java
18
Amazon Interview: Find unique number in Array
19
Amazon Interview: Key Phrase problem: TF-IDF
20
Stack
21
Stack implementation in Java Use Array
22
Amazon Interview: Recursive Staircase Problem
23
Uber Interview question: word distance
24
Coding Interview : Parentheses Expression
25
Stack implementation in Java Use Dynamic Array
26
Stack implementation in Java Use Linked List
27
Queue

In this section you will learn how to work with queue

28
Queue implementation in Java Use Array
29
Microsoft Interview question: Friend Circles
30
Queue implementation in Java Use Dynamic Array
31
Queue implementation in Java Use Linked List
32
Priority queue
33
Amazon Interview: Kth top movies
34
HW||Best data structure for Array With Many Zeros (Google Interview Question)

Collections In Java

1
Data Structure functions in Java
2
ArrayList
3
LinkedList
4
HashMap
5
TreeSet HashSet
6
Stack
7
Queue and Priority Queue
8
Sort array of Objects
9
Recursion

Searching Algorithms

1
Linear Search
2
Linear Search implementation in Java
3
Binary Search
4
Binary Search implementation in Java
5
Interpolation Search
6
Interpolation Search implementation in Java

Sorting Algorithms

1
Bubble sort
2
Bubble Sort implementation in Java
3
Selection Sort
4
Select Sort implementation in Java
5
Quick Sort
6
Quick Sort implementation in Java
7
Merge Sort
8
Merge Sort implementation in Java
9
Heap Sort
10
Heap Sort implementation in Java
11
Coding Interview: Two words have same characters job interview

Tree Theory

1
Binary Tree and Binary Search Tree
2
Binary Search Tree implementation in Java
3
Amazon Interview: Find path between two nodes
4
Facebook Interview: Find if two binary search trees are equal
5
Google Interview: Determines if two BST are equal ( Another solution)
6
Coding Interview: Serialize and Deserialize a Binary Tree
7
Google Interview Question: Check if two trees are Mirror
8
Amazon Interview Question: Level by Level Printing of Binary Tree
9
HW||Find SubTrees (Google Interview Question)
10
Problem of the Day
11
Red-Black Tree

Graph Theory

1
Matrix and Adjacency List
2
Depth First Search(DFS)
3
DFS implementation in Java
4
Breadth First Search (BFS)
5
BFS implementation in Java
6
Google Interview: Word Break problem
7
Backtracking
8
Preorder and PostOrder
9
HW||Visit Cities in best Weather (Google Interview Question)
10
Trip Planer Google Interview
11
Finding the shortest path ( Amazon + Google) Interview Question
12
HW|| Nearest post office HW explain (Microsoft Interview Question)
13
Nearest post office
You can view and review the lecture materials indefinitely, like an on-demand channel.
Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don't have an internet connection, some instructors also let their students download course lectures. That's up to the instructor though, so make sure you get on their good side!
4.3
4.3 out of 5
2549 Ratings

Detailed Rating

Stars 5
1482
Stars 4
605
Stars 3
290
Stars 2
97
Stars 1
71
d148bae734ead970ddb5a2210ff9aba8
30-Day Money-Back Guarantee

Includes

15 hours on-demand video
1 article
Full lifetime access
Access on mobile and TV
Certificate of Completion