Home

Test Function Function closures Method Choosing a value or pointer receiver Interface Error Error interface Handle Error Error exercise Reader rot13Reader Concurrency Exercise: Equivalent Binary Trees Exercise: Web Crawler

This is to record a discussion with my TL on his successful experience.

This is to record a discussion with my director on negotiation and influence.

How to iterate binary tree without using recursion for in-order, pre-order, and post-order. We should use stack, but it is not as straightforward as using recursion.

How to write quick sort correctly? How to remember quick sort during an interview?

Union-find can be used to find if two elements are in the same set in constant time.