book

The Self-Taught Computer Scientist

October 2021

Beginner

224 pages

5h 23m

English

Read now

Unlock full access

What You Will LearnWho Is This Book For?Self-Taught Success StoriesGetting StartedSticking with It
Analyzing AlgorithmsConstant TimeLogarithmic TimeLinear TimeLog-Linear TimeQuadratic TimeCubic TimeExponential TimeBest-Case vs. Worst-Case ComplexitySpace ComplexityWhy Is This Important?VocabularyChallenge
When to Use RecursionVocabularyChallenge
Linear SearchWhen to Use a Linear SearchBinary SearchWhen to Use a Binary SearchSearching for CharactersVocabularyChallenge
Bubble SortWhen to Use Bubble SortInsertion SortWhen to Use Insertion SortMerge SortWhen to Use Merge SortSorting Algorithms in PythonVocabularyChallenge
Anagram DetectionPalindrome DetectionLast DigitCaesar CipherVocabularyChallenge
BinaryBitwise OperatorsFizzBuzzGreatest Common FactorEuclid's AlgorithmPrimesVocabularyChallenge

VocabularyChallenge
Array PerformanceCreating an ArrayMoving ZerosCombining Two ListsFinding the Duplicates in a ListFinding the Intersection of Two ListsVocabularyChallenge
Linked List PerformanceCreate a Linked ListSearch a Linked ListRemoving a Node from a Linked ListFinding a Linked List CycleVocabularyChallenges
When to Use StacksCreating a StackUsing Stacks to Reverse StringsMin StackStacked ParenthesesVocabularyChallenges
When to Use QueuesCreating a QueuePython's Built-In Queue ClassCreate a Queue Using Two StacksVocabularyChallenge
When to Use Hash TablesCharacters in a StringTwo SumVocabularyChallenge
When to Use TreesCreating a Binary TreeBreadth-First Tree TraversalMore Tree TraversalsInvert a Binary TreeVocabularyChallenges
When to Use HeapsCreating a HeapConnecting Ropes with Minimal CostVocabularyChallenge
When to Use GraphsCreating a GraphDijkstra's AlgorithmVocabularyChallenge
What’s Next?Climbing the Freelance LadderHow to Get an InterviewHow to Prepare for a Technical InterviewAdditional ResourcesFinal Thoughts