Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed before Dec 2023. There were 2 interview rounds.
Top trending discussions
I applied via Indeed and was interviewed in Oct 2023. There was 1 interview round.
A callback function is a function passed as an argument to another function, which is then invoked inside the outer function.
Callback functions are commonly used in asynchronous programming.
They allow a function to call another function when a certain task is completed.
Callback functions can be anonymous or named functions.
Examples of callback functions include event handlers and AJAX requests.
I applied via Approached by Company and was interviewed in Apr 2022. There were 4 interview rounds.
The current project follows a microservices architecture.
The project is divided into multiple small services that communicate with each other through APIs.
Each service is responsible for a specific functionality.
The services are deployed independently and can be scaled as per the demand.
The project uses Docker containers for easy deployment and management.
The communication between services is secured using HTTPS protoc...
I was interviewed in Jan 2021.
Round duration - 95 minutes
Round difficulty - Medium
The 1st round was online coding + MCQ round. It had 3 sections in total to be solved in 95 mins.
Next comes the technical interview.
The technical interview lasted for about 45 minutes. It started with a basic introduction. Then, she framed some questions from my resume and projects which I have mentioned. Questions were mainly from Data structure, OS, DBMS, SQL. She told me to rate my data structure skill on a scale of 1 to 5.
My interview was at 10:30 am and the interviewer was really nice. She was helping me wherever I was getting stuck.
Given an array consisting of integers, your task is to determine the fourth largest element in the array. If the array does not contain at least four distinct elements,...
Find the fourth largest element in an array, return -2147483648 if not enough distinct elements.
Sort the array in descending order
Return the fourth element if it exists, else return -2147483648
Round duration - 45 minutes
Round difficulty - Medium
The technical interview lasted for about 45 minutes. It started with a basic introduction. Then, she framed some questions from my resume and projects which I have mentioned. Questions were mainly from Data structure, OS, DBMS, SQL. She told me to rate my data structure skill on a scale of 1 to 5.
You are provided with an integer array/list ARR
of size 'N' which consists solely of 0s, 1s, and 2s. Your task is to write a solution to sort this array/list.
Sort an array of 0s, 1s, and 2s in linear time with a single scan approach.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array once and swap elements based on their values and the pointers.
After the single scan, the array will be sorted in place with 0s, 1s, and 2s in order.
You are given an array of integers. The task is to remove all duplicate elements and return the array while maintaining the order in which the elements were provided.
Remove duplicates from an array while maintaining order.
Use a set to keep track of unique elements.
Iterate through the array and add elements to the set if not already present.
Convert the set back to an array to maintain order.
SQL joins are used to combine rows from two or more tables based on a related column between them.
Inner Join: Returns rows when there is at least one match in both tables.
Left Join: Returns all rows from the left table and the matched rows from the right table.
Right Join: Returns all rows from the right table and the matched rows from the left table.
Full Outer Join: Returns rows when there is a match in one of the tabl...
Determine if a node with a given integer value X exists in a specified binary tree.
The first line of each test case contains the binary tree nodes in level orde...
Check if a node with a given value exists in a binary tree.
Traverse the binary tree using depth-first search (DFS) or breadth-first search (BFS) to search for the node with the given value.
Use a recursive or iterative approach to implement the search algorithm.
Return 'true' if the node with the given value is found, otherwise return 'false'.
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...
Find the shortest path in an unweighted graph from house 'S' to house 'T'.
Use Breadth First Search (BFS) algorithm to find the shortest path in an unweighted graph.
Create a queue to store the current house and its neighbors, and a visited set to keep track of visited houses.
Start BFS from house 'S' and stop when reaching house 'T'.
Return the path from 'S' to 'T' once 'T' is reached.
If multiple shortest paths exist, ret
Tip 1 : Read interview experience before interview
Tip 2 : Think loud about each coding question.
Tip 1 : No spelling mistake in resume.
Tip 2 : Resume should be in proper format
I applied via Naukri.com and was interviewed in May 2024. There was 1 interview round.
Decorator in Python is a design pattern that allows adding new functionality to an existing object without modifying its structure.
Decorators are functions that take another function as an argument and extend its behavior without explicitly modifying it.
They are commonly used to add logging, timing, caching, or authentication to functions.
Syntax for using decorators in Python involves using the @ symbol followed by the...
yield is a keyword in Python used in generator functions to return a value without terminating the function
yield is used in generator functions to produce a series of values over time
When a generator function is called, it returns an iterator object but does not start execution immediately
Each time the yield statement is reached, the function's state is saved, and the value is returned to the caller
Execution of the fun...
I applied via Naukri.com and was interviewed before Nov 2023. There was 1 interview round.
I applied via Approached by Company and was interviewed before Mar 2021. There was 1 interview round.
Yes, I have used multithreading in software development.
Multithreading is the ability of a central processing unit (CPU) to execute multiple threads concurrently.
It allows for parallel execution of tasks, improving performance and responsiveness in applications.
Multithreading can be used to perform tasks in the background while the main thread handles user interactions.
Examples of multithreading in software development...
based on 1 interview
Interview experience
Senior Specialist
44
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Analyst
41
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Scientist
18
salaries
| ₹0 L/yr - ₹0 L/yr |
DHL Express
FedEx Express
Ups Logistics
Maersk