Implement a function all_anagram_groups() that, given many input strings, will identify and group words that are anagrams of each other. An anagram is word that is just a re-arrangement of the characters of another word, like "reap" and "pear" and "a per" (whitespace is ignored). But "pear" and "rep" are not, since "rep" does not have an "a". Also, "the" and "thee" are not anagrams, because "the" only has one "e".
Given this example input:
[ "pear","dirty room","amleth","reap","tinsel","hamlet","dormitory","listen","silent" ]
The output should be an array-of-arrays (or list-of-lists)
[
["pear","reap"],
["dirty room","dormitory"],
["amleth","hamlet"],
["tinsel","listen","silent"]
]Implement a function all_anagram_groups() that, given many input strings, will identify and group words that are anagrams of each other. An anagram is word that is just a re-arrangement of the characters of another word, like "reap" and "pear" and "a per" (whitespace is ignored). But "pear" and "rep" are not, since "rep" does not have an "a". Also, "the" and "thee" are not anagrams, because "the" only has one "e".
Given this example input:
[ "pear","dirty room","amleth","reap","tinsel","hamlet","dormitory","listen","silent" ]
The output should be an array-of-arrays (or list-of-lists)
[
["pear","reap"],
["dirty room","dormitory"],
["amleth","hamlet"],
["tinsel","listen","silent"]
]
Implement a function nondecreasing_subsequences() that, given a sequence of numbers such as:
[ 3,6,61,6,7,9,1,7,7,2,7,7,2,388,3,72,7 ]
... will identify and return each contiguous sub-sequence of non-decreasing numbers. E.g. this example input should return this array-of-arrays (e.g. or list-of-lists)
[ [3,6,61],[6,7,9],[1,7,7],[2,7,7],[2,388],[3,72],[7] ]
(Each array includes a sequence of numbers that do not get smaller. The original order is unchanged.) For a visual example of a non-decreasing, see:
http://en.wikipedia.org/wiki/File:Monotonicity_example1.pngImplement a function nondecreasing_subsequences() that, given a sequence of numbers such as:
[ 3,6,61,6,7,9,1,7,7,2,7,7,2,388,3,72,7 ]
... will identify and return each contiguous sub-sequence of non-decreasing numbers. E.g. this example input should return this array-of-arrays (e.g. or list-of-lists)
[ [3,6,61],[6,7,9],[1,7,7],[2,7,7],[2,388],[3,72],[7] ]
(Each array includes a sequence of numbers that do not get smaller. The original order is unchanged.) For a visual example of a non-decreasing, see:
http://en.wikipedia.org/wiki/File:Monotonicity_example1.png
/*
You have rating (0-10) of the hotels per user in this format:
scores = [
{'hotel_id': 1001, 'user_id': 501, 'score': 7},
{'hotel_id': 1001, 'user_id': 502, 'score': 7},
{'hotel_id': 1001, 'user_id': 503, 'score': 7},
{'hotel_id': 2001, 'user_id': 504, 'score': 10},
{'hotel_id': 3001, 'user_id': 505, 'score': 5},
{'hotel_id': 2001, 'user_id': 506, 'score': 5}
]
Any given hotel might have more than one score.
Implement a function, get_hotels(scores, min_avg_score) that returns a list of hotel ids that have average score equal to or higher than min_avg_score.
get_hotels(scores, 5) -> [1001, 2001, 3001]
get_hotels(scores, 7) -> [1001, 2001]
*//*
You have rating (0-10) of the hotels per user in this format:
scores = [
{'hotel_id': 1001, 'user_id': 501, 'score': 7},
{'hotel_id': 1001, 'user_id': 502, 'score': 7},
{'hotel_id': 1001, 'user_id': 503, 'score': 7},
{'hotel_id': 2001, 'user_id': 504, 'score': 10},
{'hotel_id': 3001, 'user_id': 505, 'score': 5},
{'hotel_id': 2001, 'user_id': 506, 'score': 5}
]
Any given hotel might have more than one score.
Implement a function, get_hotels(scores, min_avg_score) that returns a list of hotel ids that have average score equal to or higher than min_avg_score.
get_hotels(scores, 5) -> [1001, 2001, 3001]
get_hotels(scores, 7) -> [1001, 2001]
*/
1. Started with a HackerRank - session 5 questions - 90 mins, not very hard After that 6 rounds of interview:
2. HR round - to understand interest level, work experience and knowledge about Booking.com
3. Technical round - pair programming on a shared code-collaborator environment, 2 programming questions (basic array and hash questions)
Invited to Amsterdam - for face to face interview
4. HR round - for answering any questions, salary discussions etc.
5. Technical round - design graphite from scratch, evolved designed system to handle scaling scenarios
6. Technical round - 2 problems - a. retweet twitter tweets if newer one is an anagram of older one, b. 20 boxes - 500 GB log files on each - no processing box on server file, aggregate data on one box and parse for phone numbers - bookings. Efficiently.
7. Technical and Culture fit round: Discussed various scenarios encountered during work and how will be your behavior on them
8. HR round - offer ! - Offer very low pay, considering high cost of living NL - Amsterdam declined the offer1. Started with a HackerRank - session 5 questions - 90 mins, not very hard After that 6 rounds of interview:
2. HR round - to understand interest level, work experience and knowledge about Booking.com
3. Technical round - pair programming on a shared code-collaborator environment, 2 programming questions (basic array and hash questions)
Invited to Amsterdam - for face to face interview
4. HR round - for answering any questions, salary discussions etc.
5. Technical round - design graphite from scratch, evolved designed system to handle scaling scenarios
6. Technical round - 2 problems - a. retweet twitter tweets if newer one is an anagram of older one, b. 20 boxes - 500 GB log files on each - no processing box on server file, aggregate data on one box and parse for phone numbers - bookings. Efficiently.
7. Technical and Culture fit round: Discussed various scenarios encountered during work and how will be your behavior on them
8. HR round - offer ! - Offer very low pay, considering high cost of living NL - Amsterdam declined the offer
void sort(String s){ }
void sort(Integer I){ }
void sort(Object o){ }
calling : sort(null)
which function will be called?void sort(String s){ }
void sort(Integer I){ }
void sort(Object o){ }
calling : sort(null)
which function will be called?
Technical Question: Given the following list of integers, how would you sort it the most efficiently and weed out duplicates at the same time?Technical Question: Given the following list of integers, how would you sort it the most efficiently and weed out duplicates at the same time?
given a dictionary of words sorted according to a certain order, write a function to out put this order. e.g. input {abc, fkq, bct} output:{a, f, b, k, c, q, t}given a dictionary of words sorted according to a certain order, write a function to out put this order. e.g. input {abc, fkq, bct} output:{a, f, b, k, c, q, t}
1.In a certain company, 30 percent of the men and 20 percent of the women attend night school. If 40 percent of all employees are men, what percent of all the employees attend night school?1.In a certain company, 30 percent of the men and 20 percent of the women attend night school. If 40 percent of all employees are men, what percent of all the employees attend night school?
If it were two hours later, it would be half as long until midnight as it would be if it were an hour later. What time is it now?If it were two hours later, it would be half as long until midnight as it would be if it were an hour later. What time is it now?
why is the exponential function important in finance?why is the exponential function important in finance?
