i
Chingari
Filter interviews by
I was interviewed in Jan 2024.
I applied via Walk-in and was interviewed in Sep 2023. There were 3 interview rounds.
I applied via Company Website and was interviewed in Jan 2024. There was 1 interview round.
I applied via LinkedIn and was interviewed before Dec 2022. There were 4 interview rounds.
General JS Array method questions.
Chingari interview questions for popular designations
I applied via Approached by Company and was interviewed before Sep 2022. There were 4 interview rounds.
I applied via Approached by Company and was interviewed before Oct 2022. There were 4 interview rounds.
Design an API rate limiter to control the number of requests a user can make within a certain time frame.
Implement a token bucket algorithm to track and limit the number of requests per user.
Set a maximum limit of requests per user per time frame (e.g. 100 requests per hour).
Use a sliding window to track the requests and reset the limit after the time frame expires.
I applied via Campus Placement and was interviewed in Jun 2022. There were 5 interview rounds.
50 mcq were asked in 12 mins. Most of the candidates qualified this round.
3 coding questions of basic DSA were asked. Also few mcqs from Operating System, Networking and DBMS.
I applied via Naukri.com and was interviewed before Oct 2022. There were 4 interview rounds.
15 minutes test.
50 questions
easy questions
Management , Leadership , Character Type questions
2 coding questions
resume grilling
easy medium questions
I applied via Referral and was interviewed before Feb 2023. There were 2 interview rounds.
45 mins, Basic aptitude , comprehension and decision making questions
I applied via Company Website and was interviewed before Dec 2020. There were 3 interview rounds.
Reverse a given Linked List with O(1) and O(N) space complexity.
For O(1) space complexity, use three pointers to reverse the links in place.
For O(N) space complexity, use a stack to store the nodes and then pop them to create the reversed list.
Be careful with edge cases such as empty list or list with only one node.
Find the celebrity in a party of N people where only one person is known to everyone.
The celebrity doesn't know anyone in the party.
We can use a stack to keep track of potential celebrities.
If a person knows someone, they cannot be a celebrity.
If a person doesn't know someone, we can push them onto the stack.
After iterating through all people, we check if the stack has only one person and if that person is known to eve
Merge Sort and Quick Sort are sorting algorithms that use divide and conquer approach.
Merge Sort divides the array into two halves, sorts them recursively, and then merges them.
Quick Sort selects a pivot element, partitions the array around the pivot, and recursively sorts the sub-arrays.
Merge Sort has a worst-case time complexity of O(nlogn), while Quick Sort has an average case time complexity of O(nlogn).
Merge Sort ...
Compute amount of water trapped in an elevation map after raining
Iterate through the array and find the maximum height on the left and right of each bar
Calculate the amount of water that can be trapped on each bar using the difference between the minimum of the two maximum heights and the height of the bar
Add up the amount of water trapped on each bar to get the total amount of water trapped
Zigzag traversal of a binary tree is a way of traversing the tree in a zigzag pattern.
Use a stack to keep track of nodes to be visited.
For each level, alternate between adding nodes to the stack from left to right and right to left.
Pop nodes from the stack and add their children to the stack in the appropriate order.
Repeat until all nodes have been visited.
Sort a dictionary by key or value in ascending/descending order.
Use sorted() function with lambda function to sort by key or value.
For ascending order, use reverse=False and for descending order, use reverse=True.
Example: sorted_dict = sorted(dictionary.items(), key=lambda x: x[0], reverse=True)
The duration of Chingari interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 7 interviews
Interview experience
based on 46 reviews
Rating in categories
Associate Product Manager
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Content Moderator
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
ShareChat
Roposo
MOJ
MX Takatak