Categories

There are currently no items in your shopping cart.

User Panel

Forgot your password?.

Data Structures & Algorithms Part 1 2019-8

Video Introducing this tutorial

1- Course Outline
1- Introduction
2- What is Big O
3- O(1)
4- O(n)
5- O(n^2)
6- O(log n)
7- O(2^n)
8- Space Complexity
1- Introduction
2- Understanding Arrays
3- Working with Arrays in Java
4- Exercise- Array Class
5- Solution- Creating the Class
6- Solution- insert()
7- Solution- removeAt()
8- Solution- indexOf()
9- Dynamic Arrays
11- Summary
1- Introduction
2- What are Linked Lists
3- Working with Linked Lists
4- Exercise- Building a Linked List
5- Solution- addLast
6- Solution- addFirst
7- Solution- indexOf
8- Solution- contains
9- Solution- removeFirst
10- Solution- removeLast()
11- Implementing size()
12- Converting Linked Lists to Arrays
13- Cheat Sheets
14- Arrays vs Linked Lists
15- Types of Linked Lists
16- Exercise- Reversing a Linked List
17- Solution- Reversing a Linked List
18- Exercise- Kth Node from the End
19- Solution- Kth Node from the End
21- Summary
1- Introduction
2- What are Stacks
3- Working with Stacks
4- Exercise- Reversing a String
5- Solution - Reversing a String
6- Exercise- Balanced Expressions
7- Solution- A Basic Implementation
8- Solution- Supporting Other Brackets
9- Solution- First Refactoring
10- Solution- Second Refactoring
11- Exercise- Building a Stack Using an Array
12- Solution- Implementing a Stack Using an Array
14- Summary
1- Introduction
2- What are Queues
3- Queues in Java
4- Exercise- Reversing a Queue
5- Solution- Reversing a Queue
6- Exercise- Building a Queue Using an Array
7- Solution- A Basic Implementation
8- Solution- Circular Arrays
9- Exercise- Implementing a Queue Using a Stack
10- Solution- Building a Queue Using a Stack
11- Priority Queues
12- Exercise- Building a Priority Queue
13- Solution- Building a Priority Queue
14- Solution- Refactoring
16- Summary
1- Introduction
3- Working with Hash Tables
4- Exercise- Find the First Non-repeated Character
5- Solution- First Non-repeating Character
6- Sets
7- Exercise- First Repeated Character
8- Solution- First Repeated Character
9- Hash Functions
10- Collisions
11- Chaining
12- Open Addressing- Linear Probing
13- Open Addressing- Quadratic Probing
14- Open Addressing- Double Hashing
15- Exercise- Build a HashTable
16- Solution- put()
17- Solution- get()
18- Solution- remove()
19- Solution- Refactoring
2- What are Hash Tables
21- Summary
22- Course Wrap Up