HackerRank Customer Service Capacity

Hi, today I would like to show you how to solve the code puzzle with the time line. Where you have to in O(n) determine how many maximal events happen Continue ReadingHackerRank Customer Service Capacity

Binary Tree Visible Nodes Counting

Hi, today I would like to share with you solution of the code puzzle with binary tree. There are 2 trees examples t1 and t2 and your job is to Continue ReadingBinary Tree Visible Nodes Counting