Section #3: Lists and Sets
	Priority of problems (* means highly prefered):
	    (List questions):
		 *evenSum (#2)		
		 	  -Good warmup problem, uses foreach
		 *switchPairs (#5)	
		 	   -Medium difficulty, includes modification without adding any new elements
		 *stutter (#6)		
		 	  -Stutter very popular, good to see similar question for each data structure
		 *reverse3 (#9)		
		 	   -Challenge problem, interesting edge cases
		 removeDuplicates (#7)
		 collapse (#8)

	    (Set questions):
		 *removeEvens (#13)	
		 	   -Good set warmup, uses iterator
		 *hasOdd (#10)		
		 	   -Easy set warmup, shows similarity of lists and sets for the use of foreach
		 *containsAll (#14)	
		 	   -Medium difficulty, encoperates use of the "contains" method for best solution
		 equals (#16)
               		   -Challenge problem 
		 removeEvens (#13)
		 retainAll (#15)


Section #4: Stacks and Queues
	Priority of problems (* means highly prefered):
		  *splitStack (#1)      -Importance of saving old size when using a for-loop over a changing queue
	      	  *stutter (#2)		
		  *equals (#5)		-Medium problem that requires restoring the orignal state of the stack
		  *isConsecutive (#11)	-Difficult problem, requires keeping track of the previous element
		  *reverseHalf (#8)
		  reverseByN (#14)	-Challenge problem
		  isPalindrome (#9)	-Interesting Challenege problem with real-world-ish value