Bloomberg CodeCon 2017
Went to Bloomberg’s headquarters in New York for a coding contest a few days ago. It looks more like a recruiting event than an actual contest, as the proble...
Recent Posts
Euler Path: 8 Lines Solution
The problem of Euler path marked a very fundamental moment in algorithm studies. When Euler posed the 7-bridge problem, there was no mathematical tool to sol...
TIW: Subset Sum
Subset sum, aka the coin change problem, is a very specific problem that for some reason gets mentioned a lot. The problem is very simple: given some coins o...
Brief Intro to Segment Tree
Something I just learned - segment tree, is a data structure more advanced and generalized than binary indexed tree. Even though I just learned it and might ...
Tinkering with Deep Learning Style Transfer
A while ago, Prisma was quite popular on social media and everyone was filtering pictures with its artistic filters. Got some free time yesterday, so I thoug...
TIW: Binary Indexed Tree
Binary indexed tree, also called Fenwick tree, is a pretty advanced data structure for a specific use. Recall the range sum post: binary indexed tree is used...
TIW: Bitwise
Bitwise operations are black magic. It is so simple but with them you can do things that you never thought would be so easy. For those who have never seen th...
TIW: Linked List Cycle
This is more like a special topics post, because it is a very specific algorithm with a very narrow application. The problem statement: given a linked list w...