floaterions
BAN USER
seems the best one. I have another solution, which is harder to understand, but takes up less space. But I myself prefer your approach.
- floaterions January 14, 2013Your answer seems correct except the best case analysis. The best case, i.e. the least number of points that put your team through, is 8 points.
Team A = 14
Team B = 12
Team C = 10
Team D = 8
Team E = 6
Team F = 4
Team G = 2
Team H = 0
Repjacobghester2, Accountant at ASAPInfosystemsPvtLtd
I'm an artist at heart. I went from print design to web development and lots of server administration professionally ...
Repjoyjerraj, Android test engineer at ASAPInfosystemsPvtLtd
I am a sales manager .I'm responsible for leading and coaching a team of salespeople. A sales manager's ...
RepRobin Strain, Consultant
I am from New york. I am 26 year old. I work in a Central Hardware as a Worker compensation ...
Repcharlieesandobal, Security Analyst at ADP
I am Charliee , a dedicated security professional at Monsource for the last 6 years managing security teams and corporate environments ...
Repjennifertkramer, AT&T Customer service email at ADP
I had a dream to open my own Restaurant in FL. and i came true all dream with my hard ...
Reptanyamayst, Android Engineer at ABC TECH SUPPORT
I am an experienced project support officer seeking a team focused on excellence and accelerated performance in a BMO company ...
RepJenniferSRoe, Android test engineer at Accolite software
I am Jennifer from Dublin. I am Photographer, I have experienced in all different kinds of photography -Strong aesthetic sense ...
RepSaraLopez, abc at ADP
Experienced in all aspects of business formation, operation, finance, and management. Visionary product developer with deep education in research and ...
Repjacksonbetty625, Accountant at 247quickbookshelp
My work is specialized help, regardless of whether on the telephone, face to face, or distantly, identified with PC frameworks ...
Repileenjconnelly, Cloud Support Associate at Absolute Softech Ltd
I have extensive experience in providing breaking news and giving precise details to the viewers. Interested in leading/working with ...
Repeffiefranke, Mail clerk at Envirotecture Design
Hello, I am Effie Mail clerk . I sort mail by department and category, utilizing sorting machines and similar administrative technology ...
Repsusiejcrider, Member Technical Staff at Accolite software
I was a Communications Consultant with experience in working across various clients .technology, consumer, hospitality, financial services and corporate social ...
Reploragurrero, Research Scientist at Absolute Softech Ltd
I am Lora , an empathetic and dedicated Community Organizer with a deep passion for helping others and a strong determination ...
Repvictorcraigw, Animator at Chicago Mercantile Exchange
Hi, I am Victor working as a Speech Writer in the USA. Spoke at an academic conference about mantra for ...
@chris: the interviewer explicitly states that the method could get called very often. So, sorting is not cheaper than pre-processing and constant lookup. To be more precise, assume that we will call this function m times a day.
- floaterions January 14, 20131) This algorithm: O(n*86400) + m* O(1)
2) Using sorting: O(m*n*logn)
Obviously, for even almost large values of n and m, the first algorithms works better