search

hand-waveOverview

This repository contains my personal notes and solutions for algorithm and data structure problems, primarily focused on LeetCode interview questions.

The notes are written and organized in GitBook, and this repository serves as the synchronized source of truth on GitHub.

hashtag
📌 Purpose

  • Systematically document algorithmic problem-solving patterns

  • Build reusable mental models for common data structures and techniques

  • Record key insights, edge cases, and complexity analyses

  • Prepare for software engineering technical interviews

hashtag
📚 Content Overview

The notes are organized by topic, including (but not limited to):

  • Binary Search

  • Array

  • Two Pointers

  • Linked List

  • Hash Map/Set

  • String

  • Stack, Queue, Heap

  • Tree

  • Backtracking

  • Greedy

  • Dynamic Programming

  • Prefix Sum/Product

  • Graph

  • Bit Manipulation

  • Trie

  • Cache Schedule Mechanism

  • Math

  • Divide & Conquer

Each problem entry typically includes:

  • Problem number and name

  • Optimal approach link

  • Time and space complexity

  • (Optional) Key idea/intuition

hashtag
🔄 Sync with GitBook

This repository is automatically synced with a GitBook project.

  • GitHub is used for version control and backup

  • GitBook provides a clean reading and navigation experience

👉 You can read the notes directly via GitBook: https://lby-organization.gitbook.io/lby-algorithm-notesarrow-up-right

NextChecklist for Programming Practices

Last updated