lthieu's notes

Home

❯

DSA Mastery

❯

01 Big Tech Foundation

Folder: DSA-Mastery/01-Big-Tech-Foundation

12 items under this folder.

  • May 02, 2026

    01-Complexity-and-Array

    • May 02, 2026

      02-Linked-List-Dummy-Node

      • May 02, 2026

        03-Stack-and-Queue

        • May 02, 2026

          04-Recursion-and-Backtracking

          • May 02, 2026

            05-Binary-Search

            • binary-search
            • algorithms
            • FAANG
            • searching
            • two-pointers-adjacent
          • May 02, 2026

            06-Sorting-Merge-Quick

            • sorting
            • merge-sort
            • quick-sort
            • divide-and-conquer
            • inversions
            • FAANG
          • May 02, 2026

            07-Hash-Table

            • hash-table
            • hashmap
            • set
            • frequency-counting
            • FAANG
            • prefix-sum
          • May 02, 2026

            08-Tree-DFS-BFS

            • dsa
            • tree
            • dfs
            • bfs
            • binary-tree
            • bst
            • faang
            • algorithm
          • May 02, 2026

            09-Graph-DFS-BFS

            • dsa
            • graph
            • dfs
            • bfs
            • topological-sort
            • cycle-detection
            • faang
            • algorithm
          • May 02, 2026

            10-Heap

            • dsa
            • heap
            • priority-queue
            • top-k
            • median
            • faang
            • algorithm
          • May 02, 2026

            11-Practice-Big-Tech-1

            • May 02, 2026

              12-Practice-Big-Tech-2


              Created with Quartz v4.5.2 © 2026

              • GitHub
              • Discord Community