Esyasoft Interview Questions and Answers

Easy level to Medium level

2 Easy questions of DSA

Q1. One DSA question
Add your answer
Q2. Normal discussion about tech stack
Add your answer

Q1. Tell about yourself
Add your answer
Q2. Why do you want to join digit?
Add your answer

Q1. Stock buy and sell with at most 2 transaction
Ans. 
Implement a solution to find the maximum profit from buying and selling stocks with at most 2 transactions.
• Use dynamic programming to keep track of maximum profit at each day with 0, 1, or 2 transactions.

• Consider the possibility of splitting the transactions into two separate parts.

• Calculate the maximum profit by iterating through the prices array and updating the maximum profit accordingly.
Answered by AI
Add your answer
Q2. Binary search to find target
Ans. 
Binary search is a divide and conquer algorithm that efficiently finds a target value in a sorted array.
• Divide the array in half and compare the target value with the middle element

• If the target is less than the middle element, search the left half. If greater, search the right half

• Repeat the process until the target is found or the subarray is empty
Answered by AI
Add your answer

Q1. General about project
Add your answer
Q2. Design paytm wallet
Ans. 
Design a digital wallet system similar to Paytm.
• Allow users to add money to their wallet using various payment methods like credit/debit cards, net banking, UPI, etc.

• Enable users to make payments for various services like mobile recharge, bill payments, online shopping, etc.

• Implement security measures like two-factor authentication, encryption of sensitive data, and regular security audits.

• Provide features like transac...read more
Answered by AI
Add your answer

Q1. What is thread ?
Ans. 
A thread is a lightweight process that can run concurrently with other threads within the same process.
• Threads allow for parallel execution of tasks within a single process.

• Threads share the same memory space and resources of the process they belong to.

• Threads can communicate with each other through shared memory or message passing.

• Examples: Java threads, POSIX threads (pthreads) in C/C++.
Answered by AI
Add your answer
Q2. Inter process communication and project?
Add your answer

Seat reservation system
bit manipulation
binary tree related

Q1. Bfs / dfs traversal question
Add your answer

Majorily on SQL and Databases

Q1. Align two images in a page with same width and same height
Ans. 
Use CSS to align two images with same width and height on a page
• Set both images to have the same width and height using CSS

• Use flexbox or grid layout to align the images horizontally or vertically

• Adjust margins or padding to fine-tune the alignment
Answered by AI
Add your answer
Q2. Array related question
Add your answer

Q1. Situation based question
Add your answer
Q2. Majorily focused on project
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The round consisted of 2 coding Problems and it lasted for 60 minutes from 12:00 PM to 1:00 PM on Hackerearth.
Use of other IDEs was prohibited and video was on.

Q1. 
Implement indexOf Function
You are provided with two strings A and B. Your task is to find the index of the first occurrence of A within B. If A is not found in B, return -1.
Example:
Input:
A = "bc", ...read more
Ans. 
Implement a function to find the index of the first occurrence of one string within another string.
• Iterate through the second string and check if a substring of the same length as the first string matches the first string.

• Return the index of the first occurrence of the first string within the second string, or -1 if not found.

• Handle edge cases like empty strings or when the first string is longer than the second string
Answered by AI
Add your answer
Q2. 
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...read more
Ans. 
Search for integers in a rotated sorted array efficiently.
• Implement binary search to find the target integer in the rotated array.

• Handle the rotation by checking which side of the array is sorted before performing binary search.

• Return the index of the target integer if found, else return -1.

• Time complexity of O(logN) is required for each query.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The round was conducted on Google Meet with 2 interviewers . They were friendly and helpful.
The timing was 12:00 to 1:00 PM.
Our Video was on .

Q1. 
Distinct Subsequences Problem Statement
You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.
Exampl...read more
Ans. 
Calculate the number of distinct subsequences in a string with possible duplicates.
• Use dynamic programming to keep track of the count of distinct subsequences for each character in the string.

• Consider the cases where the current character is included or excluded in the subsequence.

• Handle duplicates by considering the previous occurrence of the character.

• Return the count of distinct subsequences modulo 10^9 + 7.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a Behavioral Round. It lasted for 45-50 minutes. It consisted of a discussion on my projects. The interviewer was very impressed by the way I explained my projects. She even appreciated me for that. This was followed by normal HR questions .Timing of This round was 4:00 PM to 5:00 PM

Duration 1Hr
2 coding questions

Q1. Don't remember the questions
Add your answer
Q2. Don't remember the questions.
Add your answer