Signode Associate Engineer Interview Questions and Answers

Aptitude is easy and if your basics are strong

Coding round has 2 parts realtime coding and coding

Q1. Asked about projects
Add your answer
Q2. Asked about oop concept
Add your answer

Q1. Qualifications and Experience
Add your answer

Q1. All about my Working experience
Add your answer

Technical assesment was there in first round

Q1. Interview with national manager, CTO and fellow developer
Add your answer

Q1. Meeting with regional head of IT department
Add your answer

Q1. Technical skill
Add your answer
Q2. Family background
Add your answer

Q1. Questions were asked on Recursive programming
Add your answer
Q2. What is the output of this? static void Main(string[] args) { DivideNumber(233) } static void DivideNumber(int n) { if(n>=10) { DivideNumber(n/10); } Console.Write(n/10) }
Ans. 
The output will be 23323
• The DivideNumber method recursively divides the input number by 10 until it is less than 10

• The Console.Write statement prints the result of n/10 each time the method is called
Answered by AI
View 1 more answer
Q3. Write Code If Input is 123, output should be "One Hundred Twenty Three";
Ans. 
Convert numeric input to words in English
• Break down the input number into hundreds, tens, and ones place

• Use a dictionary or array to map numbers to their corresponding words

• Handle special cases like teens and tens separately
Answered by AI
Add your answer

Q1. Basic java questions
Add your answer
Q2. Situation based question
Add your answer

Round duration - 120 minutes
Round difficulty - Easy

The test had it's webcam on, we were not allowed to go out of the frame.

Q1. 
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.
Input:
...read more
Ans. 
The program calculates the Nth Fibonacci number using a recursive formula.
• The Fibonacci series starts with 1, 1, and each subsequent number is the sum of the two preceding numbers.

• The program uses a recursive function to calculate the Nth Fibonacci number.

• The time complexity of the program is O(2^N), which can be optimized using memoization or dynamic programming.
Answered by AI
Add your answer
Q2. 
Longest Consecutive Sequence Problem Statement
You are provided with an unsorted array/list ARR of N integers. Your task is to determine the length of the longest consecutive sequence present in the array...read more
Ans. 
The task is to find the length of the longest consecutive sequence in an unsorted array of integers.
• Sort the array to bring consecutive numbers together

• Iterate through the sorted array and keep track of the current consecutive sequence length

• Update the maximum length if a longer sequence is found
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

The interview was online from home.

Q1. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. 
The task is to reverse a given string containing lowercase letters, uppercase letters, digits, and special characters.
• Iterate through the string from the last character to the first character and append each character to a new string.

• Alternatively, you can use built-in string reversal functions or methods available in your programming language.

• To solve the follow-up question with O(1) space complexity, you can use a tw...read more
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

This was last round. In this round interviewer ask about me and what i know about company. Also he ask about my projects as well as my future goals . 
The interviewer was very understanding and supportive.