Timeline for Does the workload problem belong to a class of computer science problem?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 21, 2017 at 11:40 | comment | added | nonopolarity | Maybe I should... but sometimes I have a feeling that they don't really care | |
| Jan 21, 2017 at 9:37 | comment | added | paparazzo | @太極者無極而生 I hope you let them know your disappointment. | |
| Jan 21, 2017 at 7:03 | comment | added | nonopolarity | as I said, I really don't think this question is suitable for a short interview session | |
| Jan 21, 2017 at 3:37 | comment | added | paparazzo | Lot of stuff in the question. Good day. Sorry you did not get the job. | |
| Jan 21, 2017 at 3:20 | comment | added | nonopolarity | well, it says in the question it is UNIX time, so as of right now it is 1484968798, but it can be future scheduling too, so nothing can prevent it being a really big number. And what about 2.2, 2.2222? | |
| Jan 21, 2017 at 2:43 | comment | added | paparazzo | It passes the loop once - yes is it is O(n). What if the second set is not really big time slot. Really 3000000000000. You refer to array in your question so silly me I assume it will fit in an array. | |
| Jan 21, 2017 at 2:34 | comment | added | nonopolarity | can you use a higher language if possible... not very sure of C/C++/C# syntax... and are you sure it will do it in O(N)? (1) what if the time is 2.2, 2.8, etc? (2) what if there are 2 million time slots and workload, with the first million of them small slots, such as (5, 6, 11) and (7, 8, 20), and then, the second million of records are really big slots, such as (1, 1000000000, 2), and (0, 3000000000000, 20), so for these big slots, don't you have to fill in a lot of entries in an array? More than 2,000,000 if you have to fill to entry 3000000000000 | |
| Jan 20, 2017 at 22:17 | history | answered | paparazzo | CC BY-SA 3.0 |