Month: November 2019

Balanced Binary Tree | LeetCode 110

AFFILIATE LINKS Great resource I use to learn algorithms.40% off Tech Interview Pro: http://techinterviewpro.com/terriblewhiteboard20% off CoderPro: http://coderpro.com/terriblewhiteboard Here is the full implementation.

Factorial Trailing Zeroes | LeetCode 172

AFFILIATE LINKS Great resource I use to learn algorithms.40% off Tech Interview Pro: http://techinterviewpro.com/terriblewhiteboard20% off CoderPro: http://coderpro.com/terriblewhiteboard Here is the full implementation.

Linked List Cycle | LeetCode 141

AFFILIATE LINKS Great resource I use to learn algorithms.40% off Tech Interview Pro: http://techinterviewpro.com/terriblewhiteboard20% off CoderPro: http://coderpro.com/terriblewhiteboard Here is the full implementation.

Most Common Word | LeetCode 819

AFFILIATE LINKS Great resource I use to learn algorithms.40% off Tech Interview Pro: http://techinterviewpro.com/terriblewhiteboard20% off CoderPro: http://coderpro.com/terriblewhiteboard Here is the full implementation.

House Robber | LeetCode 198

AFFILIATE LINKS Great resource I use to learn algorithms.40% off Tech Interview Pro: http://techinterviewpro.com/terriblewhiteboard20% off CoderPro: http://coderpro.com/terriblewhiteboard We can use dynamic programming to solve this. First, make an array. Each index in the array will represent the choice that will give us the most money up to that point. The value of index zero is simple. It’s …

House Robber | LeetCode 198 Read More »

Valid Perfect Square | LeetCode 367

AFFILIATE LINKS Great resource I use to learn algorithms.40% off Tech Interview Pro: http://techinterviewpro.com/terriblewhiteboard20% off CoderPro: http://coderpro.com/terriblewhiteboard Here is the full implementation.

Minimum Depth of Binary Tree | LeetCode 111

AFFILIATE LINKS Great resource I use to learn algorithms.40% off Tech Interview Pro: http://techinterviewpro.com/terriblewhiteboard20% off CoderPro: http://coderpro.com/terriblewhiteboard Here is the full implementation.