Memory-efficiently estimating cardinality of union/intersection/difference sets with Theta Sketch

Building a game AI for Animal Shogi using Monte Carlo Tree Search (MCTS)

What do etcd, a distributed KVS with Raft, a consensus algorithm choose in the CAP/PACELC Theorem

Read container/heap package in Go

Implement AVL tree, self-balancing binary search tree, in Go and confirm that the height is kept minimum

The Scheduler which allocates resources in Hadoop YARN, and Dominant Resource Fairness (DRF)

Maximum flow and minimum cut problem, Ford–Fulkerson algorithm

Calculate partial sum with Segment Tree or Bineary Indexed Tree (BIT)

Check if there is a cycle in the undirected graph by Union-Find Tree

Implement Rabin–Karp algorithm in C++

Adaptive Replacement Cache (ARC) とは

偽陽性を許容して空間効率良くキーの存在を確認するBloom filterとCuckoo filter

剰余を取った値の四則演算

個数制限がある場合の重複組合せの総数を動的計画法で求める

ベルマンフォード法とダイクストラ法とワーシャルフロイド法で最短経路問題を解く

貪欲法(Greedy algorithm)で問題を解く

動的計画法(DP)で計算結果を再利用して計算量を減らす

単調性のある式の解を二分法で数値的に求める