# BaseCS Article Table of Contents [BaseCS](https://medium.com/basecs) is Computer Science content produced by [Vaidehi Joshi](https://medium.com/@vaidehijoshi) ## Scope Broadly, this represents the most commonly referenced computer science topics especially within the context of engineering interviews: * Strings * Arrays * Linked Lists * Big O * Hash Tables * Binary Trees, BFS, DFS, BST, Heaps * Sorting Algorithms * Backtracking and Recursive Algorithms * Bit Manipulation * Stacks/Queues * Dynamic Programming * Greedy Algorithms * Graphs The BaseCS articles on these topics and more are covered below. ## Fundamental Theory * [Bits and Bytes](https://medium.com/basecs/bits-bytes-building-with-binary-13cb4289aafa) * [Hexes](https://medium.com/basecs/hexs-and-other-magical-numbers-9785bc26b7ee) * [Set Theory](https://medium.com/basecs/set-theory-the-method-to-database-madness-5ec4b4f05d79) * [Logarithms](https://medium.com/basecs/looking-for-the-logic-behind-logarithms-9e79d7666dda) ## Data Structures * [Linked Lists](https://medium.com/basecs/whats-a-linked-list-anyway-part-1-d8b7e6508b9d) + [Part 2](https://medium.com/basecs/whats-a-linked-list-anyway-part-2-131d96f71996) * [Hash Tables](https://medium.com/basecs/taking-hash-tables-off-the-shelf-139cbf4752f0) * [Queues](https://medium.com/basecs/to-queue-or-not-to-queue-2653bcde5b04) * [Stacks](https://medium.com/basecs/stacks-and-overflows-dbcf7854dc67) ### Graphs * [Graph Theory](https://medium.com/basecs/a-gentle-introduction-to-graph-theory-77969829ead8) * [Graphs](https://medium.com/basecs/from-theory-to-practice-representing-graphs-cfd782c5be38) * [BFS Graph Traversal](https://medium.com/basecs/going-broad-in-a-graph-bfs-traversal-959bd1a09255) * [DFS Graph Traversal](https://medium.com/basecs/deep-dive-through-a-graph-dfs-traversal-8177df5d0f13) * [Acyclic Graphs](https://medium.com/basecs/spinning-around-in-cycles-with-directed-acyclic-graphs-a233496d4688) * [Königsberg](https://medium.com/basecs/k%C3%B6nigsberg-seven-small-bridges-one-giant-graph-problem-2275d1670a12) ### Trees * [Basics of Trees](https://medium.com/basecs/how-to-not-be-stumped-by-trees-5f36208f68a7) * [Leaf Overview](https://medium.com/basecs/leaf-it-up-to-binary-trees-11001aaf746d) * [Breadth-first Search](https://medium.com/basecs/breaking-down-breadth-first-search-cebe696709d9) * [Depth-first Search](https://medium.com/basecs/demystifying-depth-first-search-a7c14cccf056) * [Heaps](https://medium.com/basecs/learning-to-love-heaps-cef2b273a238) * [Tries](https://medium.com/basecs/trying-to-understand-tries-3ec6bede0014) * [Radix Trees](https://medium.com/basecs/compressing-radix-trees-without-too-many-tears-a2e658adb9a0) * [AVL Trees](https://medium.com/basecs/the-little-avl-tree-that-could-86a3cae410c7) * [Red-Black Trees](https://medium.com/basecs/painting-nodes-black-with-red-black-trees-60eacb2be9a5) * [B-Trees](https://medium.com/basecs/busying-oneself-with-b-trees-78bbf10522e7) ## Algorithms * [Hashing Algorithms](https://medium.com/basecs/hashing-out-hash-functions-ea5dd8beb4dd) * [Fibonacci](https://medium.com/basecs/finding-fibonacci-in-golden-trees-1c8967b1f47a) ### Sorting * [Sorting Algorithms Overview](https://medium.com/basecs/sorting-out-the-basics-behind-sorting-algorithms-b0a032873add) * [Selection Sort](https://medium.com/basecs/exponentially-easy-selection-sort-d7a34292b049) * [Bubble Sort](https://medium.com/basecs/bubbling-up-with-bubble-sorts-3df5ac88e592) * [Insertion Sort](https://medium.com/basecs/inching-towards-insertion-sort-9799274430da) * [Merge Sort: Part One](https://medium.com/basecs/making-sense-of-merge-sort-part-1-49649a143478) * [Merge Sort: Part Two](https://medium.com/basecs/making-sense-of-merge-sort-part-2-be8706453209) * [Quick Sort: Part One](https://medium.com/basecs/pivoting-to-understand-quicksort-part-1-75178dfb9313) * [Quick Sort: Part Two](https://medium.com/basecs/pivoting-to-understand-quicksort-part-2-30161aefe1d3) * [Heap Sort](https://medium.com/basecs/heapify-all-the-things-with-heap-sort-55ee1c93af82) * [Counting Sort](https://medium.com/basecs/counting-linearly-with-counting-sort-cd8516ae09b3)