Filter interviews by
Clear (1)
I applied via Company Website and was interviewed in May 2023. There were 3 interview rounds.
Very Easy questions just do it
SDE 1 is an entry-level position where candidates gain foundational skills before advancing to SDE 2.
SDE 1 focuses on learning and building foundational skills in software development.
SDE 2 requires more experience and expertise in software development.
Advancing from SDE 1 to SDE 2 is a common career progression in tech companies.
SDE 1 roles often involve working on smaller projects or components of larger projects.
SDE...
No, I believe in standing up against bullying and supporting those who are being bullied.
I do not support bullying in any form and believe in treating others with respect and kindness.
I would try to intervene and help the person being bullied, either by talking to the bully or seeking help from a teacher or supervisor.
I believe in creating a positive and inclusive environment where everyone feels safe and respected.
Rate your
company
🤫 100% anonymous
How was your last interview experience?
Top trending discussions
I was interviewed in Aug 2017.
N queen problem is to place N queens on an NxN chessboard without any two queens threatening each other.
The problem can be solved using backtracking algorithm
Start with placing a queen in the first row and move to the next row
If no safe position is found, backtrack to the previous row and try a different position
Repeat until all queens are placed or no safe position is found
Code can be written in any programming langua...
Check if there exists any sub array with given sum in the array with O(1K) space complexity.
Use two pointers to traverse the array and maintain a current sum.
If the current sum is greater than the given sum, move the left pointer.
If the current sum is less than the given sum, move the right pointer.
If the current sum is equal to the given sum, return true.
NP hardness refers to the difficulty of solving a problem in non-deterministic polynomial time.
NP-hard problems are some of the most difficult problems in computer science.
They cannot be solved in polynomial time by any known algorithm.
Examples include the traveling salesman problem and the knapsack problem.
References and pointers are both used to access memory locations, but references cannot be null and cannot be reassigned.
Pointers can be null and can be reassigned to point to different memory locations.
References are automatically dereferenced, while pointers need to be explicitly dereferenced.
Pointers can perform arithmetic operations, while references cannot.
Example: int x = 5; int *ptr = &x; int &ref = x;
Example: i
A reference variable is a variable that holds the memory address of an object, while an actual reference is the object itself.
A reference variable is declared with a specific type and can only refer to objects of that type.
An actual reference is the object itself, which can be accessed and manipulated using the reference variable.
Changing the value of a reference variable does not affect the original object, but changi...
When we type an URL, the browser sends a request to the server hosting the website and retrieves the corresponding webpage.
The browser parses the URL to extract the protocol, domain, and path.
It resolves the domain name to an IP address using DNS.
The browser establishes a TCP connection with the server.
It sends an HTTP request to the server.
The server processes the request and sends back an HTTP response.
The browser re
Implementation of LRU cache using a doubly linked list and a hash map.
LRU (Least Recently Used) cache is a data structure that stores a fixed number of items and evicts the least recently used item when the cache is full.
To implement LRU cache, we can use a doubly linked list to maintain the order of items based on their usage frequency.
We can also use a hash map to store the key-value pairs for quick access and retrie...
Indexing in DBMS is a technique to improve query performance by creating a data structure that allows faster data retrieval.
Indexing is used to speed up data retrieval operations in a database.
It involves creating a separate data structure that maps the values of a specific column to their corresponding records.
This data structure is called an index.
Indexes are typically created on columns that are frequently used in s...
B trees and B+ trees are data structures used for efficient storage and retrieval of data in databases.
B trees are balanced trees with a variable number of child nodes per parent node. They are commonly used in databases to store large amounts of data.
B+ trees are a variant of B trees where all data is stored in the leaf nodes, and the internal nodes only contain keys. They are commonly used in databases for indexing.
B...
AVL trees are self-balancing binary search trees. They maintain a balance factor to ensure height balance.
AVL trees are named after their inventors, Adelson-Velsky and Landis.
They are height-balanced, meaning the difference in height between left and right subtrees is at most 1.
Insertion and deletion operations may cause imbalance, which is corrected by rotations.
AVL trees have a worst-case time complexity of O(log n) ...
Given a list of process IDs and their corresponding parent process IDs, print the IDs of all processes that are children of a specific process ID, and recursively kill all their children.
Iterate through the list of process IDs and parent process IDs
Check if the current process ID is the one to be killed
If yes, recursively find and print all its children
If a child has further children, recursively kill them as well
I applied via Company Website and was interviewed before Aug 2021. There were 2 interview rounds.
Easy level questions
I applied via Referral and was interviewed before Jan 2024. There were 3 interview rounds.
1 HR of coding round, 2 problems asked. One on stack, one on DP.
Machine coding round where LLD implementation of a cab booking system was asked.
I applied via Naukri.com and was interviewed in May 2021. There was 1 interview round.
Example of React parent and child components with props
Create a parent component with state and pass it as props to child component
Access the props in child component using 'props' keyword
Update the parent state from child component using a callback function passed as prop
Example: Parent component -
Example: Child component -
Closure is a function that has access to its outer function's variables, even after the outer function has returned.
Closure is created when a function returns another function.
The inner function has access to the outer function's variables.
Closure is used to create private variables and methods.
Example: function outer() { let x = 10; return function inner() { console.log(x); } }
Example: let closureFunc = outer(); closu
Currying is a technique of transforming a function that takes multiple arguments into a sequence of functions that each take a single argument.
Currying is achieved by returning a function that takes the next argument until all arguments are received.
In JavaScript, currying is often used for partial application of functions.
The sum function in the example takes one argument and returns a function that takes the next arg...
I applied via Referral and was interviewed before Jul 2023. There were 3 interview rounds.
Design splitwise. Low Level question. More like Machine Coding
Question on Strings and DP
I applied via Referral and was interviewed in Jul 2024. There was 1 interview round.
Hackerrank - 3 questions 2 hrs
I applied via Referral and was interviewed before Feb 2022. There were 2 interview rounds.
I applied via Campus Placement
3 questions 1 is easy and 2 medium problems
Check if a linked list is palindrome
Traverse the linked list and push each element onto a stack
Traverse the linked list again and compare each element with the top of the stack
If all elements match, the linked list is a palindrome
The diameter of a binary tree is the longest path between any two leaf nodes.
Calculate the height of left and right subtrees recursively
Find the diameter of left and right subtrees
Compare the diameter of left and right subtrees and return the maximum
I applied via Campus Placement and was interviewed before Jul 2022. There were 5 interview rounds.
3 questions were asked. 1 easy 1 medium 1 hard
One on one coding round. Basic easy to medium coding questions were asked
based on 1 interview
Interview experience
Driver
584
salaries
| ₹0 L/yr - ₹0 L/yr |
CAR Driver
361
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
157
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Executive
136
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
134
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Ola Cabs
Airbnb