Sigmoid Recruitment Process for ASDE (Assistant Software Development Engineer) on Campus NIT Patna

Round 1: Coding + Aptitude + C++/Java Input Output
Coding: There were 4 coding questions which were of moderate level.  We had to solved in 1:00 hours. All were 20×4=80 + 20 = 100 marks (Aptitude + C++/Java Input-Output, Some questions carried negative marking too).

Question 1: Count Occurrences

Question 2: Maximum sum of lengths of non-overlapping subarrays with k as the max element.



Question 3: K-Primes (Numbers with k prime factors) in a range

You are given two integer M and N. You have to find the prime factors of all the numbers in the range[M, N](both inclusive).
Write a program to find the number of times a prime number P comes in the prime factorization of the numbers in the range. Print the answer multiplied by number K.

Question 4: Rearranging arrays
In a given array, remove every occurrence of K, shift all remaining elements on left, and insert as many 1 as K occurred.

Whoever solved 3 questions, got selected for next rounds.

Question: What does the following declaration signify?

int (*ptr)[10];

  1. ptr is an array of pointers to 10 integers

  2. ptr is a pointer to an array of 10 integers

  3. ptr is an array of 10 integers

  4. ptr is a pointer to an array


Question: What does the following declaration signify?

int (*pf)();

  1. pf is a pointer to a function

  2. pf is a function pointer

  3. pf is a pointer to a function which returns ‘int’.

  4. pf is a function of a pointer variable.

Round 2: In this round interviewer wanted to know whether the candidate is able to write code or not. He didn’t care about time and space complexity. There are some questions which were asked to me as well as other selected candidates. Trap water problem, Next greater element on right, Flattening linked list(hard level), Add two numbers in linked list, Max area in histogram, Max area rectangle in binary Matrix, Find Peak element in array, Max sum from leaf to leaf in Binary tree, Stack Queue & Linked list implementation  insertion-deletion and update, left view of Binary tree, longest palindromic substring, max sum of array having no adjacent elements.

Tips – Practice Must do coding question from geeksforgeeks and solve as many as questions from interviewbit. Be clear with your approach.

Round 3: It was also coding round where we had to give optimised approach and code as well i.e. asked above. He told me to solve Rainwater Trapping problem and I solved it with optimisation. Apart from these, he discussed with me about my projects like what was your role and what’s your contribution in project, how your project works and issues came during projects. The interviewer will give you enough time to think, to code, to optimise, so think logically and explain your approach clearly by giving a satisfactory reason.

Tips – Honesty is the best policy. You will be caught very easily if you are faking, so be honest. Do all the optimisation problems of array.


    Round 4 : This was HR round and he wanted to judge my communication skill and interpersonal skill. Keep in mind that don’t be over smart and you can’t make fool of HR. Be honest and say according to your CV. He asked me:

  1. Tell me something about myself, your family, your interest area, hobby, etc.
  2. Your favorite programming language and why?
  3. Which subject do you like most and hate most?
  4. Who is your favorite teacher?

Any questions ?? You should ask as What is work culture and life balance in sigmoid and How do you make money using data and what is the source of data in which you perform operation etc.

After this round, results were declared very soon, and I was one of the selected candidates.


Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.


Article Tags :

2


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.