Gd and techincal interview idea to solve this problem is to iterate through all the numbers starting from 2 to (N/2) using a for loop and for every number check if it divides N. If we find any number that divides, we return false. If we did not find any number between 2 and N/2 which divides N then it means that N is prime and we will return True.
Interview questions [1]
Question 1
idea to solve this problem is to iterate through all the numbers starting from 2 to (N/2) using a for loop and for every number check if it divides N. If we find any number that divides, we return false. If we did not find any number between 2 and N/2 which divides N then it means that N is prime and we will return True.
ist positive medium difficulty and program oriented and hr is bit chill
The interview process was easy and smooth. Questions were basic, mainly on aptitude, programming fundamentals, projects, and communication. Interviewers were friendly, and overall the experience felt comfortable and manageable.
I applied through college or university. The process took 2 months. I interviewed at Saipem (Hyderābād) in Sep 2023
Interview
assessment round
communication round
tr round
1st round contained mcqs based on aptitude and 1 programming question.
2nd round contained letter writing, project, and paragraph reading and 3rd round was an interview that was mainly focused on java and sql.
