/ps

  1. Data Structures

    • Arrays
    • Strings
    • Linked Lists
    • Stacks and Queues
    • Hash Tables
    • Trees
      • Binary Trees
      • Binary Search Trees
      • Trie
    • Graphs
    • Heaps

  2. Algorithms

    • Sorting
      • Bubble Sort
      • Selection Sort
      • Insertion Sort
      • Merge Sort
      • Quick Sort
      • Heap Sort
      • Counting Sort
      • Radix Sort
    • Searching
      • Linear Search
      • Binary Search
    • Recursion
    • Dynamic Programming
    • Greedy Algorithms
    • Backtracking
    • Divide and Conquer
    • Graph Algorithms
      • Breadth-First Search (BFS)
      • Depth-First Search (DFS)
      • Shortest Path Algorithms (Dijkstra, Bellman-Ford, Floyd-Warshall)
      • Minimum Spanning Tree (Prim, Kruskal)
    • Bit Manipulation

  3. System Design

    • Design Patterns
    • Scalability
    • Database Design
    • Caching
    • Load Balancing
    • Microservices
    • API Design

  4. Programming Language Concepts

    • Object-Oriented Programming
    • Functional Programming
    • Memory Management
    • Concurrency and Multithreading

  5. Problem-Solving Techniques

    • Time and Space Complexity Analysis
    • Identifying Patterns
    • Breaking Problems into Subproblems
    • Optimization Techniques