Wish Net Desktop Support Engineer Interview Questions and Answers

Round duration - 40 Minutes
Round difficulty - Medium

Round 1 was mainly focused on data structures and algorithms ,core java concepts and dbms

Q1. You are given a string. What is the minimum number of characters that need to be inserted to convert it into a palindrome?
Ans. 
The minimum number of characters needed to convert a string into a palindrome is the length of the string minus the length of the longest palindromic subsequence of the string.
• Find the longest palindromic subsequence of the given string.

• Subtract the length of the longest palindromic subsequence from the length of the original string to get the minimum number of characters needed to convert it into a palindrome.
Answered by AI
Add your answer

Round duration - 40 to 50 min
Round difficulty - Medium

Focussed mainly on projects and system design

Round duration - 30 Minutes
Round difficulty - Medium

Managerial round

Round duration - 20 Minutes
Round difficulty - Easy

Round duration - 30 Minutes
Round difficulty - Easy

In this round, Interviewer tried to judge if my basics are clear or not. 
He focused majorly on CS fundamentals.
He was pretty cooperative and gave me time after asking questions.

Q1. Have you ever solved a complex Java problem on your own?
Ans. 
Yes, I have solved a complex Java problem on my own.
• I once had to optimize a large-scale Java application by implementing multithreading to improve performance.

• I successfully debugged a memory leak issue in a Java program by analyzing heap dumps and identifying the root cause.

• I designed and implemented a custom data structure in Java to efficiently solve a specific problem.
Answered by AI
Add your answer
Q2. 
N-th Fibonacci Number Problem Statement
Given an integer ‘N’, your task is to find and return the N’th Fibonacci number using matrix exponentiation.
Since the answer can be very large, return the answer ...read more
Ans. 
The task is to find the Nth Fibonacci number using matrix exponentiation and return the answer modulo 10^9 + 7.
• Implement a function to find the Nth Fibonacci number using matrix exponentiation.

• Return the answer modulo 10^9 + 7 to handle large values.

• Use the formula F(n) = F(n-1) + F(n-2) with initial values F(1) = F(2) = 1.

• Optimize the solution to achieve better than O(N) time complexity.

• Consider solving the problem us...read more
Answered by AI
Add your answer
Q3. 
Swap Kth Elements in an Array
Given an array ARR of size N, perform the operation to swap the Kth element from the beginning with the Kth element from the end of the array.
Example:
Input:
N = 5, K = 2
...read more
Ans. 
Swap Kth elements in an array with given constraints.
• Create a function that takes the array, K value, and size of the array as input

• Swap the Kth element from the beginning with the Kth element from the end

• Handle edge cases like K being out of bounds or array size being less than 2
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was in late evening, interviewer was quite cool and asked me quite basic things about myself.

Q1. 
Covid Vaccination Distribution Problem
As the Government ramps up vaccination drives to combat the second wave of Covid-19, you are tasked with helping plan an effective vaccination schedule. Your goal is...read more
Ans. 
Given constraints and rules, maximize vaccines administered on a specific day during a vaccination drive.
• Iterate through each test case and calculate the maximum number of vaccines administered on the specified day.

• Distribute the available vaccines evenly across the days while adhering to the rules.

• Ensure that the sum of vaccines administered does not exceed the maximum allowed.

• Maximize the vaccines administered on the
Answered by AI
Add your answer