Filter interviews by
I applied via Other and was interviewed in Jun 2018. There were 5 interview rounds.
Move all zeros to the end of the array while maintaining the relative order of the non-zero elements.
Iterate through the array and keep track of the index to place the next non-zero element.
When encountering a non-zero element, swap it with the element at the current index.
After iterating through the array, all zeros will be moved to the end while maintaining the order of non-zero elements.
Level order traversal of a binary search tree (BST) is a breadth-first search algorithm that visits each level of the tree from left to right.
Use a queue to keep track of the nodes to be visited
Start with the root node and enqueue it
While the queue is not empty, dequeue a node and visit it
Enqueue the left and right child of the visited node if they exist
Repeat until all nodes have been visited
Determining the state of switches/junctions after N trains have passed through them.
Create an array to represent the state of each switch/junction
Iterate through each train and update the state of the corresponding switch/junction
Use a loop to simulate the passing of trains and updating of switches/junctions
Return the final state of the switches/junctions
Merge subsets of strings with a twist
Merge subsets of strings into a single array
The twist is that each subset should be reversed before merging
Return the merged array of reversed subsets
Count the number of islands in a grid, where an island is a group of connected 1s.
Use depth-first search (DFS) or breadth-first search (BFS) to traverse the grid
For each cell with a 1, mark it as visited and explore its neighboring cells
Count the number of times you start a new DFS or BFS traversal
Top trending discussions
I applied via Approached by Company and was interviewed before Jun 2021. There were 2 interview rounds.
Frameworks provide structure and pre-built components for software development, but can also limit flexibility and require learning curve.
Advantage: Provides structure and pre-built components for faster development
Advantage: Can improve code quality and maintainability
Disadvantage: Can limit flexibility and customization
Disadvantage: Requires learning curve and potential dependency issues
Example: ReactJS provides a fr...
Oops stands for Object-Oriented Programming. It is a programming paradigm that uses objects to represent real-world entities.
Advantages: code reusability, modularity, encapsulation, inheritance, polymorphism
Disadvantages: complexity, steep learning curve, performance overhead
Example: creating a class 'Car' with properties like 'make', 'model', and 'year', and methods like 'start_engine' and 'stop_engine'
I applied via Company Website and was interviewed before Oct 2019. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Mar 2020. There were 4 interview rounds.
Web service flow is the sequence of steps involved in the communication between a client and a server over the internet.
Web service flow involves a client sending a request to a server
The server processes the request and sends a response back to the client
The response can be in various formats such as XML, JSON, or plain text
Web service flow can be synchronous or asynchronous
Examples of web services include RESTful API...
To check ports in Solaris or Linux machine, use the netstat command.
Open the terminal and type 'netstat -an' to display all open ports.
Use 'netstat -an | grep
To check listening ports, use 'netstat -an | grep LISTEN'.
For Solaris, use 'netstat -an | grep .
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 50 minutes
Round difficulty - Easy
This was a Data Structural round.
Given a two-dimensional array/list consisting of integers 0s and 1s, where 1 represents land and 0 represents water, determine the number of distinct islands. A group of...
Count the number of distinct islands in a 2D array of 0s and 1s.
Identify islands by performing depth-first search (DFS) on the grid
Use a set to store the shape of each island and check for duplicates
Consider translations to determine distinct islands
Round duration - 50 minutes
Round difficulty - Easy
This was a Data Structural round.
You are tasked with arranging 'N' words of varying lengths such that each line contains at most 'M' characters, with each word separated by a space. The challenge is to minimiz...
The goal is to minimize the total cost of arranging 'N' words on each line with a maximum character limit 'M'.
Calculate the cost of each line as the cube of extra space characters needed to reach 'M'.
Minimize the total cost by arranging words to fit within the character limit on each line.
Ensure each word appears fully on one line without breaking across lines.
Round duration - 60 minutes
Round difficulty - Easy
This was a System Design round.
Design a system similar to Red Bus for handling bookings and onboarding vendors and customers.
Implement a user-friendly interface for customers to search and book tickets
Create a vendor portal for vendors to manage their offerings and availability
Include payment gateway integration for secure transactions
Develop a robust backend system for managing bookings, cancellations, and refunds
Utilize a database to store user in...
Round duration - 50 minutes
Round difficulty - Easy
This was a System Design round
Round duration - 50 minutes
Round difficulty - Easy
This was an HR round.
Tip 1 : Practice as much as you can.
Tip 2 : Prepare for company, not in general.
Tip 3 : Your past work should be objective and your contribution should be very clear
Tip 1 : Keep only relevant things for the job you are applying.
Tip 2 : Minimal data with measurable contribution and effect.
posted on 22 Aug 2021
I applied via Referral and was interviewed before Aug 2020. There were 5 interview rounds.
Interview questions for Software Developer related to Spring, Collections, Serialization, Exceptions, Unix, Annotations, Json, Build tools, Restful services, and more.
List and Set are both collection interfaces in Java. List allows duplicates and maintains insertion order while Set doesn't allow duplicates and doesn't maintain any order.
Sorted in Hashed Set means that the elements are stored in a sorted order based on ...
I applied via Naukri.com and was interviewed in Jul 2020. There was 1 interview round.
I applied via Monster and was interviewed before Apr 2020. There was 1 interview round.
Software Engineer
3k
salaries
| ₹32.5 L/yr - ₹65 L/yr |
Software Developer
2.1k
salaries
| ₹33 L/yr - ₹60.3 L/yr |
Senior Software Engineer
1.2k
salaries
| ₹38.6 L/yr - ₹72.2 L/yr |
Data Analyst
371
salaries
| ₹15.9 L/yr - ₹35 L/yr |
Sde1
367
salaries
| ₹31.3 L/yr - ₹58.4 L/yr |
Yahoo
Amazon
Microsoft Corporation