life is too short for a diary

Most popular




1 min read

Remove-all-adjacent-duplicates-in-string-ii Solution

You are given a string s and an integer k, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them, causing the left and the right side of the deleted substring to concatenate together...

Continue reading → Tags : leetcode stack python java scala javascript






1 min read

Lost Friends

Today I walked a little further,
further than yesterday.
while my feet ache and plead,
I dragged ‘em without paying any heed...

Continue reading → Tags : poetry friends audio






2 min read

Lowest Common Ancestor of a Binary Tree

Questions involving the binary tree data structure are very popular in tech interviews, and can be challenging and varied! A binary tree is a data structure consisting of a collection of nodes (starting at a root node), where each node consists of a value (data), together with a directed edges to at most two nodes (the “left child” and “right child”), with the additional conditions that no two edges point to the same node and no edge points to the root. I recently solved an interesting problem on binary tree...

Continue reading → Tags : leetcode java python javascript scala