Filter interviews by
I applied via Naukri.com and was interviewed in Apr 2024. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.
The group discussion was held among in 3 slots and out of 40 candidates and 18 got shortlisted for the next round. Everyone got 30 seconds to give there opinions about the topic. It was a very smooth and calm process. Company premises is also very good.
I applied via Walk-in and was interviewed before Mar 2023. There were 2 interview rounds.
The first round is aptitude round which consists 50 questions. Mainly of reasoning and cs fundamental.
In the coding round I got e question to solve in 30 min.
Top trending discussions
I applied via Walk-in and was interviewed before Mar 2021. There were 3 interview rounds.
Aptitude test
Current affairs
I applied via Campus Placement and was interviewed in Sep 2022. There were 3 interview rounds.
One hour aptitude test, after clearing that, some basic coding questions were unlocked.
This one was face to face. Basically, the approach to the question was seeked by the HRs rather than the correct answer only.
I expect a competitive salary based on my skills, experience, and the market rate for software developers.
Research the average salary range for software developers in your location and industry.
Consider your level of experience, education, and any specialized skills you possess.
Factor in the company's size, reputation, and financial stability.
Be prepared to negotiate and discuss benefits and perks in addition to salary...
I applied via LinkedIn and was interviewed in Sep 2021. There was 1 interview round.
Spring is a framework for building Java applications, while Spring Boot is a tool for quickly creating Spring-based applications.
Spring provides a comprehensive framework for building Java applications, while Spring Boot is a tool that simplifies and accelerates the process of creating Spring-based applications.
Spring requires more configuration and setup, while Spring Boot provides a pre-configured environment that re...
A program to check if two strings are anagrams of each other.
Create two character arrays from the input strings
Sort the arrays
Compare the sorted arrays to check if they are equal
Using Streams API to filter and map an array of strings
Create a stream from the array using Arrays.stream()
Use filter() to select elements that meet a certain condition
Use map() to transform each element into a new value
Use toArray() to convert the stream back into an array
REST API is a web service that uses HTTP requests to access and manipulate data.
REST stands for Representational State Transfer
It is an architectural style for building web services
It uses HTTP methods like GET, POST, PUT, DELETE to perform operations on resources
It is stateless and can be cached
It returns data in various formats like JSON, XML, etc.
I applied via LinkedIn and was interviewed in Nov 2023. There were 3 interview rounds.
Mcq + dsa JavaScript questions
Print unique numbers in list
Iterate through the list and store each number in a set to keep track of unique numbers
Print out the numbers in the set to display the unique numbers
posted on 31 May 2022
I appeared for an interview in Sep 2021.
Round duration - 150 Minutes
Round difficulty - Medium
3 coding question + 50 dsa
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Find the majority element in an array, return -1 if no majority element exists.
Iterate through the array and keep track of the count of each element using a hashmap.
Check if any element's count is greater than floor(N/2) to determine the majority element.
Return the majority element or -1 if no majority element exists.
You are provided with an arbitrary binary tree consisting of 'N' nodes where each node is associated with a certain value. The task is to determine the height of the tree.
Calculate the height of a binary tree given its level order traversal.
Traverse the binary tree level by level and keep track of the height as you go down the tree.
Use a queue data structure to perform level order traversal efficiently.
The height of a binary tree is the maximum number of edges from the root to any leaf node.
Handle NULL nodes represented by -1 in the input.
Return the height of the binary tree as a single
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and count the number of connected components.
Maintain a visited array to keep track of visited cells to avoid counting the same island multiple times.
Iterate through each cell in the matrix and if it is a land (1) and not visited, perform DFS/BFS to explore the connected land cells.
I...
Round duration - 60 Minutes
Round difficulty - Hard
2 coding questions
You are given 'N' pairs of integers where the first number is always smaller than the second number, i.e., in pair (a, b) -> a < b always. A pair chain is...
Find the length of the longest pair chain that can be formed using the given pairs.
Sort the pairs based on the second element in ascending order.
Iterate through the sorted pairs and keep track of the maximum chain length.
Update the chain length if the current pair can be added to the chain.
Return the maximum chain length at the end.
You are given an array prices
, representing stock prices over N consecutive days. Your goal is to compute the maximum profit achievable by performing multiple transactions (i...
Find maximum profit by buying and selling stocks multiple times.
Iterate through the array and find all increasing sequences of stock prices.
Calculate profit by buying at the start and selling at the end of each increasing sequence.
Sum up all profits to get the maximum profit achievable.
Round duration - 45 minutes
Round difficulty - Medium
Data structures,java script,web dev related questions,dbms questions
Designing a web crawler involves defining the scope, selecting a crawling strategy, implementing the crawler, handling data storage, and ensuring politeness.
Define the scope of the web crawler by determining the websites to crawl and the depth of the crawl.
Select a crawling strategy such as breadth-first or depth-first search based on the requirements.
Implement the web crawler using a programming language like Python o...
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 3 : practice basics of dsa
Tip 1 : show your projects
Tip 2 : highlight your skills
based on 3 interviews
Interview experience
based on 1 review
Rating in categories
Software Developer
104
salaries
| ₹2 L/yr - ₹9.4 L/yr |
Software Engineer
37
salaries
| ₹2.5 L/yr - ₹8.5 L/yr |
Senior Software Developer
31
salaries
| ₹6 L/yr - ₹12 L/yr |
Operations Executive
27
salaries
| ₹2 L/yr - ₹2.9 L/yr |
Software Tester
20
salaries
| ₹2.2 L/yr - ₹7 L/yr |
Maxgen Technologies
Value Point Systems
JoulestoWatts Business Solutions
F1 Info Solutions and Services