Infosys DSE Interview Experience (OnCampus via HackWithInfy)
Summary
I went through the Infosys DSE interview process, which included a virtual online assessment, an onsite coding assessment, and an onsite interview covering coding, DBMS, and machine learning topics.
Full Experience
Round 1: Virtual Online Assessment involving 3 Ques (Easy, Med, Hard) i don't remember the questions exactly
Round 2: OnSite Coding Assessment having 4 Ques (Easy, Med, Hard, Complex)
-
Easy: Given an Array First Add all odd index and even index then give sum_odd - sum_even elements then swap odd and even sum and do sum_even - sum_odd and return minimum out of these
-
Medium & Hard i don't remember but they were of Greedy and DP as well
-
Complex: Given 2 grids say Grid1 and Grid2 then calculate minimum path sum from (0,0) cell to (n,m) cell i.e Bottom Right cell and we can switch grids with a cost of S
Round 3: Onsite Interview at Noida (Galgotias University)
- I was Asked:
- <>, := (Walrus Operator), MOD, abs, != operators
- Pen Paper Code: Fibonacci Series, Bubble Sort and https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
- Make Sure to Back your Every Keyword Listed under RESUME Very Important
- DBMS Questions: Delete V/s Truncate(atleast 3 differences)
- Machine Learning(Because i mentioned it on my resume): ML Types, Libraries Used
- Other Candidates were also asked about: Cloud Computing, OOPS concept + implement any 2 constructors, Garbage Collection, Java multiply integer and decimal number, given string print alpha-numeric
All the best!
Interview Questions (3)
Array Odd/Even Index Sum Minimum
Given an array, first compute the sum of elements at odd indices and the sum of elements at even indices. Then calculate sum_odd - sum_even. Next, swap the odd and even sums and compute sum_even - sum_odd. Return the minimum of the two results.
Minimum Path Sum with Grid Switching Cost
You are given two grids, Grid1 and Grid2, each of size n x m. Starting from cell (0,0) you need to reach cell (n‑1,m‑1). You may move only right or down. At any step you can switch from one grid to the other, incurring a switching cost S. Find the minimum total path sum to reach the bottom‑right cell, including any switching costs.
Best Time to Buy and Sell Stock
Given an array where prices[i] is the price of a given stock on day i, find the maximum profit you can achieve. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times).
Preparation Tips
Personal Tip: You could easily solve all 4 questions but passing all hidden test cases is tough, so focus on writing optimal code so you don't get stuck.