Description
Almost all other courses focus on knowledge. In this course, we focus on gaining real skills.
Overall:
- The course covers basic to advanced data structures
- Learn the inner details of the data structures and their time & memory complexity analysis
- Learn how to code line-by-line
- Source code and Slides and provided for all content
- An extensive amount of practice to master the taught data structures (where most other content fails!)
Content:
- Asymptotic Complexity
- Arrays
- Singly Linked List
- Doubly Linked List
- Project: Sparse Array and Matrix
- Coming Topics
- Stack
- Queue
- Binary Tree
- Binary Search Tree
- Binary Heap
- AVL Tree
- Letter Tree (Trie)
- Hash Table
- Extensive Homework sets with video solutions
Teaching Style:
- Instead of long theory then coding style, we follow a unique style
- I parallelize the concepts with the codes as much as possible
- Go Concrete as possible
- Use Clear Visualization
By the end of the journey
- Solid understanding of Data Structures topics in Python
- Mastering different skills
- Analytical and Problem-Solving skills
- Clean coding for data structures
- Black-box applying on DS
- With the administered problem-solving skills
- You can start competitive programming smoothly [DS type]
- Smooth start in Algorithms course
- One more step toward interviews preparation
Prerequisites
- Strong Programming Skills:
- Built-in Data Structures: list, tuple, set, dictionary
- Comfortable with recursive functions
- Basic Programming Problem-Solving Skills
- That is; solved a lot on the basic topics
- Use IDE Debugger
- Preferred:
- Project Building Skills
About the Instructor (relevant experience): I was ICPC Finalists in 2010 where algorithms and data structures are the key to success. Learning the exact inner details of these algorithms and how to build real experience compare to others is an important key. For more about me, visit my website.
