Skip to content

Latest commit

 

History

History
532 lines (530 loc) · 30.3 KB

README.md

File metadata and controls

532 lines (530 loc) · 30.3 KB

ShuaTi-Online.Judge.Problems.Solving

A repo to solve online judge problems with explanations. Distributed into several packages based on the problem categories.
Notice that, this readme file is auto-generated by the TocGenerator program.

Table of Solved Problems

The following content is automatically generated.

No. Category Sum Easy Medium Hard
1 Array 3 3 0 0
2 BFS 8 0 8 0
3 Binary Search 3 2 1 0
4 Bit Operation 18 10 7 1
5 Dynamic Programming 1 0 1 0
6 Mathematics 3 2 1 0
7 Stack 2 1 1 0
8 String 9 6 2 1
9 Tree 2 2 0 0
10 Union Find 9 1 7 1
Total 58 27 28 3

No. (Link to src) Difficulty Title (Link to LintCode) Category Note
LintCode2 Easy Trailing Zeros Mathematics
LintCode8 Easy Rotate String Array
LintCode53 Easy Reverse Words in a String String
LintCode60 Easy Search Insert Position Binary Search
LintCode62 Medium Search in Rotated Sorted Array Binary Search
LintCode142 Easy O(1) Check Power of 2 Bit Operation
LintCode176 Medium Route Between Two Nodes in Graph BFS
LintCode178 Medium Graph Valid Tree Union Find
LintCode179 Medium Update Bits Bit Operation
LintCode180 Hard Binary Representation String
LintCode181 Easy Flip Bits Bit Operation
LintCode200 Medium Longest Palindromic Substring String
LintCode236 Easy Swap Bits Bit Operation
LintCode365 Easy Count 1 in Binary Bit Operation
LintCode420 Easy Count and Say String
LintCode431 Medium Connected Component in Undirected Graph BFS
LintCode432 Medium Find the Weak Connected Component in the Directed Graph Union Find
LintCode433 Easy Number of Islands Union Find
LintCode434 Hard Number of Islands II Union Find
LintCode477 Medium Surrounded Regions BFS
LintCode490 Easy Set of Stacks Stack
LintCode589 Medium Connecting Graph Union Find
LintCode590 Medium Connecting Graph II Union Find
LintCode591 Medium Connecting Graph III Union Find
LintCode630 Medium Knight Shortest Path II BFS
LintCode664 Medium Counting Bits Bit Operation
LintCode664 Medium Counting Bits Dynamic Programming
LintCode721 Hard Next Sparse Number Bit Operation
LintCode723 Medium Rotate Bits - Left Bit Operation
LintCode726 Medium Check Full Binary Tree BFS
LintCode750 Medium Portal BFS
LintCode774 Medium Repeated DNA Bit Operation
LintCode805 Medium Maximum Association Set Union Find
LintCode835 Easy Hamming Distance Bit Operation
LintCode987 Easy Binary Number with Alternating Bits Bit Operation
LintCode1031 Medium Is Graph Bipartite? BFS
LintCode1046 Easy Prime Number of Set Bits in Binary Representation Bit Operation
LintCode1056 Easy Find Smallest Letter Greater Than Target Binary Search
LintCode1137 Easy Diameter of Binary Tree Tree
LintCode1138 Easy Can Place Flowers Array
LintCode1173 Easy Reverse Words in a String III String
LintCode1174 Medium Next Greater Element III String
LintCode1181 Easy Diameter of Binary Tree Tree
LintCode1193 Easy Detect Capital String
LintCode1201 Medium Next Greater Element II Stack
LintCode1217 Medium Total Hamming Distance Bit Operation
LintCode1218 Easy Number Complement Bit Operation
LintCode1225 Easy Island Perimeter Array
LintCode1259 Medium Integer Replacement Mathematics
LintCode1262 Medium UTF-8 Validation Bit Operation
LintCode1285 Easy Power of Four Bit Operation
LintCode1294 Easy Power of Three Mathematics
LintCode1296 Medium Maximum Product of Word Lengths Bit Operation
LintCode1332 Easy Number of 1 Bits Bit Operation
LintCode1380 Easy Log Sorting String
LintCode1396 Medium Set Union Union Find
LintCode1445 Easy Delete Characters String
LintCode1446 Medium 01 Matrix Walking Problem BFS