Problem
Print all prime numbers from 1 to N, and then optimize your initial solution from O(N^2) to a more efficient time complexity.
Practicing as: Software Engineer interview at Hewlett Packard EnterpriseHi, I'll play your Hewlett Packard Enterprise interviewer for the Software Engineer role. Candidates describe these interviews as mostly positive and moderately difficult, so expect me to be friendly and conversational. Take your time with the question above and answer like we're in the room.
You are practicing as a guest. Sign up free to get your answer graded with AI feedback. Your draft stays right here.
