Instantly share code, notes, and snippets.

# Piyush Kandpal piyushkandpal

Created October 19, 2014 10:42
//https://www.hackerrank.com/challenges/the-quickest-way-up Snake and ladder game python solution
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 # Enter your code here. Read input from STDIN. Print output to STDOUT T = raw_input() #print T jumps = {} for i in range(int(T)): L,S = raw_input().split(',') ladder_dict = { k:v for k,v in (d.split(',') for d in iter(raw_input().split())) } snake_dict = { k:v for k,v in (d.split(',') for d in iter(raw_input().split())) } ladder_dict.update(snake_dict) jumps = ladder_dict
Created October 17, 2014 17:10
// algorithm solution for https://www.hackerrank.com/challenges/even-tree
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 I used BFS to travel through the nodes. First, maintain an array separately to store the total number of child nodes + 1. So, you can initially assign all the leaf nodes with value 1 in this array. Now start from the last node and count the number of children for each node. This will work in bottom to top manner and the array that stores the number of child nodes will help in runtime to optimize the code. Once you get the array after getting the number of children nodes for all the nodes, just counting the nodes with even number of nodes gives the answer. Note: I did not include root node in counting in final step.
Created October 17, 2014 17:07
Tree traversal in python
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 from collections import namedtuple from sys import stdout Node = namedtuple('Node', 'data, left, right') tree = Node(1, Node(2, Node(4, Node(7, None, None), None), Node(5, None, None)),
Created October 17, 2014 15:09
// solution for https://www.hackerrank.com/challenges/even-tree
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 // solution for https://www.hackerrank.com/challenges/even-tree #include #include #include #include #include #include #include