Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Blume Global Associate Software Engineer Interview Questions and Answers

Updated 31 Jul 2024

Blume Global Associate Software Engineer Interview Experiences

3 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
Less than 2 weeks
Result
-

I applied via Company Website

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident about what you say
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.

Associate Software Engineer Interview Questions Asked at Other Companies

asked in Accenture
Q1. Triplets with Given Sum Problem Given an array or list ARR consis ... read more
asked in Gainsight
Q2. Connecting Ropes with Minimum Cost You are given 'N' ropes, each ... read more
Q3. Intersection of Two Arrays II Given two integer arrays ARR1 and A ... read more
asked in Clarivate
Q4. Best Time to Buy and Sell Stock II Problem Statement Given the st ... read more
Q5. Ninja and Alternating Largest Problem Statement Ninja is given a ... read more

I applied via Campus Placement and was interviewed in Apr 2021. There were 4 interview rounds.

Interview Questionnaire 

5 Questions

  • Q1. 1) Tell me about yourself.
  • Q2. 2) Tell me about your project
  • Q3. 3) How was your journey in cdac and which subject you like the most ?
  • Q4. Why classifiers are used in machine learning ?
  • Ans. 

    Classifiers are used in machine learning to categorize data into different classes based on their features.

    • Classifiers help in predicting the class of new data based on the patterns learned from the training data.

    • They are used in various applications such as image recognition, spam filtering, sentiment analysis, etc.

    • Popular classifiers include decision trees, support vector machines, logistic regression, etc.

  • Answered by AI
  • Q5. How'll you optimize a query ?
  • Ans. 

    Optimizing a query involves identifying and resolving performance issues.

    • Identify slow queries using profiling tools

    • Use indexes to speed up data retrieval

    • Reduce the amount of data being queried

    • Avoid using SELECT *

    • Use JOINs instead of subqueries

    • Normalize database tables

    • Use caching to reduce database load

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be Natural and don't fake anything.
People here are very good and very supportive.
Trust me company do care about employees alot.

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview in Jan 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 120 minutes
Round difficulty - Medium

Due to pandemic placement process went virtual. Test was conducted at 10 A.M.

  • Q1. 

    Decode String Problem Statement

    Your task is to decode a given encoded string back to its original form.

    Explanation:

    An encoded string format is <count>[encoded_string], where the 'encoded_string...

  • Ans. 

    The task is to decode an encoded string back to its original form by repeating the encoded string 'count' times.

    • Parse the input string to extract the count and the encoded string within the brackets

    • Use recursion to decode the encoded string by repeating it 'count' times

    • Handle nested encoded strings by recursively decoding them

    • Output the decoded string for each test case

  • Answered by AI
  • Q2. 

    Detect and Remove Loop in Linked List

    For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.

    Expected Complexity:

    A...

  • Ans. 

    Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.

    • Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.

    • Once the loop is detected, use two pointers approach to find the start of the loop.

    • Adjust the pointers to remove the loop and return the modified linked list.

    • Example: For input 5 2 and 1 2 3 4 5, output should be 1 2 3 4 5.

  • Answered by AI
  • Q3. 

    Infix to Postfix Conversion

    You are provided with a string EXP which represents a valid infix expression. Your task is to convert this given infix expression into a postfix expression.

    Explanation:

    An i...

  • Ans. 

    Convert a given infix expression to postfix expression.

    • Use a stack to keep track of operators and operands.

    • Follow the rules of precedence for operators (*, / have higher precedence than +, -).

    • Handle parentheses by pushing them onto the stack and popping when closing parenthesis is encountered.

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 30 minutes
Round difficulty - Medium

Due to pandemic placement process went virtual. Test was conducted at 2 P.M.

  • Q1. 

    Find First Repeated Character in a String

    Given a string 'STR' composed of lowercase English letters, identify the character that repeats first in terms of its initial occurrence.

    Example:

    Input:
    STR =...
  • Ans. 

    The task is to find the first repeated character in a given string of lowercase English letters.

    • Iterate through the string and keep track of characters seen so far in a set.

    • If a character is already in the set, return it as the first repeated character.

    • If no repeated character is found, return '%'.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 45 minutes
Round difficulty - Medium

Video Call interview where the interview happened for around 45 minutes.

  • Q1. 

    Maximum Sum Path in a Binary Tree Problem Statement

    You are provided with a binary tree consisting of N nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...

  • Ans. 

    Find the maximum sum achievable by a simple path between any two nodes in a binary tree.

    • Traverse the binary tree to find all possible paths and calculate their sums.

    • Keep track of the maximum sum encountered during traversal.

    • Consider paths that may include the same node twice.

    • Implement a recursive function to explore all paths in the tree.

    • Optimize the solution to avoid redundant calculations.

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Video Call interview where the interview happened for around 30 minutes.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from B V Raju Institute of Technology. I applied for the job as Associate Software Engineer in HyderabadEligibility criteriaAbove 8 CGPADelhivery interview preparation:Topics to prepare for the interview - Java, Operating Systems, Git, LInux, Networking, C++, Python, DataStructures and Algorithms, OOPS, Dynamic ProgrammingTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Practise 5 problems daily from websites like hackerrank, codechef, codeforces
Tip 2 : Participate in codechef, codeforces contest.
Tip 3 : Attend mock interviews and should have good communication skills.

Application resume tips for other job seekers

Tip 1 : Maintain atleast 2 different projects, write powerful summary statement.
Tip 2 : Maintain skills relevant to job description, include relevant experience.

Final outcome of the interviewRejected

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. What is DHCP,DNS,etc
  • Ans. 

    DHCP is a protocol that assigns IP addresses to devices on a network. DNS is a system that translates domain names to IP addresses.

    • DHCP assigns IP addresses to devices on a network

    • DNS translates domain names to IP addresses

    • DHCP reduces the need for manual IP address configuration

    • DNS allows users to access websites using domain names instead of IP addresses

  • Answered by AI
  • Q2. Dynamics host configuration Protocol Domain Name System

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. There was so many questions asked to me in interview, i had gone through four different rounds of interview.
  • Q2. I was well prepared for the interview. I didn't know that there will be four rounds. I have faced them confidently with accurate answers within a time. They had impressed on my confidence and my verbal com...

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

Interview Preparation Tips

Round: Test
Experience: PAPER DURATION: 3 hours
NO. OF QUESTIONS: 2 (20 marks each)
MAXIMUM MARKS: 20*2 = 40 marksQUESTION 1:
JSON Prettier:-Write a program which takes JSON as input and gives prettified JSONYou need to read JSON from STDIN. Input gives one line of uglified JSON.Output should be formatted JSON. Check the standard output link.Use 2 white spaces (not‘\t’) for one indentation.SAMPLE INPUT:{“group” : {list : [1,2,3]}, “list” : [“a”,”b”,”c”]}SAMPLE OUTPUT:{“group” : {List : [1,2,3]},“list” : [“a”,”b”,”c”]}EXPLANATION: Input will be uglifiedjson in one line and output will be prettified format of that. QUESTION 2:XML parse plus series computationEvaluate an expression given in XML format. Keys will be Expr- contains the entire expression. Elem – contains the digit, sum, Prod- contains two or more keys whose evaluation needs to be summed or multiplied respectively. Sub will contain 2 keys or more, where the second key onwards will have to be subtracted from the first one. Div- will contain 2 keys in which first key will need to be divided by second. SAMPLE INPUT:4673 SAMPLE OUTPUT:
20EXPLANATION:Input will be xml file through standard input. End of xml file marked by .
Duration: 180 minutes
Total Questions: 2

College Name: NA

Interview Preparation Tips

Interview preparation tips for other job seekers - Just be confident and tell whatever you had Learnt
Contribute & help others!
anonymous
You can choose to be anonymous

Blume Global Interview FAQs

How many rounds are there in Blume Global Associate Software Engineer interview?
Blume Global interview process usually has 2-3 rounds. The most common rounds in the Blume Global interview process are Aptitude Test, Coding Test and Technical.
How to prepare for Blume Global Associate Software Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Blume Global. The most common topics and skills that interviewers at Blume Global expect are Java.
What are the top questions asked in Blume Global Associate Software Engineer interview?

Some of the top questions asked at the Blume Global Associate Software Engineer interview -

  1. Why classifiers are used in machine learnin...read more
  2. How'll you optimize a quer...read more
  3. Domain question and project questi...read more

Recently Viewed

INTERVIEWS

Fresenius Kabi

No Interviews

INTERVIEWS

L&T Finance

No Interviews

INTERVIEWS

Great Learning

No Interviews

INTERVIEWS

Nagravision

No Interviews

INTERVIEWS

Nagravision

No Interviews

INTERVIEWS

Shriram Finance

No Interviews

JOBS

Amazon

No Jobs

SALARIES

L&T Finance

SALARIES

Fastenal

INTERVIEWS

T P F Software

No Interviews

Tell us how to improve this page.

Blume Global Associate Software Engineer Interview Process

based on 4 interviews

Interview experience

3.8
  
Good
View more

Interview Questions from Similar Companies

Delhivery Interview Questions
3.9
 • 458 Interviews
Ecom Express Interview Questions
3.8
 • 198 Interviews
BlackBuck Interview Questions
3.8
 • 176 Interviews
BrowserStack Interview Questions
3.6
 • 48 Interviews
Winman Software Interview Questions
4.0
 • 28 Interviews
View all
Blume Global Associate Software Engineer Salary
based on 31 salaries
₹5 L/yr - ₹15.8 L/yr
65% more than the average Associate Software Engineer Salary in India
View more details

Blume Global Associate Software Engineer Reviews and Ratings

based on 3 reviews

3.0/5

Rating in categories

1.0

Skill development

2.2

Work-life balance

1.0

Salary

1.0

Job security

1.0

Company culture

2.2

Promotions

1.0

Work satisfaction

Explore 3 Reviews and Ratings
Associate Software Engineer
31 salaries
unlock blur

₹5.1 L/yr - ₹15.8 L/yr

Senior Software Engineer
31 salaries
unlock blur

₹13.2 L/yr - ₹26 L/yr

Software Engineer
24 salaries
unlock blur

₹5.8 L/yr - ₹15 L/yr

Production Analyst
15 salaries
unlock blur

₹13 L/yr - ₹16 L/yr

Technical Lead
14 salaries
unlock blur

₹20 L/yr - ₹36 L/yr

Explore more salaries
Compare Blume Global with

Fourkites

3.8
Compare

Roambee

2.9
Compare

FarEye

3.1
Compare

LogiNext Solutions

1.8
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