TechiMomi DagnyTagg2013

## detectValidExpressionBracketsMatch
"""

MATCH BRACKETS

"""

"""

BAM:  dynamic STACK - append opens, then match-pop on closes
      DICT to match CLOSE to OPEN (as BACK-MATCH),

## buildFriendshipsAdjacencyList
#
# You have data for social network on who is friends with whom.
# You need to write a function that returns this data in the form of an adjacency list representation, i.e. a mapping of each employee ID to a list of his/her friends on the site
# #
# You have two input data sets to work with. The first data set is the employees at your company, and the second is all the pairs of employees who are virtually friends so far. It does not matter which employee's ID is in which column, the friendships are bidirectional.
#
# employees_input = [
#   "1,Richard,Engineering",
#   "2,Erlich,HR",
#   "3,Monica,Business",

## wordPermutations
"""

  Given String "ABC", print all 3-letter permutations of this

"""

# SOLUTION:  - FULL decision tree
#            - each level is character place,
#              each branch a choice of one char
#            - REMAINING unchosen characters

## getPhoneNumWords

"""

PROBLEM:

  4-digit number:  2284
  - assume have dictionary isWord(String word)
  - assume have phonenum pad digit to set of letters
  - print all possible words of ANY length up to 4-digits
	"""

	MATCH BRACKETS

	"""

	"""

	BAM: dynamic STACK - append opens, then match-pop on closes
	DICT to match CLOSE to OPEN (as BACK-MATCH),
	#
	# You have data for social network on who is friends with whom.
	# You need to write a function that returns this data in the form of an adjacency list representation, i.e. a mapping of each employee ID to a list of his/her friends on the site
	# #
	# You have two input data sets to work with. The first data set is the employees at your company, and the second is all the pairs of employees who are virtually friends so far. It does not matter which employee's ID is in which column, the friendships are bidirectional.
	#
	# employees_input = [
	# "1,Richard,Engineering",
	# "2,Erlich,HR",
	# "3,Monica,Business",
	"""

	Given String "ABC", print all 3-letter permutations of this

	"""

	# SOLUTION: - FULL decision tree
	# - each level is character place,
	# each branch a choice of one char
	# - REMAINING unchosen characters

	"""

	PROBLEM:

	4-digit number: 2284
	- assume have dictionary isWord(String word)
	- assume have phonenum pad digit to set of letters
	- print all possible words of ANY length up to 4-digits