Simple case of profiler usage in golang
So I was solving Construct Binary Tree from Inorder and Postorder Traversal and I got myself more less working solution that got accepted. But it was not the fastest one. But then I though — how do I profile buildTree function and see what actually takes time in my program? Golang has an excellent set of tool available, just check an output of go tool. One of the items in a list you’ll see is pprof which is a Golang profiler....