GoodTecher

Be a Good Techer and Tech for Good. www.goodtecher.com

Skip to content
Menu
  • Home
  • LeetCode
    • Array
    • Binary Search
    • Binary Tree
    • Depth First Search
    • Design
    • Dynamic Programming
    • Linked List
    • Math
    • Stack
    • String
    • Two Pointers
    • Union Find
  • Useful

Category: Useful

  • Posted on January 31, 2021January 31, 2021
  • Useful

Big-O notation

It would be convenient to have a form of asymptotic notation that means “the running time grows at most this…

Continue Reading
  • Posted on January 6, 2021January 6, 2021
  • Useful

Backtracking

Backtracking is an algorithm for finding all solutions by exploring all potential candidates. If the solution candidate turns to be not a solution,…

Continue Reading
  • Posted on September 1, 2018September 3, 2020
  • Useful

Union Find

Union Find is a data structure to find whether two elements in the same group (Find) merge two groups of…

Continue Reading

Follow GoodTecher

Categories

  • HackerRank (1)
  • Interview (7)
  • LeetCode (588)
    • Array (185)
    • Backtracking (18)
    • Binary Search (19)
    • Binary Tree (63)
    • Bit Manipulation (15)
    • Database (40)
    • Depth First Search (6)
    • Design (10)
    • Dynamic Programming (17)
    • Graph (18)
    • Greedy (5)
    • Heap (1)
    • Linked List (26)
    • Math (36)
    • Recursion (3)
    • Sorting (11)
    • Stack (11)
    • String (95)
    • Two Pointers (12)
    • Union Find (2)
  • Machine Learning (7)
  • Technical Solutions (2)
  • Useful (3)
© Copyright 2025 – GoodTecher
Cell Theme by DesignOrbital ⋅ Powered by WordPress