Filter interviews by
You are provided with a string STR
of length N
. The goal is to identify the longest palindromic substring within this string. In cases where multiple palindr...
Given a string, find the longest palindromic substring, prioritizing the one with the smallest start index.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found and its starting index
Return the longest palindromic substring with the smallest start index
Consider a scenario where you have been given a number of stairs. You start at the 0th stair and need to reach the Nth stair. With each stride, you can choose to...
The task is to find the number of distinct ways to move from the 0th to the Nth stair by ascending one or two steps at a time.
Use dynamic programming to solve this problem efficiently.
The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the number of ways to reach the (N-2)th stair.
Handle base cases for N=0 and N=1 separately.
Consider using memoization to avoid ...
I have worked on projects involving web development, machine learning, and mobile app development using technologies such as React, Python, and Flutter.
Web development project using React and Node.js for frontend and backend
Machine learning project using Python and TensorFlow for model training and deployment
Mobile app development project using Flutter for cross-platform app development
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numbe...
Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where there are less than 3 elements in the array.
Consider edge cases like negative integers and duplicates.
You are given two integers DAY_HOURS
and PARTS
. Consider a day with DAY_HOURS
hours, which can be divided into PARTS
equal parts. Your task is to determine the total inst...
Count the total instances of equivalent prime groups in a day divided into equal parts.
Divide the day into equal parts and check for prime groups at the same position in different parts.
Each prime group should consist of prime numbers occurring at different parts of the day.
Return the total number of equivalent prime groups found.
Example: For DAY_HOURS = 20 and PARTS = 2, there are 2 prime groups: 3-13 and 7-17.
Your task is to sort a list of repeated integers by their frequency in decreasing order. The element with the highest frequency should appear first. If two elements have the same...
The task is to sort a list of integers based on their frequency of repetition, with the element with the highest frequency first.
Count the frequency of each element in the list using a dictionary.
Sort the elements based on their frequency in descending order.
If two elements have the same frequency, maintain their original order.
Return the sorted list.
Given a doubly linked list of positive integers with size 'N', reverse the list and return the head of the modified list.
A doubly linked list allows traversal i...
The task is to reverse a given doubly linked list and return the head of the modified list.
Create three pointers: prev, current, and next.
Iterate through the linked list and update the next and prev pointers for each node.
Finally, update the head pointer to the last node visited and return it as the head of the reversed list.
Given an array containing N non-negative integers, your task is to partition this array into two subsets such that the absolute difference between their sum...
The task is to partition an array into two subsets such that the absolute difference between subset sums is minimum.
Iterate through all possible subsets of the array
Calculate the sum of each subset
Find the minimum absolute difference between the subset sums
I appeared for an interview in Jan 2021.
Round duration - 150 minutes
Round difficulty - Medium
It was an online round consisting of 2 programming questions restricted to C++, Java, and C# and 10 MCQ's on Data structures, Algorithms, etc..
You are given two integers DAY_HOURS
and PARTS
. Consider a day with DAY_HOURS
hours, which can be divided into PARTS
equal parts. Your task is to determine the total ins...
Count the total instances of equivalent prime groups in a day divided into equal parts.
Divide the day into equal parts and check for prime groups at the same position in different parts.
Each prime group should consist of prime numbers occurring at different parts of the day.
Return the total number of equivalent prime groups found.
Example: For DAY_HOURS = 20 and PARTS = 2, there are 2 prime groups: 3-13 and 7-17.
Round duration - 60 minutes
Round difficulty - Easy
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where there are less than 3 elements in the array.
Consider edge cases like negative integers and duplicates.
Round duration - 60 minutes
Round difficulty - Easy
I have worked on projects involving web development, machine learning, and mobile app development using technologies such as React, Python, and Flutter.
Web development project using React and Node.js for frontend and backend
Machine learning project using Python and TensorFlow for model training and deployment
Mobile app development project using Flutter for cross-platform app development
Round duration - 60 minutes
Round difficulty - Easy
Tip 1 : Practice Data Structures and Algorithms.
Tip 2 : Practice Puzzles from GFG.
Tip 3 : Should have good knowledge of OOPS.
Tip 1 : Have some good projects on your resume.
Tip 2 : Do not anything false in your resume.
Tip 3 : Mention your coding profiles in your resume.
I appeared for an interview in Dec 2020.
Round duration - 150 Minutes
Round difficulty - Easy
2 programming questions restricted to C++, Java, and C#
10 MCQ's on Data structures, Algorithms, etc.
Given an array containing N non-negative integers, your task is to partition this array into two subsets such that the absolute difference between their su...
The task is to partition an array into two subsets such that the absolute difference between subset sums is minimum.
Iterate through all possible subsets of the array
Calculate the sum of each subset
Find the minimum absolute difference between the subset sums
Round duration - 80 Minutes
Round difficulty - Medium
The round was conducted on FaceCode(HackerEarth) in the afternoon time. The OOPS features of CPP were asked. The SQL queries (Joins) were also asked. Two easy programming questions were asked - one array-based implementation and other one from the doubly linked list. Two puzzles were also asked. The interviewers were very nice and they gave me enough time to think about the solution.
Your task is to sort a list of repeated integers by their frequency in decreasing order. The element with the highest frequency should appear first. If two elements have the sam...
The task is to sort a list of integers based on their frequency of repetition, with the element with the highest frequency first.
Count the frequency of each element in the list using a dictionary.
Sort the elements based on their frequency in descending order.
If two elements have the same frequency, maintain their original order.
Return the sorted list.
Given a doubly linked list of positive integers with size 'N', reverse the list and return the head of the modified list.
A doubly linked list allows traversal ...
The task is to reverse a given doubly linked list and return the head of the modified list.
Create three pointers: prev, current, and next.
Iterate through the linked list and update the next and prev pointers for each node.
Finally, update the head pointer to the last node visited and return it as the head of the reversed list.
Round duration - 30 Minutes
Round difficulty - Easy
In this round, I was asked simple questions from core subjects.
Round duration - 10 Minutes
Round difficulty - Easy
It was in the evening on the same day after Techno Managerial round. HR asked me about my family background.
Tip 1 : Competitive coding and good knowledge of Data Structures and Algorithms is important
Tip 2 : Have very good knowledge of atleast one Programming Language
Tip 3 : Do atleast 2 projects, having an internship in your resume will be bonus
Tip 1 : Do not put false things, quantity is not important but the quality is. Have few things but you should have good knowledge of them.
Tip 2 : Keep it of 1 page with all the relevant details.
I appeared for an interview in Nov 2020.
Round duration - 120 minutes
Round difficulty - Medium
This was the first round and it consisted of 20 MCQs and 2 programming questions.
The test was on HackerEarth platform.
The test was of 2 hours , web-proctored and switching between tabs was not allowed.
You are provided with a string STR
of length N
. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...
Given a string, find the longest palindromic substring, prioritizing the one with the smallest start index.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found and its starting index
Return the longest palindromic substring with the smallest start index
Consider a scenario where you have been given a number of stairs. You start at the 0th stair and need to reach the Nth stair. With each stride, you can choose t...
The task is to find the number of distinct ways to move from the 0th to the Nth stair by ascending one or two steps at a time.
Use dynamic programming to solve this problem efficiently.
The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the number of ways to reach the (N-2)th stair.
Handle base cases for N=0 and N=1 separately.
Consider using memoization to avoid redun...
Round duration - 45 minutes
Round difficulty - Medium
This was the second round and the interview round. It was all about OOPS concepts , OS and DBMS fundamentals.It was of 45 minutes approximately .
Round duration - 30 minutes
Round difficulty - Medium
This was the third round and the round was focused on Projects and Puzzles. It was of 1/2 hour approximately.
Round duration - 30 minutes
Round difficulty - Medium
It was the last round and was all about HR questions.
Tip 1 : Atleast 200 to 250+ Data Structures and Algorithms Questions from LeetCode, GeeksForGeeks etc.
Tip 2 : Thorough with your Projects , Skills , any previous experience etc. mentioned in your resume.
Tip 3 : Practice of Mathematical and Logical Puzzles
Tip 1 : Mention projects which you can explain and defend clearly.
Tip 2 : Resume should always be crisp and clear and should be of 1 page.
Tip 3 : If you do competitive programming , you can put links of your various online platforms profiles like Codechef, Codeforces etc.
Tip 4 : There should not be any false achievements or false experience mentioned in the resume.
Top trending discussions
posted on 2 Jun 2022
I appeared for an interview before Jun 2021.
Had DSA and aptitude questions
I applied via Walk-in and was interviewed before Aug 2021. There were 3 interview rounds.
posted on 16 Sep 2021
I appeared for an interview in Oct 2020.
Round duration - 75 min
Round difficulty - Medium
This round was MCQ and coding round. 25 MCQs and one coding question were asked. MCQs were based on OS, DBMS, Aptitude and Data Structures.
You have 'N' tasks to complete. Each task can only be done on one of two specific days provided in two arrays: day1
and day2
.
For each task i, day1[i]
represents the earliest...
Find the minimum number of days required to complete all tasks given specific completion days for each task.
Sort the tasks based on day1 in ascending order.
For each task, choose the minimum of day1 and day2 as the completion day.
Keep track of the maximum completion day for each task.
The final answer is the maximum completion day of all tasks.
Round duration - 30 min
Round difficulty - Easy
This was a Data Structural round. Only one coding question was asked by the interviewer. The interviewer was very friendly. This round was very easy.
Sort the given unsorted array consisting of N non-negative integers in non-decreasing order using the Bubble Sort algorithm.
The first line contains an integer 'T' r...
Bubble Sort algorithm is used to sort an array of non-negative integers in non-decreasing order.
Implement the Bubble Sort algorithm to sort the array in place.
Compare adjacent elements and swap them if they are in the wrong order.
Repeat this process until the array is sorted.
Time complexity of Bubble Sort is O(n^2) in the worst case.
Example: For input [6, 2, 8, 4, 10], the output should be [2, 4, 6, 8, 10].
Tip 1 : Be confident!
Tip 2 : Maintain high Cgpa
Tip 3 : Do your best
Tip 1 : Mention clear points
Tip 2 : Atleast 3 projects and never put anything you have not revised
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 75 minutes
Round difficulty - Medium
It was in the evening.
It consisted of 26 questions of easy to hard level.
It consisted of 25 MCQs and only 1 coding problem.
Given a structured list of books and their authors, format the information as specified.
The first line of input contains an integer ‘T' representing the number of tes...
The task is to format a list of authors and their books in a specific way as per the given input format.
Parse the input to extract the number of test cases, number of authors, author names, and their respective books.
Format the output by printing the author names and their books in the specified format.
Ensure correct sequence and labeling of authors and books as per the example provided.
Handle multiple test cases and a...
Round duration - 15 minutes
Round difficulty - Medium
It was more of CV based round. A brief discussion on projects was there followed by some questions like why optum.
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
The first line co...
Implement a function to delete a node from a linked list at a specified position.
Traverse the linked list to find the node at the specified position.
Update the pointers of the previous and next nodes to skip the node to be deleted.
Handle edge cases such as deleting the head or tail of the linked list.
Ensure to free the memory of the deleted node to avoid memory leaks.
Round duration - 15 minutes
Round difficulty - Easy
A short round where some basic dbms questions like procedure, cursor were asked. Then some questions on whether I would prefer working alone or in a team. Where I see myself in 5 years.
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...
Given a graph with 'N' vertices and 'M' edges, determine if it can be colored using two colors without adjacent vertices sharing the same color.
Use graph coloring algorithm like BFS or DFS to check if the graph can be colored with two colors without conflicts.
Check if any adjacent vertices have the same color. If so, it is not possible to color the graph as described.
If the graph has connected components, color each co...
Tip 1 : Projects do not matter much for this company.
Tip 2 : I did almost all the puzzles from Interviewbit.
Tip 3 : DBMS is really important. Practice queries in SQL thoroughly. You should know the use of limit and top also. It may be asked to write the same query in more than 1 form.
Tip 4 : Practice all the data structures. Questions were simple and you should know the basics of every data structure.
Tip 1 : Don't write anything just for the sake of it.
Tip 2 : If you are writing some project then be thorough with all the details. If you are not much confident, then simply remove it and focus on other subjects.
posted on 12 Jun 2021
posted on 11 Apr 2021
I'm a passionate software engineer with a strong background in full-stack development and a love for solving complex problems.
Experience in developing web applications using React and Node.js.
Worked on a team project that improved application performance by 30%.
Strong understanding of algorithms and data structures, demonstrated in coding competitions.
Enjoy collaborating with cross-functional teams to deliver high-qual...
posted on 5 May 2021
Software Engineer
400
salaries
| ₹9.7 L/yr - ₹17.5 L/yr |
Senior Software Engineer
283
salaries
| ₹14.3 L/yr - ₹30 L/yr |
Software Engineer2
198
salaries
| ₹13 L/yr - ₹21.3 L/yr |
Software Engineer III
186
salaries
| ₹21.6 L/yr - ₹35 L/yr |
Software Engineer II
156
salaries
| ₹14.1 L/yr - ₹23 L/yr |
DXC Technology
Sutherland Global Services
Optum Global Solutions
Virtusa Consulting Services