All notable changes to this project will be documented in this file. See commit-and-tag-version for commit guidelines.
2.4.1 (2024-04-01)
- change release tool (1d35d26)
- vitest: drop CJS configuration file (c037d8e)
2.4.0 (2022-04-30)
- CI: add multiple environment for testing (fead0f9)
- CI: reduce virtual machines efforts (02ec1f6)
- CI: switch from
coverallstocodecov(30b549e) - deps-bot: change PR concurrent limits (2f82f8f)
- deps-bot: disable bump
nodeengine version (05f61a9) - deps-bot: disable lockfile maintenance (82824db)
- deps-bot: remove GitHub dependabot (be47088)
- deps-bot: setup automerge configuration (e57e8d6)
- deps-bot: setup renovate bot configuration (13510ed)
- deps-bot: widen peerDeps and engines (8c65fc4)
- deps-dev: update dependency @types/node to ^16.10.1 (c5a8389)
- deps: bundle bod deps into single PR (3f24e79)
- eslint: add
dg-scriptseslint configuration (d33c124) - lint: disable auto-fix for linter (02cdad5)
- yarn: bump yarn from v3.0.2 to v3.1.0 (2cb7000)
2.3.0 (2021-09-12)
- leetcode-0001: two sum (one iteration with hash map) (d532c69)
- yarn: switch from npm to yarn berry (9141445)
- CI-azure: remove azure pipelines (641d1e9)
- CI-CodeQL: add CodeQL analysis (b9849e4)
- CI-report: deploy coverage report (590adda)
- CI: change fetch depth (38fd88c)
- CI: remove redundant stage (f6ab45f)
- CI: separate lint and test stage (de655d9)
- CI: separate test and deploy stage (8a1d128)
- CI: skip deploy on PRs (be9aa5e)
- dependabot: change versioning strategy (ec1f9e4)
- deps-bot: add renovate.json (#17) (7730562)
- deps-bot: enable
pinversion (c18d5fc) - deps-bot: setup renovate bot configuration (f0b3580)
- deps-dev: bump @types/node from 16.7.10 to 16.9.0 (#12) (dfc617f)
- deps-dev: bump @types/node from 16.7.8 to 16.7.10 (#11) (ae901ee)
- deps-dev: bump @typescript-eslint/eslint-plugin (#15) (42c5b50)
- deps-dev: bump @typescript-eslint/parser from 4.30.0 to 4.31.0 (#13) (b25252b)
- deps-dev: bump jest from 27.1.0 to 27.1.1 (#16) (3d18079)
- deps-dev: bump prettier from 2.3.2 to 2.4.0 (#14) (87d2a4e)
- Jest: enable Jest config intellisense (b8bd4b2)
2.2.0 (2021-08-31)
- deps-dev: bump @types/node from 16.7.6 to 16.7.8 (#9) (8fe49de)
- deps-dev: bump @typescript-eslint/eslint-plugin (#10) (5d8c499)
- deps-dev: bump @typescript-eslint/parser from 4.29.3 to 4.30.0 (#8) (073c7d8)
- deps-dev: bump eslint-plugin-prettier from 3.4.1 to 4.0.0 (#7) (7d675ca)
- leetcode-0455: assign cookies (d31ddaa)
- leetcode-0475: heaters (b03a46b)
- leetcode-0496: next greater elment i (monotonic stack) (6097995)
- leetcode-0453: minimum moves to equal array elements (a0eb9fe)
- leetcode-0485: max consecutive ones (51d89af)
- leetcode-0548: split array with equal sum (8a5014e)
- leetcode-0549: binary tree longest consecutive sequence ii (357d8a7)
- leetcode-0554: brick wall (b022178)
- leetcode-0459: repeated substring pattern (f4398ec)
- leetcode-0500: keyboard row (fd92039)
- leetcode-0521: longest uncommon subsequence i (9d91ce5)
- leetcode-0522: longest uncommon subsequence ii (3d91195)
- leetcode-0541: reverse string ii (9984cb6)
- leetcode-0557: reverse words in a string iii (b93d4b1)
- leetcode-0461: hamming distance (cb13d41)
- leetcode-0476: number complement (ee844fe)
- leetcode-0492: construct the rectangle (33bc287)
- leetcode-0556: next greater element iii (monotonic stack) (056af00)
2.1.6 (2021-08-30)
- leetcode-0412: fizz buzz (ced54ec)
- leetcode-0414: third maximum number (7ce8ebf)
- leetcode-0438: find all anagrams in a string (928a12d)
- deps-dev: bump @types/node from 16.7.4 to 16.7.6 (b5debed)
- leetcode-0401: binary watch (958fecb)
- leetcode-0405: convert a number to hexadecimal (0fbfc54)
- leetcode-0415: add strings (add big integer) (995635b)
- leetcode-0441: arranging coins (f12c1b5)
- leetcode-0447: number of boomerangs (a325c10)
- leetcode-0448: find all numbers disappeared in an array (d93d53c)
2.1.5 (2021-08-28)
- leetcode-0232: implement queue using stacks (f8e166a)
- deps-dev: bump @types/node from 16.7.1 to 16.7.4 (9748045)
- deps-dev: bump jest from 27.0.6 to 27.1.0 (27ee729)
- deps-dev: bump typescript from 4.3.5 to 4.4.2 (7e49374)
- leetcode-0234: palindrome linked list (83c5995)
- leetcode-0237: delete node in a linked list (4267e5a)
- leetcode-0264: ugly number ii (digits dynamic programming) (a9b62d0)
- leetcode-0290: word patterns (f839b2b)
- leetcode-0235: lowest common ancestor of a binary search tree (b854cc4)
- leetcode-0297: serialize and deserialize binary tree (cbf2215)
- Segment Tree: implement segment tree for range update/query (0f6b129)
- leetcode-0283: move zeros (3174e4b)
- leetcode-0303: range sum query immutable (prefix sum) (e474ab1)
- leetcode-0349: intersection of two arrays (8f2c26b)
- leetcode-0350: intersection of two arrays ii (15f5153)
- leetcode-0240: search a 2d matrix ii (c0e8b94)
- leetcode-0278: first bad version (58f6a70)
- leetcode-0374: guess number higher or lower (483bc77)
- leetcode-0242: valid anagram (2eed025)
- leetcode-0344: reverse string (0045169)
- leetcode-0345: reverse vowels of string (712c0bb)
- leetcode-0383: ransom note (827b4d0)
- leetcode-0387: first unique character in a string (db1cbff)
- leetcode-0389: find the difference (1f5ee01)
- leetcode-0231: power of two (2aaeb7d)
- leetcode-0258: add digits (f38770c)
- leetcode-0263: ugly number (03cd73a)
- leetcode-0268: missing number (647d649)
- leetcode-0292: nim game (5041a58)
- leetcode-0326: power of three (e5c7d02)
- leetcode-0342: power of four (792c17e)
- leetcode-0367: valid perfect square (4007f1c)
- leetcode-0371: sum of two integers (b839a96)
- leetcode-0400: nth digit (388e1fd)
2.1.4 (2021-08-27)
- leetcode-0217: contains duplicate (d270460)
- leetcode-0219: contains duplicate ii (09474bb)
- leetcode-0220: contains duplicate iii (8dfb2e6)
- leetcode-0225: implement stack using queues (276f608)
2.1.3 (2021-08-26)
- codewars-rank: duplicate encoder (1b5ea3f)
- leetcode-0155: min stack (10ab39d)
- leetcode-0153: find minimum in rotated sorted array (67f6557)
- leetcode-0154: find minimum in rotated sorted array ii (59ae340)
- leetcode-0162: find peak element (b5e31d4)
- leetcode-0167: two sum ii input array is sorted (287b1d5)
- leetcode-0198: house robber (7e867f1)
- leetcode-0136: single number (bitwise operator) (2bc474f)
- leetcode-0137: single number ii (10f037e)
- leetcode-0171: excel sheet column number (8a17b77)
- leetcode-0172: factorial trailing zeroes (2cc9b5f)
- leetcode-0190: reverse bits (4914578)
- leetcode-0191: number of 1 bits (c622eec)
- leetcode-0202: happy number (9df015b)
- leetcode-0204: count primes (f4bbea3)
- leetcode-0205: isomorphic strings (5385742)
- leetcode-0141: linked list cycle (two pointers algorithm) (9a627df)
- leetcode-0142: linked cycle ii (set map) (4219be5)
- leetcode-0160: intersection of two linked lists (e1a2aac)
- leetcode-0203: remove linked list elements (b367fd4)
- leetcode-0206: reverse linked list (8b78cff)
2.1.2 (2021-08-25)
- leetcode-0108: convert sorted array to binary search tree (5c84be9)
- leetcode-0109: convert sorted list to binary search tree (502d3c0)
- leetcode-0110: balanced binary tree (9802e1a)
- leetcode-0111: minimum depth of binary tree (323d116)
- leetcode-0112: path sum of binary tree (2a84aff)
- leetcode-0113: path sum ii (cc10e95)
- leetcode-0121: best time to buy and sell stock (570dca5)
- leetcode-0122: best time to buy and sell stock ii (3846f8e)
- leetcode-0123: best time to buy and sell stock iii (d17a66c)
- leetcode-0188: best time to buy and sell stock iv (c566aa9)
- leetcode-0125: valid palindrome string (133c550)
2.1.1 (2021-08-25)
- leetcode-0101: symmetric tree (077602b)
- leetcode-0102: binary tree level order traversal (525e114)
- leetcode-0103: binary tree zigzag level order traversal (f2ecc8a)
- leetcode-0104: maximum depth of binary tree (277d1c1)
- leetcode-0105: construct binary tree from preorder and inorder (8c4160d)
- leetcode-0106: construct tree from inorder and postorder traversal (c155603)
- leetcode-0107: binary tree bottom level order traversal (9a77237)
- leetcode-Tree: rectify tree nodes array type (8662ede)
- leetcode-List/Tree: add more testing (37bb2ea)
- leetcode-List: add List testing (e70937b)
- leetcode-Tree: add Tree testing (1c8748e)
2.1.0 (2021-08-24)
- leetcode-0038: count and say (d6d093f)
- leetcode-0053: maximum subarray (one variable store DP) (76916e1)
- leetcode-0059: spiral matrix II (dfc589f)
- leetcode-0034: search for a range (binary search in sorted array) (791e328)
- leetcode-0035: search insert position in sorted array (325b1a7)
- leetcode-0074: search a sorted 2d matrix (binary search) (9d2f43c)
- category: add backtracking algorithm (403fea7)
- leetcode-0078: subsets problem (backtracking) (15b8806)
- leetcode-Tree: complete Tree utility functions (b7521d4)
- leetcode-0021: merget two sorted lists (6539d93)
- leetcode-0083: remove duplicates from sorted list (1d296e2)
- leetcode-0094/0144/0145: binary tree traversal (2d8fda0)
- leetcode-0100: same tree comparsion (90caec8)
- leetcode-0226: invert binary tree (e62570e)
- leetcode-0020: valid parentheses (9d6d649)
- leetcode-0084: largest rectangle in histogram (increasing stack) (59d06f8)
- leetcode-0015: 3 sum array (343560a)
- leetcode-0016: 3sum closest (d7539e6)
- leetcode-0018: 4sum problem (92f58e9)
- leetcode-0026: remove dups from sorted array in place (492119b)
- leetcode-0027: remove element in place (6c0b418)
- leetcode-0088: merge sorted array (383b46f)
- CI: set up CI with Azure Pipelines (fe1856e)
- deps-dev: bump @typescript-eslint/eslint-plugin from 4.29.2 to 4.29.3 (47205dc)
- deps-dev: bump @typescript-eslint/parser from 4.29.2 to 4.29.3 (4a833c7)
2.0.0 (2021-08-22)
- archive: remove archive OJ solutions
- leetcode-0004: median of two sorted arrays (6309946)
- leetcode-0005: longest palindromic substring (778350d)
- leetcode-0001: two sum problem (f33025a)
- leetcode-0006: string simulation zigzag conversion (dc4e793)
- leetcode-0003: longest substring without repeating characters (69c842c)
- leetcode-0005: longest palindrome substring (bcab436)
- leetcode-0009: palindrome number (8f4c2bb)
- leetcode-0012: integer to roman (f0afe0c)
- leetcode-0013: roman to integer (adcfc70)
- leetcode-0014: longest common prefix (92f1458)
- archive: remove archive OJ solutions (2db84bd)
- leetcode-cpp: remove cpp test suites (e2b218a)
- leetcode-limits: add number litmits utililty (f78ee35)
- leetcode-test: reorder expect statements (d52674f)
- leetcode: add
levelanotation (7f05413) - leetcode: change to strict equal (fe16c11)
- dependabot: add dependabot support (87aa480)
- Jest-mocks: mock console function at
CImode (8f290df)
- oj-codewars: start haskell puzzle in codewarsoj (a12c879), closes sabertazimi/awesome-notes#88
- TypeScript: add TypeScript solution support (02b328a)
- oj-hust-lab: add input tests for lab 1 (09cb2b4), closes sabertazimi/awesome-notes#88
- leetcode-300: longest increasing subsequence (3448e06)
- basic-bfs: bfs puzzle (5d57684)
- ccfoj-201312: complete No.1 - No.3 (water probloem) (353a9f8), closes sabertazimi/awesome-notes#88
- ccfoj-20140301: inverse number - map/hashmap (3b9f752), closes sabertazimi/awesome-notes#88
- ccfoj-20140302: windows click - matrix and brute-force (55c1f43), closes sabertazimi/awesome-notes#88
- ccfoj-20140303: cli puzzle - string match algorithm (223f152), closes sabertazimi/awesome-notes#88
- ccfoj-20140304: router puzzle - floyd algorithm(minimal distance) (947547c), closes sabertazimi/awesome-notes#88
- ccfoj-20140305: try to solve cpu scheduling puzzle (ce5bfc1), closes sabertazimi/awesome-notes#88
- ccfoj-20140901: sort puzzle - sort algorithm (74ec4fc), closes sabertazimi/awesome-notes#88
- ccfoj-20140902: painting puzzle - matrix brute-force algorithm (b014c4d), closes sabertazimi/awesome-notes#88
- ccfoj-20140903: string matching puzzle - kmp algorithm (1a8bd32), closes sabertazimi/awesome-notes#88
- ccfoj-20140904: takeout puzzle - bfs(shortest path) algorithm (e1e37ac), closes sabertazimi/awesome-notes#88
- ccfoj-20140905: jigsaw puzzle - dynamic programming algorithm (b4ba9b8), closes sabertazimi/awesome-notes#88
- ccfoj: create empty commit (fcb041b), closes sabertazimi/awesome-notes#88
- hroj-bash: complete compute the average challenge (7a252f7), closes sabertazimi/awesome-notes#88
- hroj-bash: complete recursive tree print challenge (ef0159e), closes sabertazimi/awesome-notes#88
- jobdu: review c algo tips (5ff3deb), closes sabertazimi/awesome-notes#88
- leetCode-108: List to BST - BST/List/Tree/Recursive (2c413a3)
- leetCode-109: List to BST - BST/List/Tree/Recursion (79335e2)
- leetCode-119: Pascal Triangle - Simulation/Math (30028a9)
- leetCode-121: Stocks - Simulation (2772907)
- leetCode-122: Stock 2 - Max/Min/Simulation (5ce097b)
- leetcode-14: Longest Common Prefix - Brute Force (d404494)
- leetcode-169: Majority Element - Hash/Trick (84d666b)
- leetcode-171: Excel Sheet Column Number - Math (b2c07c5)
- leetcode-172: Factorial Trailing Zeroes - Math (fb80e74)
- leetcode-189: Rotate Array - Array (9e45181)
- leetcode-190: Reverse Bits - Bits Manipulation (6e58673)
- leetcode-198: House Robber - DP (45aed66)
- leetcode-202: Happy Number - Math/Two Pointer (84b4f02)
- leetcode-203: Remove Linked List Elements - Linked List (9a8ea8e)
- leetcode-204: Count Primes - Math (b3eef32)
- leetcode-205: Isomorphic Strings - String/Map (81c1795)
- leetcode-206: Reverse Linked List - Linked List (d77c5a0)
- leetcode-20: Valid Parentheses - Stack (efe7b19)
- leetcode-217: Contains Duplicate - Array (0d637ee)
- leetcode-219: Contains Duplicate 2 - Array/Set (ba2ac0a)
- leetcode-21: Merge Two Sorted Lists - Merge/List (8a9b1a0)
- leetcode-225: Implement Stack Using Queues - Stack/Queue (4859133)
- leetcode-232: Implement Queue Using Stacks - Stack/Queue (a6ba675)
- leetcode-234: Palindrome Linked List - Linked List/Two Pointer (5ed3a1d)
- leetcode-235: Lowest Common Ancestor of a BST - BST/Recursion (87c83db)
- leetcode-237: Delete Node in A Linked List - Linked List (58d182c)
- leetcode-242: Valid Anagram - String (f3a184a)
- leetcode-257: Binary Tree Paths - Tree/Recursion (031bbbc)
- leetcode-258: Add Digits - Math (563733c)
- leetcode-263: Ugly Number - Math (844b1b0)
- leetcode-267: Valid Perfect Square - Math (e154974)
- leetcode-278: First Bad Version - Binary Search (71aa6b2)
- leetcode-283: Move Zeroes - Array (927db5b)
- leetcode-28: Implement strStr - String Manipulation (e35da6a)
- leetcode-290: Word Pattern - String/Hash/Map (02c9d3c)
- leetcode-345: Reverse Vowels of String - String (7887e08)
- leetcode-349: Intersection of Two Arrays - Set (ea6f93a)
- leetcode-350: Intersection of Two Arrays - Set/Hash (6a26f25)
- leetcode-371: Sum of Two Integers - Math/Bit Manipulation (6b12a60)
- leetcode-374: Guess Number Higher or Lower (1f108cb)
- leetcode-383: Ransom Note - Map/Hash (fd2b1cb)
- leetcode-387: First Unique Character in a String - Map/Hash (5c1b923)
- leetcode-389: Find the Difference - XOR/Map/Hash (3af0576)
- leetcode-38: Count and Say - String (ca3a8d0)
- leetcode-400: Nth Digit - Math (aef6237)
- leetcode-401: Binary Watch - Bit/Math (bd5ce25)
- leetcode-404: Sum of Left Leaves - Tree/Recursion (39c273c)
- leetcode-405: Convert a Number to Hexadecimal - Math/Bit (b4a714d)
- leetcode-409: Longest Palindrome - Map/Count/String (6ab71d9)
- leetcode-412: Fizz Buzz - String/Math (172912e)
- leetcode-414: Third Maximum Number - Math/Set (9f4794a)
- leetcode-415: Add Strings -String/Big Integer (311a189)
- leetcode-434: Number of Segments in a String - String (76f6c06)
- leetcode-438: Find all Anagrams in a String - String/Slide Window (3660f62)
- leetcode-441: Arranging Coins - Math (96d04c9)
- leetcode-447: Number of Boomerangs - Math (cf7f7d7)
- leetcode-453: Minimum Moves to Equal Array Elements - Math (c4ed242)
- leetcode-455: Assign Cookies - Array/Greedy (c628e25)
- leetcode-459: Repeated Substring Pattern - String/KMP (67feddc)
- leetcode-461: Hamming Distance - Math/Bit (044abfd)
- leetcode-463: Island Perimeter - Map/DFS/BFS (6c878de)
- leetcode-475: Heaters - Array (300b267)
- leetcode-476: Number Complement - Bit (3e9837c)
- leetcode-485: Max Consecutive Ones - Array (6b373ea)
- leetcode-488: Find All Numbers Disappeared - Array/Hash Map (dedaa1c)
- leetcode-492: Construct the Rectangle - Math (3cfdb83)
- leetcode-496: HashMap/Stack/Array (bacdfa1)
- leetcode-500: Keyboard Row - Set (7dfcc85)
- leetcode-53: Maximum Subarray - Array/DP (ded79b9)
- leetcode-58: Length of Last Word - String (be9014d)
- leetcode-67: Add Binary - Binary/String (abff42c)
- leetcode-70: Climbing Stairs - DP (7d4fe63)
- leetcode-7: Reverse Integer - Math (630c3f1)
- leetCode-83: Remove Duplicates from Sorted List - List (9e48008)
- list: review list operation (d622abc), closes sabertazimi/awesome-notes#88
- oj-2104: K nth number - segment tree/range query (57ca81d), closes sabertazimi/awesome-notes#88
- oj-2785: 4 Sum - brute force/divide and conquer (8f44ec7), closes sabertazimi/awesome-notes#88
- oj-3279: Filptile - dp/state compression (9255976), closes sabertazimi/awesome-notes#88
- oj-basic-priority_queue: learn basic usage of priority_queue (e3871fe), closes sabertazimi/awesome-notes#88
- oj-ccf-201604/201609: copy code (6cb8548), closes sabertazimi/awesome-notes#88
- oj-ds-segment tree/bit: impl segment tree/bit (b3a0175), closes sabertazimi/awesome-notes#88
- oj-hust lab: try to implement dijkstra algorithm (6d87d43), closes sabertazimi/awesome-notes#88
- oj-hust-dijkstra: implement floyd algorithm (aaef568), closes sabertazimi/awesome-notes#88
- oj-hust-report: start to work on report draft (4082937), closes sabertazimi/awesome-notes#88
- oj-interview-wanmei: pass wanmei interview (beb7328), closes sabertazimi/awesome-notes#88
- oj-leetcode-100: Same Tree - Tree/DFS (9b1ecc6), closes sabertazimi/awesome-notes#88
- oj-leetcode-101: Symmetric Tree - Tree/DFS (ed07f43), closes sabertazimi/awesome-notes#88
- oj-leetcode-102: Level Order Traversal - Tree/BFS (e359319), closes sabertazimi/awesome-notes#88
- oj-leetcode-103: Zigzag Level Order - Tree/BFS (f4aa228), closes sabertazimi/awesome-notes#88
- oj-leetcode-104/111: Depth of Binary Tree - Tree/DFS/BFS (1d4224c), closes sabertazimi/awesome-notes#88
- oj-leetcode-105/106: Construct Binary Tree - Tree/Recursion/DFS (db92cee), closes sabertazimi/awesome-notes#88
- oj-leetcode-107: Level Order Traversal - Tree/BFS (f40060a), closes sabertazimi/awesome-notes#88
- oj-leetcode-110: Balanced Binary Tree - Tree/DFS (e43b4ff), closes sabertazimi/awesome-notes#88
- oj-leetcode-112: Path Sum - Tree/DFS (c70c002), closes sabertazimi/awesome-notes#88
- oj-leetcode-113: Path Sum 2 - Tree/DFS (44d015e), closes sabertazimi/awesome-notes#88
- oj-leetcode-118: Pascal Triangle - simulation/print (b34d109), closes sabertazimi/awesome-notes#88
- oj-leetcode-125: Valid Palindrome - String (a0892e9)
- oj-leetcode-136: Single Number - Bit (a8928f6)
- oj-leetcode-13: Roman to Integer - Math (6696d28)
- oj-leetcode-141: Linked List Cycle - List/Two Pointer (0b78c81)
- oj-leetcode-15: 3 sum - two pointers (65a31e3), closes sabertazimi/awesome-notes#88
- oj-leetcode-153/154: Find Min in Rotated Sorted Arr - binary search (b83d195), closes sabertazimi/awesome-notes#88
- oj-leetcode-155: Min Stack - Stack (5b3c9c0)
- oj-leetcode-160: Intersection of Two Linked Lists - Two Pointer (1afe960)
- oj-leetcode-162: Find Peak Element - Binary Search (47fea44), closes sabertazimi/awesome-notes#88
- oj-leetcode-16: 3 Sum Closest - two pointers (29263a7), closes sabertazimi/awesome-notes#88
- oj-leetcode-167: Two Sum II - Array/Two Pointer (71c5ad1)
- oj-leetcode-168: Excel Sheet Column - Math (0673637)
- oj-leetcode-18: 4 Sum - two pointers/brute-force (8c9a222), closes sabertazimi/awesome-notes#88
- oj-leetcode-191: Number of 1 Bits - Bit Manipulation (1f6ca72), closes sabertazimi/awesome-notes#88
- oj-leetcode-1: Two Sum - map (51f32bd), closes sabertazimi/awesome-notes#88
- oj-leetcode-226: Invert Binary Tree - Tree/Recursion (beb7a91), closes sabertazimi/awesome-notes#88
- oj-leetcode-231: Power of Two - Bit Manipulation (b0fbbc0), closes sabertazimi/awesome-notes#88
- oj-leetcode-268: Missing Number - Bit Manipulation (84a7b57), closes sabertazimi/awesome-notes#88
- oj-leetcode-26: Remove dup from soretd array - 2 pointers (c4897fa), closes sabertazimi/awesome-notes#88
- oj-leetcode-27: Remove Element - two pointers (3231c97), closes sabertazimi/awesome-notes#88
- oj-leetcode-297: (De)Serialize Binary Tree - Tree/DFS/Recursion (46c5f7b), closes sabertazimi/awesome-notes#88
- oj-leetcode-303: range sum query - bit/segment tree (e65e4a4), closes sabertazimi/awesome-notes#88
- oj-leetcode-326: Power of Three - Bit/Math (233291b), closes sabertazimi/awesome-notes#88
- oj-leetcode-342: Power of Four - Bit/Math (f4b3618), closes sabertazimi/awesome-notes#88
- oj-leetcode-344: Reverse String - String (6bbfdc5), closes sabertazimi/awesome-notes#88
- oj-leetcode-34: Search for a Range - Binary Search (ba1acce), closes sabertazimi/awesome-notes#88
- oj-leetcode-35: Search Insert Position - Binary Search (d48f92a), closes sabertazimi/awesome-notes#88
- oj-leetcode-437: Path Sum 3 - Tree/DFS (924b644), closes sabertazimi/awesome-notes#88
- oj-leetcode-521: Longest Uncommon Subsequence - recursion (75bf682), closes sabertazimi/awesome-notes#88
- oj-leetcode-522: Longest Uncommon Subsequence 2 - recursion (339f3fd), closes sabertazimi/awesome-notes#88
- oj-leetcode-541: Reverse String 2 - String (9403d98), closes sabertazimi/awesome-notes#88
- oj-leetcode-547: Friend Circles - DFS/Union Find (163151f), closes sabertazimi/awesome-notes#88
- oj-leetcode-549: Tree Longest Consecutive Sequence - Tree/DFS (18ebfda), closes sabertazimi/awesome-notes#88
- oj-leetcode-554: Brick Wall - Hasp Map/Discretization (a6fad61), closes sabertazimi/awesome-notes#88
- oj-leetcode-556: Next Greater Element - Math/String (4a90a31), closes sabertazimi/awesome-notes#88
- oj-leetcode-557: Reverse Words - String/Two Pointers (5f73e64), closes sabertazimi/awesome-notes#88
- oj-leetcode-66: Plus One - carry/simulation (48ca247), closes sabertazimi/awesome-notes#88
- oj-leetcode-74: Search A 2D Matrix - Matrix/Binary Search (71571bb), closes sabertazimi/awesome-notes#88
- oj-leetcode-84: Largest Rectangle in Histogram - stack (37396cc), closes sabertazimi/awesome-notes#88
- oj-leetcode-85: Maximal Rectangle - DP/Stack (4a880bc), closes sabertazimi/awesome-notes#88
- oj-leetcode-88: Merge Sorted Array - merge sort (f7abb71), closes sabertazimi/awesome-notes#88
- oj-leetcode-94/144/145: Binary Tree Traversal - Tree/DFS/Recursion (eb4b3a1), closes sabertazimi/awesome-notes#88
- oj-leetcode-9: Palindrome Number - Math/String (b944f0d), closes sabertazimi/awesome-notes#88
- oj-leetcode-contest 27: all wrong answers (11c6e49), closes sabertazimi/awesome-notes#88
- oj-leetcode: start to complete leetcode puzzle (8f84138), closes sabertazimi/awesome-notes#88
- oj-newcoder-exam: complete exam on newcoder (5939518), closes sabertazimi/awesome-notes#88
- oj-nowcoder-huawei: add huawei testing solutions (3df6341), closes sabertazimi/awesome-notes#88
- oj-nowcoder-netease: complete netease intern testing (7e6fdef), closes sabertazimi/awesome-notes#88
- oj-poj-1064: Cable master - binary search/brute-force/max-min (094ad10), closes sabertazimi/awesome-notes#88
- oj-poj-1182: Food chain - union/disjoint sets (b795f5b), closes sabertazimi/awesome-notes#88
- oj-poj-1852: Ants - puzzle (8b986cb), closes sabertazimi/awesome-notes#88
- oj-poj-2386: Lake Counting - dfs and map (3d4cac0), closes sabertazimi/awesome-notes#88
- oj-poj-2431: Expedition - greedy and priority queue (77f1e71), closes sabertazimi/awesome-notes#88
- oj-poj-2456: Aggressive cows - binary search/brute-force/greedy (c8e52e8), closes sabertazimi/awesome-notes#88
- oj-poj-3169: Layout - map/bellman-ford (374b932), closes sabertazimi/awesome-notes#88
- oj-poj-3255: Roadblocks - map/bfs/dijkstra (8f0d162), closes sabertazimi/awesome-notes#88
- oj-poj-3320: Reading problem - two pointers/range/brute-force (c6a4087), closes sabertazimi/awesome-notes#88
- oj-poj-3320: Subsequeue - range/pointer (8bc7c12), closes sabertazimi/awesome-notes#88
- oj-poj-3468: a simple problem with integers - segment tree (96cc687), closes sabertazimi/awesome-notes#88
- oj-poj-3617: Best Cow Line - Greedy (af71bac), closes sabertazimi/awesome-notes#88
- oj-poj-3723: Conscription - map/spamtree/kruskal/union (92f9398), closes sabertazimi/awesome-notes#88
- oj-poj-set: learn more usage of set (20399c1), closes sabertazimi/awesome-notes#88
- oj-poj-union: impl union data structure (e9e6b77), closes sabertazimi/awesome-notes#88
- oj-sudoku: start to solve sudoku puzzle(brute-force) (d4b748b), closes sabertazimi/awesome-notes#88
- oj-uva-1103: Ancient Message - map and dfs (6d90ca1), closes sabertazimi/awesome-notes#88
- oj-uva-11988: broken keyboard - link list (b6f2085), closes sabertazimi/awesome-notes#88
- oj-uva-12657: Boxes in a Line - doubly linked list (0690caa), closes sabertazimi/awesome-notes#88
- oj-uva-442: Matrix Chain Multiplication- expr stack (7d8efec), closes sabertazimi/awesome-notes#88
- oj-uva-514: Rails - stack (b7b15b0), closes sabertazimi/awesome-notes#88
- oj-uva-548: Tree - dfs and recursion (a3bfb81), closes sabertazimi/awesome-notes#88
- oj-uva-572: Oil Deposits - connected graph and dfs (4211678), closes sabertazimi/awesome-notes#88
- oj-uva-679: dropping balls - tree traverse (7c45a80), closes sabertazimi/awesome-notes#88
- oj-uva-699: The Falling Leaves - tree and recursion (41cfa27), closes sabertazimi/awesome-notes#88
- oj-uva-839: not so mobile - recursion and tree (77af4b0), closes sabertazimi/awesome-notes#88
- ojs: move all archive of oj code into this repo (ee22100), closes sabertazimi/awesome-notes#88
- basic-bfs: bug fix (85beed6)
- basic-bfs: print shortest path (49f9b64)
- basic-bfs: push final node into paths (dbd979e)
- ccfoj-stuck_maze: ccf 20131205 - dfs algorithm (406fd60), closes sabertazimi/awesome-notes#88
- hroj-bash: polish code up (2c7e591), closes sabertazimi/awesome-notes#88
- leetcode-169: move file to right position (cce1dce)
- oj-ccf-201503: copy code from github (f96f346), closes sabertazimi/awesome-notes#88
- oj-ccf-201509/201512: copy code (0ac2937), closes sabertazimi/awesome-notes#88
- oj-ccf-201604: copy code (3d2ac02), closes sabertazimi/awesome-notes#88
- oj-hust-lab: complete n-queens' problem (aacbf66), closes sabertazimi/awesome-notes#88
- oj-hust-lab: print path for floyd (ae370c1), closes sabertazimi/awesome-notes#88
- oj-hust-report: complete algorithm lab report (c5e671b), closes sabertazimi/awesome-notes#88
- oj-hust-report: complete report for 5 algorithms (904024d), closes sabertazimi/awesome-notes#88
- oj-hust-report: complete report for quicksort2 (f247d88), closes sabertazimi/awesome-notes#88
- oj-leetcode-231: Power of Two - Bit/Math (98acb05), closes sabertazimi/awesome-notes#88
- oj-leetcode-94/144/145: Binary Tree Traversal - Tree/DFS (cea870e), closes sabertazimi/awesome-notes#88
- oj-leetcode: rename leet code solution (d2187ff), closes sabertazimi/awesome-notes#88
- oj-readme: polish readme up (26f5f32)
- oj-string: learn how to implement split function (9fa4931), closes sabertazimi/awesome-notes#88
- oj-sudoku: solved sudoku puzzle (ccab67b), closes sabertazimi/awesome-notes#88
- oj-uva-10391: Compound Words - string substr find (1a5c2f9), closes sabertazimi/awesome-notes#88
- oj-uva-10935: Throwing cards away - queue (e54821a), closes sabertazimi/awesome-notes#88
- oj-uva-1592: Database - string compare algorithm (b210210), closes sabertazimi/awesome-notes#88
- oj-uva-1594: Ducci Sequence - map and sort (e2ac360), closes sabertazimi/awesome-notes#88
- oj-uva-1595: Symmetry - set (math) (029b550), closes sabertazimi/awesome-notes#88
- oj-uva: change to uva oj (552a9b0), closes sabertazimi/awesome-notes#88
- oj-uvaoj-1593: alignment of code - simple string stream usage (b541369), closes sabertazimi/awesome-notes#88
- ccfoj-20140902: painting puzzle - matrix brute-force algorithm (ac444c2), closes sabertazimi/awesome-notes#88
- ccfoj-20140904: takeout puzzle - bfs algorithm (0db625a), closes sabertazimi/awesome-notes#88
- ccfoj-20140904: takeout puzzle - bfs(shortest path) algorithm (4380f88), closes sabertazimi/awesome-notes#88
- gh-pages: create empty gh pages (7b0afc5)
- hroj-select2: fix error when input equal to zero (d0819a5), closes sabertazimi/awesome-notes#88
- leetCode-108: rectify file type extension (49d197d)
- leetCode-109: rectify file type extension (c59ff5c)
- leetcode-14: add correct extension of file type (6131fd4)
- leetcode-232: Implement Queue Using Stacks - Stack/Queue (359b8f7)
- leetCode-521: add ID for file name (88f8ce5)
- leetcode-53: add correct extension of file type (decfd98)
- oj-hust: rectify -1 judgement error (63d99d1), closes sabertazimi/awesome-notes#88
- tsconfig: add
pathsforts-jest(7d556d4)