Yang ZhangCompute Fibonacci numbers in ScalaA functional way utilizing lazy evaluation:May 31, 2022May 31, 2022
Yang ZhangHow to Implement Successor and Predecessor Functions for a Binary Search Tree in HaskellIn an imperative language, the algorithm to get the successor and predecessor of a BST node is straightforward:Oct 6, 2021Oct 6, 2021
Yang ZhangMerge K Sorted ListAn often encountered interview question is the merge of K-Sorted list. The question goes like this:May 23, 2019May 23, 2019