Filter interviews by
I was interviewed in Mar 2021.
Round duration - 60 Minutes
Round difficulty - Easy
The platform was HackerEarth time duration was 1 hour.
2 Coding questions were asked, 30 minutes for each were allotted.
Given a string S
of length L
, determine the length of the longest substring that contains no repeating characters.
"abac...
In the brute force approach, we will use two nested loops. The outer loop is used to select the starting index of the substring and the inner loop is used to fix the ending index of the substring. After selecting the substring, we will use another loop (or a method) to check whether the substring contains all unique characters or not using a HashSet.
Space Complexity: O(n)Explanation:O(L), where L is the len...
Given an array or list ARR
consisting of N
integers, your task is to identify all distinct triplets within the array that sum up to a specified number K
.
A t...
Round duration - 120 Minutes
Round difficulty - Hard
This was a 2 hours round, with the following problem statement. At the end of the allotted time you had give a demo and explain your implementation.
Round duration - 45 Minutes
Round difficulty - Medium
The platform was Zoom, time duration was 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms and real life problems.
Round duration - 20 Minutes
Round difficulty - Easy
Interviewer was very friendly. Asked few questions about myself and then asked questions about what I know about the company.
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice questions from leetcode as mostly questions were asked from that only.
Tip 3 : Revise Computer Science subjects like DBMS, OS & OOPS thoroughly, it'll help you ace last round
Tip 4 : Revise everything about your mentioned internship projects and self projects. Projects hold a great weight in selection.
Tip 1 : Competitive programming profiles is a must. That'll help you get shortlisted.
Tip 2 : Resume should reflect development and experience in DSA.
Tip 3 : Be genuine in your skills and technologies section, question will be asked from them.
I was interviewed in Mar 2021.
Round duration - 60 Minutes
Round difficulty - Medium
The platform was HackerEarth time duration was 1 hour.
2 Coding questions were asked, 30 minutes for each were allotted.
Given a string S
of length L
, determine the length of the longest substring that contains no repeating characters.
"abac...
The problem asks to find the length of the longest substring without repeating characters in a given string.
Use a sliding window approach to iterate through the string and keep track of the characters seen so far.
Maintain a set to check for duplicate characters within the current substring.
Update the maximum length of the substring whenever a duplicate character is encountered.
Continue the process until the end of the ...
Given an array Arr
consisting of N
integers, find all distinct triplets in the array that sum up to zero.
An array is said to have a triplet {Arr[i], Arr[j],...
The task is to find all distinct triplets in an array that add up to zero.
Iterate through the array and fix the first element of the triplet.
Use two pointers approach to find the other two elements that sum up to the negative of the fixed element.
Skip duplicate elements to avoid duplicate triplets.
Return the list of triplets found.
Round duration - 120 Minutes
Round difficulty - Hard
This was a 2 hours round, with the following problem statement. At the end of the allotted time you had give a demo and explain your implementation.
Round duration - 45 Minutes
Round difficulty - Medium
The platform was Zoom, time duration was 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms and real life problems.
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice questions from leetcode as mostly questions were asked from that only.
Tip 3 : Revise Computer Science subjects like DBMS, OS & OOPS thoroughly, it'll help you ace last round
Tip 4 : Revise everything about your mentioned internship projects and self projects. Projects hold a great weight in selection.
Tip 1 : Competitive programming profiles is a must. That'll help you get shortlisted.
Tip 2 : Resume should reflect development and experience in DSA.
Tip 3 : Be genuine in your skills and technologies section, question will be asked from them.
posted on 13 Nov 2024
Easy - Medium Leetcode
A ridesharing service connecting drivers with passengers for convenient and affordable transportation.
Allow users to request rides through a mobile app
Match drivers with passengers based on location and destination
Provide estimated arrival times and fare estimates
Implement a rating system for drivers and passengers
Offer options for shared rides to reduce costs
I was interviewed in Sep 2021.
Round duration - 60 minutes
Round difficulty - Medium
The round was technical round and it was held on google meet around 1 pm
Given an M x N matrix of integers ARR
, your task is to identify the rectangle within the matrix that has the greatest sum of its elements.
The first line of input co...
In this approach, we'll try to consider each rectangle that can be formed using elements of the array. To do this we fix (X1,Y1) coordinates of starting vertex and iterate through the matrix for every pair (X2,Y2) as the coordinates of ending vertex. Now we have a rectangle with coordinates (X1,Y1), (X1,Y2), (X2,Y1) and (X2,Y2).
We'll find the sum of elements within this rectangle and compare it with MAXSUM. ...
Round duration - 60 minutes
Round difficulty - Medium
It was managerial round and took place around 3 pm
You are provided with a string EXP
which represents a valid infix expression. Your task is to convert this given infix expression into a postfix expression.
An i...
We will scan the expression from left to write and if we encounter an operand we will append it to our answer. If we encounter an operator we will pop all the operators with equal or higher precedence and append them to our answer. And push the current operator. In the end, we will empty the stack.
Order of precedence = [ ‘^’, ‘*’ and ‘/’, ‘+’ and ‘-’, ‘(’, ‘)’]
Order of precedence [ link ]
The algorithm will be-
Tip 1 : Java concepts should be strong
Tip 2 : OOPS
Tip 3 : Projects should have scalability
Tip 1 : Projects detail should be short and precise
Tip 2 : Don't fake technical skills
posted on 9 Sep 2024
I applied via Recruitment Consulltant and was interviewed in Aug 2024. There were 3 interview rounds.
Aptitude Had around 50 Questions which cover Logical,Quantitative, Code snippets
Find two numbers in an array that add up to a specific target value.
Use a hashmap to store the difference between the target value and each element in the array.
Iterate through the array and check if the current element's complement exists in the hashmap.
Return the indices of the two numbers that add up to the target value.
final, finally, and finalize are related terms in programming but have different meanings and usage
final is a keyword in Java used to restrict inheritance, method overriding, and variable reassignment
finally is a block of code in exception handling that always executes, regardless of whether an exception is thrown
finalize is a method in Java used for cleanup operations before an object is garbage collected
Array List can be implemented in a stack by using an array and keeping track of the top element.
Create an array to store the elements of the stack.
Keep track of the top element using a variable.
For push operation, add the element to the top of the stack and increment the top index.
For pop operation, remove the top element and decrement the top index.
Find 3rd largest number in array without sorting
Iterate through array to find largest, 2nd largest, and 3rd largest numbers
Keep track of these numbers as you iterate
Return the 3rd largest number found
To find the minimum number of swaps needed to sort an array
Use graph theory to find cycles in the array
Count the number of swaps needed to fix each cycle
Add up the swaps needed for all cycles to get the total minimum swaps
It was combination of mcqs and 2 coding questions
Object-oriented programming concepts that focus on objects and classes for better code organization and reusability.
Encapsulation: Bundling data and methods that operate on the data into a single unit (class).
Inheritance: Ability of a class to inherit properties and behavior from another class.
Polymorphism: Ability to present the same interface for different data types.
Abstraction: Hiding the complex implementation det...
Java is a programming language while Putjon is not a recognized term in software development.
Java is a widely used programming language for developing applications.
Putjon is not a recognized term in software development, it may be a typo or a specific term not commonly used.
There is no direct comparison between Java and Putjon as they are not related.
posted on 7 Sep 2024
I was interviewed in Aug 2024.
Medium level leetcode question
Developed a web application for managing inventory and sales for a retail store.
Used React.js for front-end development
Implemented RESTful APIs using Node.js and Express for back-end
Utilized MongoDB for database management
Incorporated authentication and authorization features for secure access
Functionalities in software development refer to the specific tasks or actions that a software program can perform.
Functionalities are the specific features or capabilities of a software program.
They define what the software can do and how it can be used.
Examples of functionalities include user authentication, data encryption, and file management.
Functionalities can be implemented through code modules or libraries.
Test...
I applied via Recruitment Consulltant and was interviewed in Sep 2023. There were 3 interview rounds.
Sort an array and couple of stream api and project structure.
based on 1 review
Rating in categories
Executive Accountant
82
salaries
| ₹12 L/yr - ₹29 L/yr |
Software Engineer
55
salaries
| ₹13.8 L/yr - ₹28 L/yr |
Senior Software Engineer
40
salaries
| ₹20 L/yr - ₹40 L/yr |
Driver
24
salaries
| ₹1.4 L/yr - ₹5 L/yr |
CAR Driver
15
salaries
| ₹1.5 L/yr - ₹3.3 L/yr |
LambdaTest
Freshworks
Zoho
TCS