GitHub - raviswan/ProgrammingProblems · GitHub

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 14 Commits
PlaygroundGlobal		PlaygroundGlobal
AmazonInterviewReducePrice.cpp		AmazonInterviewReducePrice.cpp
AmazonOnsite-19		AmazonOnsite-19
Amazon_BitManipulation.c		Amazon_BitManipulation.c
AppleEvenOddRearrange.cpp		AppleEvenOddRearrange.cpp
AppleInterview.c		AppleInterview.c
AppleInterviewGridWalk.cpp		AppleInterviewGridWalk.cpp
AppleProblem.cpp		AppleProblem.cpp
Apple_Interview_July_2017		Apple_Interview_July_2017
Apple_TCP_Window_Impl.cpp		Apple_TCP_Window_Impl.cpp
DoublyLinkedList.c		DoublyLinkedList.c
Dropbox_RedBue		Dropbox_RedBue
Dropbox_RedBue.cpp		Dropbox_RedBue.cpp
FBInterview.c		FBInterview.c
FBOnsite.txt		FBOnsite.txt
FB_Interview.cpp		FB_Interview.cpp
FB_intervew.c		FB_intervew.c
Genesis_Practice.cpp		Genesis_Practice.cpp
GoogleInterview.c		GoogleInterview.c
KargoTransformFunction		KargoTransformFunction
LeapMotionProblem.c		LeapMotionProblem.c
LinkedIn_interview.cpp		LinkedIn_interview.cpp
LotteryTicketProblem.py		LotteryTicketProblem.py
MerakiInterview.cpp		MerakiInterview.cpp
Nvidia.cpp		Nvidia.cpp
PostFixEvaluation.cpp		PostFixEvaluation.cpp
ProducerConsumer.cpp		ProducerConsumer.cpp
PureStorageInterview.c		PureStorageInterview.c
PureStorageInterview.cpp		PureStorageInterview.cpp
PureStoragePhone.cpp		PureStoragePhone.cpp
PureStorage_Interview.c		PureStorage_Interview.c
README		README
Sorting.c		Sorting.c
Square_interview.c		Square_interview.c
StackFindMax.cpp		StackFindMax.cpp
UberInterview		UberInterview
bitvector.cpp		bitvector.cpp
bitvector.h		bitvector.h
hashTable.cpp		hashTable.cpp
hashtable.h		hashtable.h
list.cpp		list.cpp
list.h		list.h
stringReverSal.cpp		stringReverSal.cpp
strtok.cpp		strtok.cpp
tp.cpp		tp.cpp
tripleByte.cpp		tripleByte.cpp

Repository files navigation

PROBLEM:
Winning Ticket!

Your favorite uncle, Morty, is crazy about the lottery and even crazier about how he picks his “lucky” numbers. And even though his “never fail” strategy has yet to succeed, Uncle Morty doesn't let that get him down.

Every week he searches through the Sunday newspaper to find a string of digits that might be potential lottery picks. But this week the newspaper has moved to a new electronic format, and instead of a comfortable pile of papers, Uncle Morty receives a text file with the stories.

Help your Uncle find his lotto picks. Given a large series of number strings, return each that might be suitable for a lottery ticket pick. Note that a valid lottery ticket must have 7 unique numbers between 1 and 59, digits must be used in order, and every digit must be used.

For example, given the following strings:

[ “1”, “42". “100848", “4938532894754”, “1234567”, “472844278465445”]

Your function should return:

4938532894754 -> 49 38 53 28 9 47 54 
1234567 -> 1 2 3 4 5 6 7


SOLUTION:

To run the script on Linux command prompt, do the following:
 $ python LotteryTicketProblem.py

 The list of strings to be tested is stored in  "lottery_list" variable on the
 first line of the program. If you would like to find out whether other strings 
 are valid lottery picks, please append those to the "lottery_list".
 Save and run the script again.