i
BlackBuck
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
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
Top trending discussions
I applied via Recruitment Consultant and was interviewed in Jun 2021. There was 1 interview round.
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 Instahyre and was interviewed in Sep 2024. There was 1 interview round.
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 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...
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 was interviewed 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
based on 5 reviews
Rating in categories
Territory Sales Manager
298
salaries
| ₹0 L/yr - ₹0 L/yr |
Area Sales Manager
204
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
193
salaries
| ₹0 L/yr - ₹0 L/yr |
Area Sales Officer
178
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
121
salaries
| ₹0 L/yr - ₹0 L/yr |
Delhivery
Ecom Express
Shadowfax Technologies
XpressBees