Skip to content

xiaoylu/leetcode_category

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Leetcode by Category

In this repo, I maintain my notes about Leetcode problems. I also included some notes about Lintcode and CodeForce problems.

Topics:

Basic:

  • DFS
  • BFS
  • Back Tracking
  • Binary Search
  • Bit Operation
  • Dynamic Programming (DP)
  • Knapsake Problems
  • Intervals
  • Parentheses Problems
  • Merge Sort
  • Shortest Distance
  • Random Number Generation
  • Regex Matching
  • Tree Traversal
  • Two Pointers Problems
  • Heap
  • Stack
  • Queue
  • kSum Problems

Intermediate:

  • Euler Path/Tour
  • Geometry Problems
  • DP of sequence operations
  • Monotonic Queue
  • Sparse Table
  • Strongly Connected Component
  • Topological Sort
  • Trie
  • Union Find

Advanced:

  • KMP
  • Morris Traversal
  • Segment Tree
  • Binary Index Tree (BIT)
  • Max-flow (and min-cost max-flow)
  • Wavelet Tree
  • Suffix Tree (Ukkonen's algorithm)

Others:

About

Leetcode solutions organized by the problem categories

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy