Infosys Digital System Engineer Interview Experience

Infosys DSE Interview Experience 2023

On this page, we have provided the latest Infosys Interview Experience for the Digital Specialist Engineer role. These are the latest interview experiences of 2022-23 batch students.

Page Highlights:

• Infosys DSE Interview Experience
• Infosys FAQs
• Infosys Interview Experience

Infosys Interview Experience-1

Infosys Digital Specialist Engineer Interview Experience

• Name: Kavita
• College: Dr. B C Roy Engineering College
• Department: B.Tech CSE

I applied for the HackwithInfy competition, and from there I was shortlisted for the interview. I will share my entire Infosys Interview Experience with the readers.

I followed PrepInsta’s website for the coding questions and I found them helpful. There were in total 2 rounds.

1. HackwithInfy
2. Interview

Round 1:- HackwithInfy

The first round was HackwithInfy. This is a coding round and consists of 3 questions. Among the questions, two were of medium difficulty level while one was difficult.

I was able to solve two questions completely and pass the test cases, and on another question, I passed 14% of the test cases. One question was based on binary search, one was on the permutation concept and the last question was a Dynamic Programming question.

Question 1:-

There are three piles of stones. The first pile contains stone, the second pile contains b stones and the third pile contains c stones. You must choose one of the piles and split the stones from it to the other two piles; specifically, if the chosen pile initially contained s stones, you should choose an integer k (0≤k≤s), move k stones from the chosen pile onto one of the remaining two piles and s−k stones onto the other remaining pile. Determine if it is possible for the two remaining piles (in any order) to contain x stones and y stones respectively after performing this action.

One of the test cases is :
4

1 2 3 2 4

3 2 5 6 5

2 4 2 6 2

6 5 2 12 1

O/ p:

YES

NO

YES

NO

```#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main ()
{
int t;
cin >> t;
while (t--)
{
int a, b, c, x, y;
cin >> a >> b >> c >> x >> y;
if ((a + b + c) != (x + y))
{
cout << "NO" << endl;
}
else
{
if (y < min (a, min (b, c)) || x < min (a, min (b, c)))
{
cout << "NO" << endl;
}
else
{
cout << "YES" << endl;
}
}
}
}```

Find more HackwithInfy Coding Questions: here

Round 2:-Interview

I got shortlisted for the Interview. The interview was around 40-45 minutes long.

The Interviewer asked me questions about my final year project. I told him about the e-commerce website that I have built. I also highlighted the bugs which I faced and how I solved them. He asked me about ReactJs, which I had mentioned in my resume. I told him about my ReactJs projects.

Some of the questions which he asked me included:-

1. What are the four pillars of OOPS?

Four Pillars of OOPS:-

1. Abstraction
2. Encapsulation
3. Inheritance
4. Polymorphism

3. What is Exception Handling Java?

Exception Handling in Java handles runtime errors and maintains the normal flow of the application.

4. Write a program to sort an array using quick sort.

Code:-

```#include<stdio.h>

void mergeSort(int[],int,int);
void merge(int[],int,int,int);

void display(int arr[], int size){
int i;
for(i = 0; i < size; i++){
printf("%d ",arr[i]);
}
printf("\n");
}

void main()
{
int a[10]= {11, 9, 6, 19, 33, 64, 15, 75, 67, 88};
int i;

int size = sizeof(a)/sizeof(a[0]);
printf("Input: ");
display(a, size);

mergeSort(a, 0, size-1);
printf("Output: ");
display(a, size);
}

void mergeSort(int a[], int left, int right)
{
int mid;
if(left < right)
{
// can also use mid = left + (right - left) / 2
// this can avoid data type overflow
mid = (left + right)/2;

// recursive calls to sort first half and second half subarrays
mergeSort(a, left, mid);
mergeSort(a, mid + 1, right);
merge(a, left, mid, right);
}
}

void merge(int a[], int left, int mid, int right)
{
int i = left, j = mid + 1, p, index = left;
int temp[10];

while(i<=mid && j<=right)
{
if(a[i]<a[j]) { temp[index] = a[i]; i = i+1; } else { temp[index] = a[j]; j = j+1; } index++; } if(i>mid)
{
while(j<=right)
{
temp[index] = a[j];
index++;
j++;
}
}
else
{
while(i<=mid)
{
temp[index] = a[i];
index++;
i++;
}
}
p = left;
while(p<index)
{
a[p]=temp[p];
p++;
}
}```

5. Write a program for Fibonacci problem using recursion.

I answered both the coding problems. I gave brute force approach and also gave him the optimized solutions.

After the coding problems he gave me some SQL queries to solve.

6. Write a query to find the third highest salary of the employee from the employee table.

7. Difference between Delete and Truncate Command

Tips:-

My advice is just to be calm and confident. If you don’t know any answer, say that to the interviewer.