Filter interviews by
Clear (1)
I was interviewed 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 was interviewed 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 was interviewed 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
I was interviewed before Sep 2020.
Round duration - 140 minutes
Round difficulty - Medium
Test timing was at 2:00 pm , it was conducted in a college and the environment was good for the test. Camera was a primary part of test, so no suspicious activity.
Given two numbers in the form of two arrays where each element of the array represents a digit, calculate the sum of these two numbers and return this sum as an ar...
Given two numbers represented as arrays, calculate their sum and return the result as an array.
Iterate through the arrays from right to left, adding digits and carrying over if necessary
Handle cases where one array is longer than the other by considering the remaining digits
Ensure the final sum array does not have any leading zeros
Round duration - 20 minutes
Round difficulty - Easy
The round was conducted at around 12 p.m. I was called at the college location and then it was conducted. The interviewer was quite polite and frank.
Round duration - 8 minutes
Round difficulty - Easy
This round was conducted right after finishing and clearing the technical round at the same place and on the same day.
Tip 1 : Practice atleast 2-3 Coding problems daily so your logic building becomes stronger.
Tip 2 : Exercise problems based on OOPS concepts and others too.
Tip 3 : If you can have your own project built, then it's the major point and will act as a plus point.
Tip 1 : Your resume should be in standard form, short and simple will be more effective.
Tip 2 : Whatever you have learned, you need to mention it in your resume as that will be your primary source of selection and having project on your resume is important.
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Feb 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2020. There was 1 interview round.
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
Software Engineer
374
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
239
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
176
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
164
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer III
147
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech