You can get the full application in Dhiraj Patra github repo.
Not gonna lie, your code is pretty bad, no separations of concerns, no contextual logging. The position was for a senior engineer, your stuff is junior level at best. Don't lash people out for your inadequacy of the role.
Sorry but I have to be honest, your code is pretty bad. To me the true is, you are not good enough and that's it. You also were very anti ethical exposing the whole code challenging to your Github
Mehr Antworten anzeigen
Sorry but your code is not for HelloFresh. It's for GoneRotten.
To the guy talking about the ethics of publishing code challenges. Get real bro, companies are not Samaritans, so neither should we be. Talking about ethics in this context is cynical and weird.
The simplest solution for me is to loop through array, unset the current value then check if it is in the array which mean its duplicate and we add it to duplicated values array, if not ,its unique and added to another array for unique numbers .. in every iteration we check the number in the main array and in the duplicated array .. finally we print the unique array.
I have been asked about Technologies, Clean Code, Software Architecture and more detail discussion on my resume and software architecture and also some challenging scenarios to be discussed. It took almost 2 hours
I answered the software architecture questions, but they were more into asking about their current challenges and real scenarios that they were facing. I managed somehow to understand the challenge and put them into my own experience together in order to offer a solution for that. However, the phone call did not have good quality and I had to ask one question many times.
I have the same experience as you. Do you provide any reason for the rejection at all?
I have the same rejection without any reason. I feel bad about it as all look very well.
1. if n and n+2 are prime, the n+1 is dividable by 2; 2.one of the three subsequent number (n, n+1, n+2) must be dividable by 3. because n and n+2 are prime, then n+1 is dividable by 3. So n+1 is dividable by 6.
3, 4, 5. 3 and 5 are prime. 4 is not divisible by 6.
n+1 will be divisible by 2 since n and n+2 are prime now n,n+1 or n+2 any one of them should be divisible by 3 n and n+2 are prime so n+1 should be divisible by 3 Hence proved
I was a bit excited because the company was top in my list.
It's essential to demonstrate that you can really go deep... there are plenty of followup questions and (sometimes tangential) angles to explore. There's a lot of Senior IOS Developer experts who've worked at DeliveryHero, who provide this sort of practice through mock interviews. There's a whole list of them curated on Prepfully. prepfully.com/practice-interviews