Free course on algorithms and data structuring
Course description:
A complete series that teaches you everything you need to be a professional in data structuring and algorithms. And writing the best code to execute without slowness. Also learn how to analyze the complexity of any algorithm and which one is the best. And learn the answer to any question about data structuring and algorithms in a job interview for a programmer job
What is the data structure? What is an algorithm?
Data structure refers to the structure for storing a set of data. Algorithms are a set of ways to manipulate data.
Integrated data structures and algorithms. Serving an algorithm data structure, an algorithm operates on a specific data structure. Therefore, we cannot isolate data structures in terms of algorithms, nor can we isolate algorithms in terms of data structures.
The data structure is immutable, it is just a way to organize the data. If you don’t run and build algorithms based on that, the existing data structures are useless.
Course contents:
Contents
1- What will we cover in the course || Why Data Structure
Duration : 00:07:36
2- Big-O Notation|| worst case execution
Duration : 00:16:40
3- Array Structure|| matrix structure
Duration : 00:08:39
4- Implement Array in Java
Duration : 00:10:57
5- Dynamic Array Structure|| Dynamic array structure
Duration : 00:06:17
6- implement dynamic array in java
Duration : 00:11:46
7- Linked List Structure|| Structural because you are not
Duration : 00:11:12
8- implement Linked list in java
Duration : 00:08:06
9- Stack Structure|| explained
Duration : 00:08:36
10- implement Stack in Java
Duration : 00:18:13
11- Queue Structure|| explained
Duration : 00:11:36
12- implement Queue in Java
Duration : 00:14:03
13- Linked List Queue Structure|| explained
Duration : 00:04:57
14- implement queue use Linked List in Java
Duration : 00:10:38
15- Hash Table Structure || explained
Duration : 00:11:48
16- Implement Hash-Table in Java
Duration : 00:17:06
17- Refresh Collections|| Ready-made tools for data structuring
Duration: 00:07:30
18- Linear Search Algorithm|| search algorithm
Duration: 00:05:30
19- Linear Search implementation in Java
Duration : 00:05:05
20- Binary Search Algorithm|| search algorithm
Duration : 00:12:34
21- Binary Search implementation in Java
Duration : 00:07:41
22- Interpolation Search Algorithm||Search Algorithm
Duration : 00:05:31
23- Interpolation Search implementation in Java
Duration : 00:03:53
24- Recursion calls
Duration : 00:14:55
25- Bubble sort algorithm || ranking algorithm
Duration : 00:11:29
26 Bubble Sort implementaion in Java
Duration : 00:06:00
27 – Merge sort Algorithm|| ranking algorithm
Duration : 00:07:23
28- Merge Sort implementation in Java
Duration : 00:13:28
29- Heap sort algorithm|| ranking algorithm
Duration : 00:09:32
30- implement Heap Sort in Java
Duration : 00:11:24
31- quick sort algorithm|| ranking algorithm
Duration : 00:07:43
32- Quick Sort implementation in Java
Duration : 00:07:19
33- Binary Tree algorithm|| Binary Tree
Duration : 00:18:53
34- Binary tree implementation in Java
Duration : 00:15:23
35- Graph Representation with Matrix vs Adjacency list|| Data Visualization
Duration : 00:12:39
36- Depth First Search (DFS) || browsing trees
Duration : 00:06:38
37- DFS implementation in Java
Duration : 00:24:21
38- Breadth First Search (BFS) || browsing trees
Duration : 00:05:52
39- BFS implementation in Java
Duration : 00:05:49
40- Nearest Neighbor and Shortest path
Duration : 00:04:42
41- Dijkstra
Duration : 00:11:53
42- A* Algorithm || algorithm
Duration : 00:17:20
43- Dynamic Programming|| Dynamic programming concept
Duration : 00:07:51
44- Dynamic Programming- edit distance|| How does Google know what you’re thinking?
Duration : 00:13:35
45- NP Complete problem|| Unsolvable problems, you may lose your job because of them
Duration : 00:05:12
46- Knapsack problem HW|| Store thief duty
Duration : 00:03:12
41- Dijkstra
Duration : 00:11:53
42- A* Algorithm || algorithm
Duration : 00:17:20
43- Dynamic Programming|| Dynamic programming concept
Duration : 00:07:51
44- Dynamic Programming- edit distance|| How does Google know what you’re thinking?
Duration : 00:13:35
45- NP Complete problem|| Unsolvable problems, you may lose your job because of them
Duration : 00:05:12
46- Knapsack problem HW|| Store thief duty
Duration : 00:03:12