i
ConveGenius
Filter interviews by
I applied via Naukri.com and was interviewed in Jul 2024. There was 1 interview round.
I applied via Referral and was interviewed before Aug 2021. There was 1 interview round.
Answer on how to list in react and the input box
Use the map function to create a list in React
Use the state to store the input value
Use onChange event to update the state when the input value changes
Use onSubmit event to handle the form submission
I applied via Referral and was interviewed before Jan 2022. There were 4 interview rounds.
I appeared for an interview before Apr 2022.
Easy Lettcode questions multiple
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...
I applied via Approached by Company and was interviewed in Nov 2024. There was 1 interview round.
Longest substring without repetition
I applied via Recruitment Consulltant and was interviewed in Jul 2021. There were 4 interview rounds.
Add 2 linked lists and return final linked list
Create a new linked list to store the sum
Traverse both linked lists simultaneously and add the corresponding nodes
Handle carry over while adding nodes
If one linked list is longer than the other, add the remaining nodes to the sum list
Finding an element in a rotated sorted array.
Use binary search to find the pivot point where the array is rotated.
Determine which half of the array the target element is in.
Perform binary search on that half of the array to find the target element.
Handle edge cases such as when the target element is at the pivot point.
Given a matrix of characters and a word, find if the word exists in the matrix.
Traverse the matrix and check if the first letter of the word matches any cell.
If it does, check if the adjacent cells match the next letter of the word.
Repeat until the entire word is found or no match is found.
Algorithm to maximize profit by buying and selling stocks.
Iterate through the array of stock prices
Keep track of the minimum price seen so far
Calculate the profit if sold at current price
Update maximum profit seen so far
Return maximum profit
based on 1 interview
Interview experience
2-6 Yrs
₹ 25-35 LPA
Software Engineer
7
salaries
| ₹12 L/yr - ₹18 L/yr |
Program Manager
7
salaries
| ₹8 L/yr - ₹11.2 L/yr |
Data Analyst
7
salaries
| ₹5.5 L/yr - ₹9 L/yr |
Associate Product Manager
6
salaries
| ₹9 L/yr - ₹11.5 L/yr |
Manager
5
salaries
| ₹13.1 L/yr - ₹25 L/yr |
Udaan
Swiggy
CARS24
Oyo Rooms