Computer Science

Table of Articles

Interactive roadmap and deep dives in this category.

• 📂 Computer Science

  • Introduction
  • 📂 Data Structures

    • Introduction
    • 📂 Arrays

      • Introduction
      • 📂 Basic Operations

        • Introduction
        • Traversal
        • Insertion
        • Removal
      • 📂 Basic Problems

        • Introduction
        • Create and fill array
        • Linear Search
        • Sum elements
        • Maximum and Minimum
        • Reverse
        • Rotation
        • Sort a binary array
      • 📂 Array of Arrays

        • Introduction
        • Initialize and access
        • Traversal/Iteration
      • Dynamic Arrays
    • 📂 Linked Lists

      • Introduction
      • Basic Implementation
      • Memory Management
      • Different types
      • Applications
      • 📂 Basic Operations

        • Introduction
        • Traversal
        • Find Tail Node
        • Insertion
        • Deletion
      • 📂 Basic Problems

        • Introduction
        • Search for a value
        • Merge Multiple Linked Lists
        • Find Middle Node(s)
        • Reverse linked list
        • Remove duplicates
        • Merge two sorted linked lists
      • 📂 Advanced Problems

        • Introduction
        • Detect and Remove Loops
        • Find Intersection
        • Palindrome Check
      • Advantages and Disadvantages
      • Linked Lists vs Arrays
      • 📂 Singly Linked List Implementations

        • Introduction
        • Python Implementation
        • C Implementation
        • CPP Implementation
        • Javascript Implementation
    • 📂 Hash Tables

      • Introduction
      • How Hash Tables Work
      • Hash Functions
      • Operations
      • Time and Space Complexity
      • Load Factor and Rehashing
      • 📂 Collision resolution

        • Introduction
        • Separate Chaining
        • 📂 Open Addressing

          • Introduction
          • Linear Probing Technique
          • Quadratic Probing Technique
          • Double Hashing Technique
        • Comparing Collision Resolution Techniques
      • Implementations
      • 📂 Basic Problems

        • Introduction
        • Word Frequency Counter
        • Find Duplicates
        • Group Anagrams Together
        • Finding Common Elements
        • Two Sum Problem Using Hash Tables
        • First Non Repeating Character
      • 📂 Advanced Concepts

        • Introduction
        • Perfect Hashing
        • Universal Hashing
        • Consistent Hashing
        • Bloom Filters
        • Cuckoo Hashing
      • 📂 vs Other Data Structures

        • Introduction
        • Hash Tables vs Arrays
        • Hash Tables vs Binary Search Trees
        • Hash Tables vs Linked Lists
      • Applications
      • Hash Table Best Practices
      • QnA on Hash Tables
    • 📂 Stacks

      • Introduction
      • Array Implementation
      • Linked List Implementation
      • 📂 Basic Problems

        • Introduction
        • Implement Queue using Stack Data Structure
        • Check for balanced Parenthesis
    • 📂 Queues

      • Introduction
      • Array Implementation
      • Linked List Implementation
      • 📂 Basic Problems

        • Introduction
        • Process and print jobs in a Queue in order
        • Implement Stack using Queue Data Structure
    • 📂 Binary Trees

      • Introduction
      • Use Cases
      • Types
      • Implementation
      • 📂 Traversal Techniques

        • Introduction
        • Pre-Order Traversal
        • In-Order Traversal
        • Post-Order Traversal
        • Level Order Traversal
      • 📂 Basic Problems

        • Introduction
        • Height of a binary tree
        • Search for a value
    • 📂 Binary Search Trees

      • Introduction
      • Red-Black Trees
      • AVL Trees
    • 📂 Other Trees

      • Introduction
      • Binary Heaps
      • Tries / Prefix Trees
      • Fenwick Trees (BIT)
    • 📂 Graphs

      • Introduction
      • 📂 Representation

        • Introduction
        • Edge List
        • Adjacency List
        • Adjacency Matrix
        • 📂 Conversions

          • Introduction
          • Edge List - Adjacency List
          • Edge List - Adjacency Matrix
          • Adjacency List - Adjacency Matrix
      • 📂 Graph Traversal Techniques

        • Introduction
        • 📂 Depth First Search

          • Introduction
          • How DFS Works
          • Pseudocode & Explanation
          • 📂 Implementations

            • Introduction
            • Python Implementation
            • Java Implementation
            • CPP Implementation
            • Javascript Implementation
          • Time and Space Complexity
          • Applications
          • Common Mistakes
          • Visualization
          • 📂 Graph Advanced DFS Techniques

            • Introduction
            • Graph DFS With Pruning
            • Graph Iterative Deepening DFS
            • Bidirectional DFS
        • Breadth First Search
        • DFS vs BFS
      • 📂 Basic Problems

        • Introduction
        • Group Connected Nodes
        • Detect Cycles
        • Find Number of Islands
      • Directed Acyclic Graphs (DAGs)
      • Topological Sorting
      • 📂 Shortest Path Algorithms

        • Introduction
        • Breadth-First Search
        • Dijkstra's Algorithm
        • Bellman-Ford Algorithm
      • 📂 Strongly Connected Components

        • Introduction
        • Kosaraju's Algorithm
        • Tarjan's Algorithm
      • 📂 Minimum Spanning Tree

        • Introduction
        • Kruskal's Algorithm
        • Prim's Algorithm
      • 📂 Flow Networks

        • Introduction
  • 📂 Algorithms

    • Introduction
    • 📂 Algorithmic Techniques

      • Introduction
      • Brute Force
      • Recursion
      • Memoization
      • Dynamic Programming
    • 📂 Array algorithms

      • Introduction
      • Majority Voting Algorithm
      • Juggling/Dolphins Algorithm
      • Kadane's Algorithm
      • Dutch National Flag problem
    • 📂 Sorting Algorithms

      • Introduction
      • 📂 Insertion Sort

        • Introduction
        • How Insertion Sort Works
        • Pseudocode & Explanation
        • 📂 Implementations

          • Introduction
          • Python Implementation
          • Java Implementation
          • CPP Implementation
          • C Implementation
        • Common Mistakes
        • Time and Space Complexity
        • Advantages and Disadvantages
        • 📂 vs Other Algorithms

          • Introduction
          • Insertion Sort vs Bubble Sort
          • Insertion Sort vs Selection Sort
          • Insertion Sort vs Merge Sort
          • Insertion Sort vs Quick Sort
        • Visualization
      • 📂 Bubble Sort

        • Introduction
        • Algorithm
        • Pseudocode & Explanation
        • 📂 Implementations

          • Introduction
          • Python Implementation
          • Java Implementation
          • CPP Implementation
          • C Implementation
          • Javascript Implementation
        • Common Mistakes
        • Time and Space Complexity
        • Advantages and Disadvantages
        • Visualization
      • 📂 Selection Sort

        • Introduction
        • How Selection Sort Works
        • Pseudocode & Explanation
        • 📂 Implementations

          • Introduction
          • Python Implementation
          • Java Implementation
          • CPP Implementation
          • Javascript Implementation
        • Common Mistakes
        • Time and Space Complexity
        • Advantages and Disadvantages
        • Visualization
      • 📂 Merge Sort

        • Introduction
        • Merge two sorted arrays
        • Algorithm
        • 📂 Implementations

          • Introduction
          • CPP Implementation
          • Java Implementation
          • C Implementation
        • Time and Space Complexity
        • Advantages and Disadvantages
        • Visualization
      • 📂 Quick Sort

        • Introduction
        • Partitioning in Quick Sort
        • How Quick Sort Works
        • Quick Sort Pivot Selection Strategies
        • Pseudocode & Explanation
        • 📂 Implementations

          • Introduction
          • Python Implementation
          • Java Implementation
          • CPP Implementation
          • C Implementation
          • Javascript Implementation
        • Time and Space Complexity
        • Optimizations
        • Common Mistakes
        • Advantages and Disadvantages
        • Visualization
      • Counting Sort
    • Union Find
    • 📂 Binary Search

      • Introduction
      • How Binary Search Works
      • Pseudocode & Explanation
      • 📂 Implementations

        • Introduction
        • Python Implementation
        • Java Implementation
        • C and CPP Implementation
      • Common Implementation Mistakes
      • Time and Space Complexity
      • Applications
      • Advantages and Disadvantages
  • Modular Arithmetic
  • Floyd's Cycle Finding Algorithm
  • 📂 Miscellaneous

    • Introduction
    • Subtract two lists in python
    • Copying Arrays in C