Python Interview Espresso
5h 11m 29s
English
Free
Course description
Learn the algorithms, patterns, and process in Python.
Watch Online
0:00 0:00
| # | Lesson Title | Duration |
|---|---|---|
| 1 | About the course & WHY it was created | 04:12 |
| 2 | About the instructor | 04:32 |
| 3 | How to use this course | 05:27 |
| 4 | A final request | 03:09 |
| 5 | Time & Space Complexity | 13:32 |
| 6 | 1. First Unique Character | 10:47 |
| 7 | 2. Group Anagrams | 09:05 |
| 8 | 3. Valid Palindrome | 11:56 |
| 9 | 4. Valid Parentheses | 10:38 |
| 10 | 5 -- Search Insert Position | 12:06 |
| 11 | 6. Rotate Image | 11:21 |
| 12 | 7. Two Sum | 07:47 |
| 13 | 8. Three Sum | 14:56 |
| 14 | OVERVIEW: Linked Lists | 11:54 |
| 15 | 9. Delete Nth Node from End | 14:04 |
| 16 | OVERVIEW: Recursion | 12:58 |
| 17 | 10. Reverse Linked List | 11:44 |
| 18 | 11. Detect Linked List Cycle | 09:50 |
| 19 | OVERVIEW: Binary Trees | 10:05 |
| 20 | 12. Level Order Traversal | 11:32 |
| 21 | 13. Max Depth of Binary Tree | 17:38 |
| 22 | 14. Validate Binary Search Tree | 10:49 |
| 23 | 15. Balanced Binary Tree | 10:10 |
| 24 | OVERVIEW: Sorting | 05:08 |
| 25 | 16. Merge Sort | 13:38 |
| 26 | 17. Buy and Sell Stock | 05:38 |
| 27 | 18. Coin Change | 14:36 |
| 28 | 19. Longest Common Subsequence | 16:09 |
| 29 | 20. Subsets | 13:01 |
| 30 | Conclusion & What's next | 03:07 |
Want to join the conversation?
Sign in to comment