Author Archives: letrungkien7

HTC Worst Warranty or Customer Service Ever

After buying hundreds or even thousands of products for years, I have a fair amount of chances to utilize warranty or after services from various companies. However, HTC is definitely the worst one, which has a lengthy after service process, … Continue reading

Posted in Uncategorized | Leave a comment

My first day at work

I have joined MS on April 1st, and I have attended the training until this morning. This afternoon is the first time for me to come to the team. I have got two one-one meetings with my manager and mentor. … Continue reading

Posted in Life | Leave a comment

“Not having enough time”, really?

How do you explain your failure? I always blame myself first, others later if any. However, I have come to realize that the most common reason people use to explain their failures is the lack of time. I do not … Continue reading

Posted in Life | Leave a comment

Triangle

http://oj.leetcode.com/problems/triangle/ The problem statement is deceptive by mentioning path from “top” to “bottom”. I was fooled at first and tried to compare all the ways from the top to the bottoms. However, it is impractical since there are O(2^(n-1)) such … Continue reading

Posted in Computer Science, LeetCode | Tagged , , , | Leave a comment

Sum Root to Leaf Numbers

http://oj.leetcode.com/problems/sum-root-to-leaf-numbers/ Another problem from Leetcode that I came up with two different solutions. The first solution idea is to get paths from root to leaves first, compute the sum later. Those paths can be easily discovered by depth first search, … Continue reading

Posted in Computer Science, LeetCode | Tagged , , , , | Leave a comment

Flatten Binary Tree

LeetCodeLink I have solved this problem weeks ago, but today I completely forgot how I had solved it. As I tried to simulate the interview, I started to think and finally came up with a solution, which is interestingly different … Continue reading

Posted in Computer Science, LeetCode | Leave a comment

Bellman-Ford’s Algorithm

Dijkstra’s algorithm is fast, but limited to non-negatively weighted graph. It also does not applicable for distributed system. Bellman-Ford’s algorithm is the solution for the two problems. It is asymptotically slower than Dijkstra’s algorithm as its complexity is O(EV). However, … Continue reading

Posted in Algorithms, Computer Science | Tagged , , , , | Leave a comment