Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by BlackBuck Team. If you also belong to the team, you can get access from here

BlackBuck Verified Tick

Compare button icon Compare button icon Compare

Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards

zig zag pattern zig zag pattern

Filter interviews by

Clear (1)

BlackBuck Software Developer Interview Questions and Answers

Updated 27 Dec 2024

BlackBuck Software Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

The exam duration is one and a half hours.

Round 2 - Coding Test 

The total exam time is one and a half hours.

Round 3 - Group Discussion 

It encompasses all topics related to full stack development.

Round 4 - Technical 

(2 Questions)

  • Q1. Asks questions on SQL
  • Q2. Asks question in typical topics
Round 5 - HR 

(1 Question)

  • Q1. Where do you see yourself in two years?
  • Ans. 

    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

  • Answered by AI

Interview questions from similar companies

I applied via Recruitment Consultant and was interviewed in Jun 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Basic to intermediate questions on data structures and django.

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview process easy.
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(1 Question)

  • Q1. Tell me about you
  • Ans. 

    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

  • Answered by AI
Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Instahyre and was interviewed in Sep 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Voting Algo n/2 element

Interview Preparation Tips

Interview preparation tips for other job seekers - Horrible interviewers
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed before Oct 2023. There were 2 interview rounds.

Round 1 - One-on-one 

(2 Questions)

  • Q1. DSA ROUND - DP problem
  • Ans. 

    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).

  • Answered by AI
  • Q2. DSA ROUND - STRING PROBLEM
  • Ans. 

    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'

  • Answered by AI
Round 2 - One-on-one 

(2 Questions)

  • Q1. PROJECT RELATED QUESTIONS
  • Q2. DESIGN LRU CACHE
  • Ans. 

    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.

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Ecom Express Software Developer interview:
  • Dynamic programming
  • Priority queue
Interview preparation tips for other job seekers - Communicate yourself , whether you are able to think about the problem or not .

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Technical 

(2 Questions)

  • Q1. What is oops concepts
  • Ans. 

    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

  • Answered by AI
  • Q2. What is spring boot
  • Ans. 

    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...

  • Answered by AI

Skills evaluated in this interview

I applied via Recruitment Consultant and was interviewed in May 2020. There were 3 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. What is diameter of Binary Tree? Write full working code.
  • Ans. 

    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.

  • Answered by AI
  • Q2. Find interchanged terms from an AP, where terms are arranged in series
  • Ans. 

    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

  • Answered by AI
  • Q3. Explain database indexing
  • Ans. 

    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...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well on basic data structures, operating systems and database.

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. Two problems[Ds and algo] +Cv Project Explanation 1 hour interview[Single round only]
  • Q2. Anyone who does LeetCode medium level problems can solve them easily always do follow up of the problems cause that is the only thing they desire from your solution

I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Design a stack that support getmin in O(1) time and O(1) space complexities
  • Ans. 

    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...

  • Answered by AI
  • Q2. Questions related OS and DBMS
  • Q3. Binary tree traversal
  • Ans. 

    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...

  • Answered by AI
  • Q4. LRU cache explanation
  • Ans. 

    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 ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Good with your programming skills and fundamentals.

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Video Call 

(3 Questions)

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

  • Q1. 

    Rotting Oranges Problem Statement

    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...

  • Ans. 

    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

  • Answered by AI
  • Q2. 

    Smallest Integer Not Representable as Subset Sum

    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...

  • Ans. 

    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.

  • Answered by AI
  • Q3. 

    BFS Traversal in a Graph

    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 ...

  • Ans. 

    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.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 100 minutes
Round difficulty - Easy

Mostly technical and System Design questions were asked.

  • Q1. Design an LRU (Least Recently Used) cache.
  • Ans. 

    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.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Guru Gobind Singh Indraprastha University. I applied for the job as SDE - 1 in GurgaonEligibility criteria1+ year of ExperienceDelhivery interview preparation:Topics to prepare for the interview - DS, Algorithms, OOPS, Dynamic Programming, System Design, Java SpringTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

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

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

BlackBuck Interview FAQs

How many rounds are there in BlackBuck Software Developer interview?
BlackBuck interview process usually has 5 rounds. The most common rounds in the BlackBuck interview process are Aptitude Test, Coding Test and Group Discussion.
What are the top questions asked in BlackBuck Software Developer interview?

Some of the top questions asked at the BlackBuck Software Developer interview -

  1. asks question in typical top...read more
  2. asks questions on ...read more

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

INTERVIEWS

Volvo IT

No Interviews

INTERVIEWS

Shardul Amarchand Mangaldas

No Interviews

INTERVIEWS

Zetwerk

No Interviews

INTERVIEWS

RPP Infra Projects

No Interviews

SALARIES

Newgen Software Technologies

SALARIES

Lakshmikumaran & Sridharan

INTERVIEWS

Zepto

No Interviews

SALARIES

Lakshmikumaran & Sridharan

Tell us how to improve this page.

BlackBuck Software Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
BlackBuck Software Developer Salary
based on 25 salaries
₹11 L/yr - ₹27 L/yr
114% more than the average Software Developer Salary in India
View more details

BlackBuck Software Developer Reviews and Ratings

based on 5 reviews

3.3/5

Rating in categories

4.1

Skill development

2.4

Work-life balance

3.2

Salary

3.3

Job security

3.0

Company culture

2.7

Promotions

2.9

Work satisfaction

Explore 5 Reviews and Ratings
Territory Sales Manager
298 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Area Sales Manager
204 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Team Lead
193 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Area Sales Officer
178 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Associate
121 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare BlackBuck with

Delhivery

3.9
Compare

Ecom Express

3.8
Compare

Shadowfax Technologies

3.6
Compare

XpressBees

3.6
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent