from collections import defaultdict

def combine_values(*dicts):
  res = defaultdict(list)
  for d in dicts:
    for key in d:
      res[key].append(d[key])
  return dict(res)
  
d1 = {'a': 1, 'b': 'foo', 'c': 400}
d2 = {'a': 3, 'b': 200, 'd': 400}

combine_values(d1, d2) # {'a': [1, 3], 'b': ['foo', 200], 'c': [400], 'd': [400]}

import re

def find_pattern(text, pattern):
    match = re.search(pattern, text)
    if match:
        return match.group()
    else:
        return 'No match found'

text = 'Hello, world! This is a test.'
pattern = r'world!.*test.'

result = find_pattern(text, pattern)
print(result)

#question1.py
def rose(n) :
  if n==0 : 
    yield []
  else :
    for k in range(0,n) :    
      for l in rose(k) :
        for r in rose(n-1-k) :      
            yield [l]+[r]+[r]
            
def start(n) :
  for x in rose(n) : 
      print(x) #basically I am printing x for each rose(n) file


print("starting program: \n")
start(2) # here is where I call the start function

# Python code to demonstrate
# method to remove i'th character
# Naive Method

# Initializing String
test_str = "CodeCatch"

# Printing original string
print ("The original string is : " + test_str)

# Removing char at pos 3
# using loop
new_str = ""

for i in range(len(test_str)):
	if i != 2:
		new_str = new_str + test_str[i]

# Printing string after removal
print ("The string after removal of i'th character : " + new_str)

# Python program to reverse a linked list
# Time Complexity : O(n)
# Space Complexity : O(n) as 'next'
#variable is getting created in each loop.

# Node class


class Node:

	# Constructor to initialize the node object
	def __init__(self, data):
		self.data = data
		self.next = None


class LinkedList:

	# Function to initialize head
	def __init__(self):
		self.head = None

	# Function to reverse the linked list
	def reverse(self):
		prev = None
		current = self.head
		while(current is not None):
			next = current.next
			current.next = prev
			prev = current
			current = next
		self.head = prev

	# Function to insert a new node at the beginning
	def push(self, new_data):
		new_node = Node(new_data)
		new_node.next = self.head
		self.head = new_node

	# Utility function to print the linked LinkedList
	def printList(self):
		temp = self.head
		while(temp):
			print temp.data,
			temp = temp.next


# Driver program to test above functions
llist = LinkedList()
llist.push(20)
llist.push(4)
llist.push(15)
llist.push(85)

print "Given Linked List"
llist.printList()
llist.reverse()
print "\nReversed Linked List"
llist.printList()

{"output":{"name":"format_final_json_response","arguments":{"output":{}}}}