INCA INFOTECH TECHNOLOGIES Software Developer Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

Q1. 
Generating Pascal's Triangle
Given an integer N, generate a 2-D array list representing Pascal's Triangle up to the N-th row.
An element in Pascal's Triangle is the sum of the two elements directly above...read more
Ans. 
Generate Pascal's Triangle up to N-th row using 2-D array list.
• Create a 2-D array list to store the Pascal's Triangle elements.

• Iterate through each row and calculate the elements based on the sum of the two elements above.

• Return the 2-D array list containing Pascal's Triangle up to the N-th row.
Answered by AI
Add your answer
Q2. 
Faulty Key Problem Statement
Ninja needs to create a function to calculate the sum of two integers without using the “+” operator due to keyboard issues. Help Ninja find the sum of two numbers without usi...read more
Ans. 
Calculate the sum of two integers without using the '+' operator or the '++' operator.
• Use bitwise XOR to add the two numbers without carrying.

• Use bitwise AND and left shift to handle the carry.

• Repeat the process until there is no carry left.

• Handle negative numbers by considering two's complement representation.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

It was a round held on Microsoft teams with a number of other candidates. We were given to design a meal planning software to improve customer experience and cost management in airport.

Round duration - 50 minutes
Round difficulty - Medium

A technical round .They asked about binary trees , diff between stacks queues , basic Coding qsns ,qsn on projects, java oops qsns , node js (since I wrote web development)

Q1. 
Binary Pattern Problem Statement
Given an input integer N, your task is to print a binary pattern as follows:
Example:
Input:
N = 4
Output:
1111
000
11
0
Explanation:
The first line contains 'N' 1s. T...read more
Ans. 
Print a binary pattern based on input integer N in a specific format.
• Given an input integer N, print a binary pattern as described in the problem statement.

• Start with N 1s on the first line, then alternate between N-1 0s and N-2 1s on subsequent lines.

• Follow the constraints of 1 ≤ T ≤ 10, 1 ≤ N ≤ 10^3, and a time limit of 1 sec.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy