Faster and better experience!
Filter interviews by
I applied via Campus Placement
Cognitive, logical, and verbal reasoning, as well as numeric aptitude.
I am a recent graduate with a degree in Economics and a passion for data analysis. I have experience with statistical software and strong problem-solving skills.
Recent graduate with a degree in Economics
Passionate about data analysis
Experience with statistical software
Strong problem-solving skills
I am impressed by the company's innovative approach to data analysis and its reputation for fostering professional growth.
Innovative approach to data analysis
Reputation for fostering professional growth
I possess strong analytical skills, attention to detail, and a passion for data-driven decision making.
I have a degree in Statistics and experience with data analysis tools such as Excel and SQL.
I have completed internships where I conducted market research and created reports based on data analysis.
I am a quick learner and have a proven track record of delivering high-quality work under tight deadlines.
In five years, I see myself as a Senior Analyst leading a team of analysts and contributing to strategic decision-making within the company.
Advancing to a Senior Analyst role
Leading a team of analysts
Contributing to strategic decision-making
Continuing professional development through training and certifications
I applied via Company Website
It was medium ... Able to answer the question
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
Critical thinking, reasoning
2 basic coding questions
Blume Global interview questions for popular designations
I applied via Recruitment Consulltant and was interviewed before Jul 2023. There was 1 interview round.
JPA implementation for employee involves mapping Java objects to database tables using annotations.
Use @Entity annotation to mark Employee class as an entity
Use @Id annotation to specify the primary key of the entity
Use @Column annotation to map entity attributes to table columns
Use @GeneratedValue annotation to specify automatic generation of primary key values
I applied via Naukri.com and was interviewed before Jul 2023. There were 2 interview rounds.
1hr technical and coding test
I applied via Campus Placement and was interviewed before Apr 2022. There were 5 interview rounds.
Basic Aptitude test to evaluate knowledge on arithmetic and language skills
I applied via Campus Placement and was interviewed in Apr 2021. There were 4 interview rounds.
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.
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
I applied via Naukri.com and was interviewed before Aug 2020. There were 3 interview rounds.
Top trending discussions
I was interviewed in Jan 2021.
Round duration - 120 minutes
Round difficulty - Medium
Due to pandemic placement process went virtual. Test was conducted at 10 A.M.
Your task is to decode a given encoded string back to its original form.
An encoded string format is <count>[encoded_string], where the 'encoded_string...
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
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.
A...
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.
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.
An i...
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.
Round duration - 30 minutes
Round difficulty - Medium
Due to pandemic placement process went virtual. Test was conducted at 2 P.M.
Given a string 'STR' composed of lowercase English letters, identify the character that repeats first in terms of its initial occurrence.
STR =...
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 '%'.
Round duration - 45 minutes
Round difficulty - Medium
Video Call interview where the interview happened for around 45 minutes.
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...
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.
Round duration - 30 minutes
Round difficulty - Easy
Video Call interview where the interview happened for around 30 minutes.
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.
Tip 1 : Maintain atleast 2 different projects, write powerful summary statement.
Tip 2 : Maintain skills relevant to job description, include relevant experience.
based on 7 interviews
Interview experience
based on 39 reviews
Rating in categories
Associate Software Engineer
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Production Analyst
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Fourkites
Roambee
FarEye
LogiNext Solutions