The solution of algorithm problems from various programming oline judges, including LeetCode, LintCode and Hackerrank (Interview Street in the past ).
-
std:sort + custom cmp: Code.
-
std:fill: Code.
-
c++11 std:random + uniform_int_distribution: Code.
-
std:map:upper_bound: Code.
-
std:priority_queue:greater: Code.
-
std:random: Code.
-
std:vector:= Code.
-
std:istringstream:getline: Code.
-
std:sort:custom cmp: Code.
-
std:sort:custom <: Code.
-
std:priority_queue cmp: Code.
-
DP: Optimization through accumulative sum: Code.
-
DP: Optimization through rolling array: Code.
-
DP: Smallest solution path: Code.
-
BST: Insert a new node: Code.
-
Binary Search: Use boundary as answer instead of middle: Code.