Rating: 4.35 |
(Hint: Use number keys to rate)
(Hint: Use number keys to rate)
13.09.2021 - 14:01:36 <anon> eka!
13.09.2021 - 14:01:58 <anon> degecijó vagyok. sikerült elsőznöm
13.09.2021 - 14:24:03 <anon> What is an array in this context? This a programming thing?
13.09.2021 - 14:51:40 <anon> Very much a programming thing, and answering this way means that the person in question doesn't understand arrays and problems in sorting things fast. Its also fucking stupid question, because it doesn't express any contextual data that would demand a certain choice over another, and ironically means the interviewer is a programmer with dick in his butt
13.09.2021 - 15:31:20 <anon> Is it really a thing that programmers should spend their time on such inane details? Your two list comparision or some other O(n) approach is probably just an errorprone solution to a nonexistant problem. I get it if the piece is critical performance-wise, but otherwise you are just wasting resources on a simple thing and making it unnecessarily complex.
13.09.2021 - 15:36:48 <anon> No answers yet. Start from the array, put it in mem1, take next, compare to mem1, if bigger, put it in mem1, if not put to mem2. Take next, compare it to mem2, if smaller, repeat previous. If bigger, compare to mem1 if bigger, copy mem1 to mem2 and store to mem1. Repeat and in the end mem2 has 2:nd biggest.
13.09.2021 - 15:46:56 <anon> häh! en tajuu? t persu ÄIJÄ
13.09.2021 - 15:54:38 <anon> siis, sort by value ja sitten get top 1 value + 1
13.09.2021 - 16:02:41 <anon> ok well first off 'maximum number' is vague, does he mean the second largest number or something else? Next, an array isn't specific to cs, there are arrays in math, so its not necessarily a computer programming question either.
13.09.2021 - 19:22:33 <anon> 13.09.2021 - 14:01:58 <anon> degecijó vagyok. sikerült elsőznöm -> nem sikerült :D
13.09.2021 - 20:21:54 <anon> Everyone knows this is a trick question
13.09.2021 - 21:49:15 <anon> Mun arrayssa ei ole duplikaatteja.
14.09.2021 - 00:05:41 <anon> Return(0);
14.09.2021 - 06:59:50 <anon> https://www.geeksforgeeks.org/find-second-largest-element-array/
16.09.2021 - 13:10:58 <anon> Sure, first I google the fastest way and then I copy paste.
30.09.2021 - 22:02:36 <anon> take a random number between 0 and 4billion or whatever and hope for the best!
30.06.2024 - 16:36:02 <anon> std::nth_element morons