Filter interviews by
Clear (1)
I applied via Company Website and was interviewed in Jun 2024. There was 1 interview round.
Implement your own state management in React and integrate it into a React application.
Create APIs for a Quiz platform
Design RESTful APIs for creating, updating, deleting, and retrieving quizzes
Include endpoints for managing quiz questions, answers, and user responses
Implement authentication and authorization mechanisms for secure access
Utilize JSON format for data exchange between client and server
I applied via Approached by Company and was interviewed before Jan 2023. There were 3 interview rounds.
Design and code a parking lot application
To ensure no data corruption during asynchronous streaming and processing, use data validation, error handling, and checksums.
Implement data validation techniques to check the integrity of the streamed data.
Handle errors and exceptions properly to prevent data corruption.
Use checksums or hash functions to verify the integrity of the data.
Implement reliable communication protocols like TCP/IP to ensure data integrity.
Co...
Top trending discussions
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
Function to check if a string of parenthesis is balanced
Use a stack to keep track of opening parenthesis
If a closing parenthesis is encountered, pop from stack and check if it matches
If stack is empty and a closing parenthesis is encountered, return False
If all parenthesis are matched and stack is empty, return True
Count the occurrences of words in a paragraph.
Split the paragraph into words using whitespace as a delimiter.
Create a dictionary to store the count of each word.
Iterate through the words and increment the count in the dictionary.
Return the dictionary with the word counts.
Find common elements out of two sorted array
Use two pointers to traverse both arrays simultaneously
Compare elements at each pointer and move the pointer of the smaller element
If elements are equal, add to common elements list and move both pointers
Stop when either pointer reaches end of array
Convert a Binary Search Tree to a Doubly Linked List.
Create a DLL node class with left, right, and data fields.
Traverse the BST in-order and add each node to the DLL.
Adjust the left and right pointers of each node to create the DLL.
Return the head of the DLL.
The task is to fill the 'next' field of each node in a binary tree to point to the next node at the same level.
Use a level order traversal to process the tree nodes.
Maintain a queue to store the nodes at each level.
For each node, set its 'next' field to the next node in the queue.
If a node is the last node at its level, set its 'next' field to NULL.
To find anagrams of a given word in a dictionary, use a hash table to store sorted versions of each word as keys and their corresponding original words as values.
Create a hash table to store the anagrams
Iterate through each word in the dictionary
Sort the characters of the word and use it as a key in the hash table
If the key already exists, add the word to the list of values for that key
Print the list of values for the
Suggest a data structure for efficient search of a string in 10 files and print line number and file if string appears more than once.
Use a hash table to store the file name and line number of each occurrence of the string.
Iterate through each file and for each line, check if the string is present and update the hash table accordingly.
Print the hash table entries for the string.
Amazon is the right place for me because of its innovative culture, vast resources, and opportunities for growth.
Amazon's innovative culture aligns with my passion for pushing boundaries and finding creative solutions.
The company's vast resources provide the necessary tools and support to develop and deliver high-quality software.
Amazon offers numerous opportunities for growth and career advancement, allowing me to con...
I was interviewed in Oct 2016.
I applied via Campus Placement
Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.
The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.
For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.
For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.
For the ri...
Find the nearest greater value of a given value in a Binary Search Tree (BST).
Start from the root node and compare the given value with the current node's value.
If the given value is less than the current node's value, move to the left subtree.
If the given value is greater than the current node's value, move to the right subtree.
Keep track of the closest greater value encountered while traversing the tree.
Return the cl
Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.
We can start by jumping the maximum number of steps in each round until we reach the broken step.
After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.
We can continue this pattern until we reach the maximum height we can reach wit
based on 3 interviews
Interview experience
based on 11 reviews
Rating in categories
Business Development Executive
2.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
530
salaries
| ₹0 L/yr - ₹0 L/yr |
MIS Executive
480
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Executive
446
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Officer
336
salaries
| ₹0 L/yr - ₹0 L/yr |
Meesho
Flipkart
Amazon
Snapdeal