Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Mar 2024. There were 2 interview rounds.
Top trending discussions
I applied via Approached by Company and was interviewed in Aug 2017. There were 5 interview rounds.
I applied via Naukri.com and was interviewed before May 2020. There were 5 interview rounds.
I applied via Naukri.com and was interviewed before Jun 2019. There were 3 interview rounds.
Implement stack data structure
Use an array or linked list to store elements
Push operation adds element to top of stack
Pop operation removes element from top of stack
Peek operation returns top element without removing it
Global variables are accessible from any part of the program and can be modified by any function.
Global variables are declared outside of any function.
They can be accessed and modified by any function in the program.
If a function modifies the value of a global variable, the new value is visible to all other functions.
Global variables can be useful for sharing data between functions.
However, overuse of global variables
Program to transpose a matrix
Iterate through rows and columns of the matrix
Swap the elements at (i,j) and (j,i) positions
Return the transposed matrix
Pre and post fix operators are used to increment or decrement a value before or after it is used in an expression.
Pre-fix operator (++x) increments the value of x and returns the new value.
Post-fix operator (x++) returns the value of x and then increments it.
Both operators can be used with variables of numeric data types.
They can also be used with pointers to increment or decrement the memory address they point to.
I applied via Company Website and was interviewed in Jun 2024. There were 2 interview rounds.
Tomarrow, power system
Machine power system drive
Gaming aptitude gaming questions easy but iq is very imp
posted on 11 Oct 2024
I applied via LinkedIn and was interviewed before Oct 2023. There was 1 interview round.
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
They asked to find the elements which are present more than once. I solved it using map in c++
My favorite algorithm is Dijkstra's algorithm for finding the shortest path in a graph.
Dijkstra's algorithm is a greedy algorithm that finds the shortest path between nodes in a graph.
It works by maintaining a priority queue of nodes to visit next, updating the shortest distance to each node as it explores the graph.
The algorithm is commonly used in routing and network optimization.
Example: Finding the shortest route b
Deadlocks occur when two or more processes are unable to proceed because each is waiting for the other to release a resource.
Resource deadlocks: Processes hold resources and wait for others to release resources. Example: Process A holds resource X and waits for resource Y, while Process B holds resource Y and waits for resource X.
Communication deadlocks: Processes wait for messages from each other indefinitely. Example...
Developed a web application for online shopping with user authentication and payment gateway integration.
Implemented user authentication using JWT tokens
Integrated Stripe API for payment processing
Designed responsive UI using React and Bootstrap
I applied via Campus Placement and was interviewed in Aug 2023. There were 3 interview rounds.
One easy and one medium level question
Split a linked list into even and odd without changing order.
Create two new linked lists for even and odd numbers.
Iterate through the original linked list and append nodes to respective even or odd lists.
Finally, merge the even and odd lists to get the desired result.
based on 1 interview
Interview experience
Territory Manager
194
salaries
| ₹0 L/yr - ₹0 L/yr |
Territory Sales Manager
89
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
82
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
58
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Sales Executive
45
salaries
| ₹0 L/yr - ₹0 L/yr |
Schneider Electric
Siemens
ABB
Havells