i
BIZONGO
Filter interviews by
Clear (1)
I applied via Approached by Company and was interviewed before Nov 2022. There were 4 interview rounds.
Top trending discussions
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 Walk-in and was interviewed before Jan 2021. There were 4 interview rounds.
I applied via Recruitment Consultant and was interviewed in Jun 2021. There was 1 interview round.
The exam duration is one and a half hours.
The total exam time is one and a half hours.
It encompasses all topics related to full stack development.
In two years, I see myself as a senior software developer leading a team on innovative projects.
Advancing to a senior software developer role
Leading a team on new and innovative projects
Continuing to enhance my technical skills through ongoing learning and training
I am a passionate software developer with a strong background in programming languages such as Java, Python, and JavaScript.
Experienced in developing web applications using frameworks like Spring Boot and React
Proficient in database management with SQL and NoSQL databases
Skilled in problem-solving and debugging code efficiently
I applied via Approached by Company and was interviewed before Oct 2023. There were 2 interview rounds.
Dynamic Programming problem involving finding the maximum sum of non-adjacent elements in an array.
Use dynamic programming to keep track of the maximum sum at each index.
At each index, the maximum sum is either the current element plus the sum two indices back, or the sum at the previous index.
Example: For array [2, 4, 6, 2, 5], the maximum sum of non-adjacent elements is 13 (2 + 6 + 5).
Find the longest common prefix among an array of strings.
Iterate through the characters of the first string and compare with other strings
Return the prefix when characters don't match or reach end of any string
Example: Input - ['flower', 'flow', 'flight'], Output - 'fl'
LRU cache is a data structure that stores the most recently used items.
Use a doubly linked list to keep track of the order of items based on their usage.
Use a hashmap to quickly access items in the cache.
When a new item is accessed, move it to the front of the linked list.
If the cache is full, remove the least recently used item from the end of the linked list.
OOPs concepts are the fundamental principles of object-oriented programming.
Encapsulation - binding data and functions together in a single unit
Inheritance - creating new classes from existing ones
Polymorphism - ability of objects to take on many forms
Abstraction - hiding implementation details from the user
Examples: class, object, inheritance, encapsulation, polymorphism, abstraction
Spring Boot is a framework for building standalone, production-grade Spring-based applications.
Spring Boot simplifies the process of creating and deploying Spring-based applications.
It provides a set of pre-configured dependencies and an embedded web server.
It also offers features like auto-configuration, which reduces the need for manual configuration.
Spring Boot is widely used for building microservices and RESTful A...
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.
I applied via Recruitment Consultant and was interviewed in May 2020. There were 3 interview rounds.
Diameter of a binary tree is the longest path between any two leaf nodes.
Calculate the height of left and right subtrees recursively.
Calculate the diameter recursively using the formula max(left_height + right_height + 1, max(left_diameter, right_diameter)).
Return the maximum diameter.
To find interchanged terms from an AP series
Identify the common difference between terms
Swap the positions of adjacent terms
Check if the new series is also an AP
Repeat until no more interchanged terms can be found
Database indexing is a technique to improve the performance of database queries.
Indexing creates a data structure that allows for faster retrieval of data.
Indexes are created on one or more columns of a table.
Queries that use indexed columns can be executed faster.
Indexes can be clustered or non-clustered.
Clustered indexes determine the physical order of data in a table.
Non-clustered indexes create a separate structure...
based on 1 interview
Interview experience
Assistant Manager
51
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Manager
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Specialist
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Consultant
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Udaan
Delhivery
Shadowfax Technologies
BlackBuck