i
BIZONGO
Filter interviews by
Redesign user flow for a usecase
The design process involves research, ideation, prototyping, testing, and iteration to create user-centered solutions.
Research: Gather information about users, goals, and context.
Ideation: Generate ideas and concepts for potential solutions.
Prototyping: Create low-fidelity and high-fidelity prototypes to visualize the design.
Testing: Conduct usability testing to gather feedback and insights.
Iteration: Refine the design...
I applied via Walk-in and was interviewed before Jan 2021. There were 4 interview rounds.
posted on 23 Aug 2024
My name is John Smith.
Full name is John Smith
Common name in English-speaking countries
No middle name or initial
In my free time, I enjoy hiking, playing video games, and learning new programming languages.
Hiking in local trails and national parks
Playing video games like Overwatch and Minecraft
Learning new programming languages like Python and JavaScript
I applied via Recruitment Consulltant and was interviewed before Feb 2022. There were 3 interview rounds.
Find the longest palindromic substring in a given string.
Use dynamic programming to solve the problem efficiently.
Start with the base cases of single characters and two characters.
For longer substrings, check if the first and last characters match and if the substring between them is also a palindrome.
Keep track of the longest palindrome seen so far.
Time complexity: O(n^2), space complexity: O(n^2).
Developing a real-time data processing system for a high-traffic website.
Designing a scalable architecture to handle the high volume of incoming data.
Optimizing the data processing algorithms to minimize latency.
Ensuring data consistency and accuracy in a distributed system.
Implementing fault-tolerant mechanisms to handle system failures.
Testing and debugging the system under various load conditions.
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.
Patch is used to update a specific part of a resource, while put is used to replace the entire resource.
Patch is used for partial updates, while put is used for full updates.
Patch is idempotent, meaning multiple identical patch requests will have the same effect as a single request, while put is not necessarily idempotent.
Example: Using patch to update the title of a blog post without affecting other fields, while usin...
I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.
Design a stack that supports getmin in O(1) time and O(1) space complexities.
Use two stacks, one for storing the actual values and the other for storing the minimum values.
When pushing a new value, check if it is smaller than the current minimum value and push it to the minimum stack if it is.
When popping a value, check if it is the current minimum value and pop it from the minimum stack if it is.
To get the minimum val...
Binary tree traversal is the process of visiting each node in a binary tree exactly once in a specific order.
There are three main types of binary tree traversal: inorder, preorder, and postorder.
Inorder traversal visits the left subtree, then the root, then the right subtree.
Preorder traversal visits the root, then the left subtree, then the right subtree.
Postorder traversal visits the left subtree, then the right subt...
LRU cache is a data structure that stores the most recently used items and discards the least recently used items.
LRU stands for Least Recently Used
It has a fixed size and when the cache is full, the least recently used item is removed to make space for a new item
It uses a combination of a doubly linked list and a hash map to achieve O(1) time complexity for both insertion and deletion
Example: A web browser cache that ...
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
This was a Data Structures round. Both questions were answered in optimal time complexity with clean code. Every other question was answered to the best of my knowledge
You are given an undirected and disconnected graph G(V, E) with V vertices numbered from 0 to V-1 and E edges. Your task is to perform a BFS traversal starting from the 0...
Perform BFS traversal on an undirected and disconnected graph starting from vertex 0.
Implement BFS traversal algorithm starting from vertex 0
Use a queue to keep track of visited nodes and their neighbors
Print the traversal order in sorted order for each node's connected nodes
Given a non-decreasing sorted array ARR
of N
positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...
Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a non-decreasing sorted array of positive numbers.
Start with the smallest possible sum that can be represented, which is 1.
Iterate through the array and update the smallest sum that cannot be represented.
Return the final smallest sum that cannot be represented.
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal of an undirected and disconnected graph starting from vertex 0.
Implement BFS algorithm to traverse the graph starting from vertex 0.
Use a queue to keep track of visited nodes and their neighbors.
Ensure to visit all connected components of the graph.
Print the BFS traversal sequence for each test case in a separate line.
Handle cases where not all vertices are reachable from vertex 0.
Round duration - 100 minutes
Round difficulty - Easy
Mostly technical and System Design questions were asked.
Design an LRU cache to store least recently used items efficiently.
Use a combination of a doubly linked list and a hashmap to store and retrieve items in O(1) time complexity.
When an item is accessed, move it to the front of the linked list to mark it as the most recently used.
If the cache is full, remove the least recently used item from the end of the linked list and the hashmap.
Tip 1 : Practice At least 300 questions
Tip 2 : Build Resume according to Job Description
Tip 3 : Working with Big Data/Distributed Systems is a Plus
Tip 1 : Skills relevant to Job Description
Tip 2 : Do not put false things on a resume, in-depth of knowledge of everything there on the resume
based on 1 interview
Interview experience
Assistant Manager
51
salaries
| ₹5.5 L/yr - ₹20 L/yr |
Manager
23
salaries
| ₹12.2 L/yr - ₹23 L/yr |
Senior Manager
20
salaries
| ₹15 L/yr - ₹33 L/yr |
Specialist
16
salaries
| ₹6.5 L/yr - ₹22 L/yr |
Consultant
15
salaries
| ₹16 L/yr - ₹28 L/yr |
Udaan
Delhivery
Shadowfax Technologies
BlackBuck