Data Structure

Heap

skyline.cpp

Binary-Search-Tree

Red-Black-Tree

template rbtree.cpp

Monotonic Queue

template mqueue.cpp
prob239.cpp

Range/Interval

Segment Tree: divide & conquer algorithm.

template array-based fixed range-sum: segtree.cpp
template fixed RMQ: rmq.cpp
dynamic range-query: range-module.cpp

Interval tree

template interval_tree.cpp

Binary Indexed Tree(BIT)

template: bit.cpp
prob307-2.cpp, prob-308-bit.cpp

Graph

Disjoint Set or Union-Find Algorithm

Dijkstra (greedy)

LCA on tree

Recursive solution
Euler tour + RMQ
Binary lifting

Topological order

DFS
in-degree

Dynamic programming

LCS: longest_common_subsequence.cpp

String

Trie

Compiler

Linear Scan Register Allocation: meetingRoom2.cpp

Miscellaneous

faster IO: disable the synchronization between stdio and c++ stream library; untie cin from cout.

int speed_up = []{
    ios::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    return 0;
}();

Skip leetcode harness

I encoutnered another hackery in 121. Best Time to Buy and Sell Stock. Someone just hijacks stdout and parses out inputs by themselves. This can reduce execution time to 0ms from about 90ms.

int init = [] {
	cin.tie(nullptr)->sync_with_stdio(false);
    freopen("user.out", "w", stdout);

    for (string s; getline(cin, s);) {
        int solution = 0, minPrice = INT_MAX;
        for (int _i = 1, _n = s.length(); _i < _n; ++_i) {
            // parse out input, for instance [7,1,5,3,6,4]
            int price = s[_i++] & 15;
            while ((s[_i] & 15) < 10) price = price * 10 + (s[_i++] & 15);
            // real computation moved from Solution::maxProfit.
            minPrice = min(minPrice, price);
            solution = max(solution, price - minPrice);
        }
        cout << solution << '\n';
    }
    return 0;
}();

class Solution {
public:
    int maxProfit(vector<int>& arr) {
        return 0;
    }
};

Name		Name	Last commit message	Last commit date
Latest commit History 8 Commits
3SumClose.cpp		3SumClose.cpp
README.md		README.md
SegmentTree.java		SegmentTree.java
arrange.cpp		arrange.cpp
backpack.cpp		backpack.cpp
bit.cpp		bit.cpp
cmp.py		cmp.py
coin_piles.cpp		coin_piles.cpp
countZeros.py		countZeros.py
decompress.cpp		decompress.cpp
fizzbuzz.py		fizzbuzz.py
hashHeap.cpp		hashHeap.cpp
interval_tree.cpp		interval_tree.cpp
islands2.cpp		islands2.cpp
josephus.cpp		josephus.cpp
josephus2.cpp		josephus2.cpp
lca_path.py		lca_path.py
lcs-dp.cpp		lcs-dp.cpp
lis.cpp		lis.cpp
longest_common_subsequence.cpp		longest_common_subsequence.cpp
meetingRoom2.cpp		meetingRoom2.cpp
merge.py		merge.py
mqueue.cpp		mqueue.cpp
n_ary.cpp		n_ary.cpp
nuts.cpp		nuts.cpp
pr114.cpp		pr114.cpp
prev_permutation.cpp		prev_permutation.cpp
pro310.py		pro310.py
prob116.cpp		prob116.cpp
prob117.cpp		prob117.cpp
prob125.cpp		prob125.cpp
prob126-2.cpp		prob126-2.cpp
prob126.cpp		prob126.cpp
prob126.java		prob126.java
prob127.cpp		prob127.cpp
prob132.cpp		prob132.cpp
prob133.cpp		prob133.cpp
prob138.cpp		prob138.cpp
prob149.cpp		prob149.cpp
prob152.cpp		prob152.cpp
prob153.cpp		prob153.cpp
prob156.cpp		prob156.cpp
prob158.cpp		prob158.cpp
prob16.cpp		prob16.cpp
prob162.cpp		prob162.cpp
prob170.cpp		prob170.cpp
prob18.cpp		prob18.cpp
prob208.cpp		prob208.cpp
prob214.cpp		prob214.cpp
prob220-bucket.cpp		prob220-bucket.cpp
prob221.cpp		prob221.cpp
prob233.cpp		prob233.cpp
prob236.cpp		prob236.cpp
prob239.cpp		prob239.cpp
prob244-2.cpp		prob244-2.cpp
prob244-3.cpp		prob244-3.cpp
prob244.cpp		prob244.cpp
prob249-disjointset.cpp		prob249-disjointset.cpp
prob249.cpp		prob249.cpp
prob25.cpp		prob25.cpp
prob270.cpp		prob270.cpp
prob271.cpp		prob271.cpp
prob277.cpp		prob277.cpp
prob285.cpp		prob285.cpp
prob286-2.cpp		prob286-2.cpp
prob286.cpp		prob286.cpp
prob288.cpp		prob288.cpp
prob295.cpp		prob295.cpp
prob296.cpp		prob296.cpp
prob297.cpp		prob297.cpp
prob30.cpp		prob30.cpp
prob304.cpp		prob304.cpp
prob306.cpp		prob306.cpp
prob307-2.cpp		prob307-2.cpp
prob307.cpp		prob307.cpp
prob308-bit.cpp		prob308-bit.cpp
prob31.cpp		prob31.cpp
prob313-tle.cpp		prob313-tle.cpp
prob313.cpp		prob313.cpp
prob313.java		prob313.java
prob315-bit.cpp		prob315-bit.cpp
prob315-merge.cpp		prob315-merge.cpp
prob315-segtree.cpp		prob315-segtree.cpp
prob323.cpp		prob323.cpp
prob331.cpp		prob331.cpp
prob336.java		prob336.java
prob347-2.cpp		prob347-2.cpp
prob347.cpp		prob347.cpp
prob365.cpp		prob365.cpp
prob370.cpp		prob370.cpp
prob373.cpp		prob373.cpp
prob44.cpp		prob44.cpp
prob50.cpp		prob50.cpp
prob71.cpp		prob71.cpp
prob76.cpp		prob76.cpp
prob84-stack.cpp		prob84-stack.cpp
prob84.cpp		prob84.cpp
prob86.cpp		prob86.cpp
prob91.cpp		prob91.cpp
range-module.cpp		range-module.cpp

navyxliu/leetcode

Folders and files

Latest commit

History