python_books:selftaught_computer_scientist
Differences
This shows you the differences between two versions of the page.
Next revision | Previous revision | ||
python_books:selftaught_computer_scientist [2024/10/18 19:30] – created adminguide | python_books:selftaught_computer_scientist [2024/10/20 16:28] (current) – removed adminguide | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== The Self-Taught Computer Scientist ====== | ||
- | The Beginners guide to data structures & algorithms | ||
- | |||
- | Table of Contents | ||
- | Cover | ||
- | Title Page | ||
- | Introduction | ||
- | What You Will Learn | ||
- | Who Is This Book For? | ||
- | Self-Taught Success Stories | ||
- | Getting Started | ||
- | Sticking with It | ||
- | I: Introduction to Algorithms | ||
- | 1 What Is an Algorithm? | ||
- | Analyzing Algorithms | ||
- | Constant Time | ||
- | Logarithmic Time | ||
- | Linear Time | ||
- | Log-Linear Time | ||
- | Quadratic Time | ||
- | Cubic Time | ||
- | Exponential Time | ||
- | Best-Case vs. Worst-Case Complexity | ||
- | Space Complexity | ||
- | Why Is This Important? | ||
- | Vocabulary | ||
- | Challenge | ||
- | 2 Recursion | ||
- | When to Use Recursion | ||
- | Vocabulary | ||
- | Challenge | ||
- | 3 Search Algorithms | ||
- | Linear Search | ||
- | When to Use a Linear Search | ||
- | Binary Search | ||
- | When to Use a Binary Search | ||
- | Searching for Characters | ||
- | Vocabulary | ||
- | Challenge | ||
- | 4 Sorting Algorithms | ||
- | Bubble Sort | ||
- | When to Use Bubble Sort | ||
- | Insertion Sort | ||
- | When to Use Insertion Sort | ||
- | Merge Sort | ||
- | When to Use Merge Sort | ||
- | Sorting Algorithms in Python | ||
- | Vocabulary | ||
- | Challenge | ||
- | 5 String Algorithms | ||
- | Anagram Detection | ||
- | Palindrome Detection | ||
- | Last Digit | ||
- | Caesar Cipher | ||
- | Vocabulary | ||
- | Challenge | ||
- | 6 Math | ||
- | Binary | ||
- | Bitwise Operators | ||
- | FizzBuzz | ||
- | Greatest Common Factor | ||
- | Euclid' | ||
- | Primes | ||
- | Vocabulary | ||
- | Challenge | ||
- | 7 Self-Taught Inspiration: | ||
- | II: Data Structures | ||
- | 8 What Is a Data Structure? | ||
- | Vocabulary | ||
- | Challenge | ||
- | 9 Arrays | ||
- | Array Performance | ||
- | Creating an Array | ||
- | Moving Zeros | ||
- | Combining Two Lists | ||
- | Finding the Duplicates in a List | ||
- | Finding the Intersection of Two Lists | ||
- | Vocabulary | ||
- | Challenge | ||
- | 10 Linked Lists | ||
- | Linked List Performance | ||
- | Create a Linked List | ||
- | Search a Linked List | ||
- | Removing a Node from a Linked List | ||
- | Finding a Linked List Cycle | ||
- | Vocabulary | ||
- | Challenges | ||
- | 11 Stacks | ||
- | When to Use Stacks | ||
- | Creating a Stack | ||
- | Using Stacks to Reverse Strings | ||
- | Min Stack | ||
- | Stacked Parentheses | ||
- | Vocabulary | ||
- | Challenges | ||
- | 12 Queues | ||
- | When to Use Queues | ||
- | Creating a Queue | ||
- | Python' | ||
- | Create a Queue Using Two Stacks | ||
- | Vocabulary | ||
- | Challenge | ||
- | 13 Hash Tables | ||
- | When to Use Hash Tables | ||
- | Characters in a String | ||
- | Two Sum | ||
- | Vocabulary | ||
- | Challenge | ||
- | 14 Binary Trees | ||
- | When to Use Trees | ||
- | Creating a Binary Tree | ||
- | Breadth-First Tree Traversal | ||
- | More Tree Traversals | ||
- | Invert a Binary Tree | ||
- | Vocabulary | ||
- | Challenges | ||
- | 15 Binary Heaps | ||
- | When to Use Heaps | ||
- | Creating a Heap | ||
- | Connecting Ropes with Minimal Cost | ||
- | Vocabulary | ||
- | Challenge | ||
- | 16 Graphs | ||
- | When to Use Graphs | ||
- | Creating a Graph | ||
- | Dijkstra' | ||
- | Vocabulary | ||
- | Challenge | ||
- | 17 Self-Taught Inspiration: | ||
- | 18 Next Steps | ||
- | What’s Next? | ||
- | Climbing the Freelance Ladder | ||
- | How to Get an Interview | ||
- | How to Prepare for a Technical Interview | ||
- | Additional Resources | ||
- | Final Thoughts | ||
- | |||
python_books/selftaught_computer_scientist.1729279814.txt.gz · Last modified: by adminguide