Upload Button Icon Add office photos
Engaged Employer

i

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

Bravura Solutions Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Bravura Solutions Graduate Engineer Trainee (Get) Interview Questions and Answers

Updated 12 Mar 2023

Bravura Solutions Graduate Engineer Trainee (Get) Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Feb 2023. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Double-check your resume for any spelling mistakes. The recruiter may consider spelling mistakes as careless behavior or poor communication skills.
View all tips
Round 2 - Aptitude Test 

3 sections
Quant
Verbal
Tachnical

Round 3 - One-on-one 

(1 Question)

  • Q1. Technical interview questions from core java and sql queries
Round 4 - Technical 

(1 Question)

  • Q1. Singly,doubly link list Joins type and project
  • Ans. 

    The question is not clear and seems to be unrelated to the job role of Graduate Engineer Trainee.

    • The question seems to be a mix of different topics and lacks clarity.

    • Singly and doubly linked lists are data structures used in computer science.

    • Joins are used in database management systems to combine data from multiple tables.

    • Project could refer to a software development project or a construction project.

    • It is unclear how...

  • Answered by AI
Round 5 - HR 

(1 Question)

  • Q1. Simple backgroud question. Family background

Interview Preparation Tips

Interview preparation tips for other job seekers - Just get core java and mysql and get good clearity on project

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Design patterns, Collections
  • Q2. Spring Boot, Annotations, controller class, hibernate

Interview Questionnaire 

9 Questions

  • Q1. Questions related to the work done at my previous company
  • Q2. Find if a given directed graph is cyclic or not
  • Ans. 

    To check if a directed graph is cyclic or not

    • Use Depth First Search (DFS) algorithm to traverse the graph

    • Maintain a visited set to keep track of visited nodes

    • Maintain a recursion stack to keep track of nodes in the current DFS traversal

    • If a node is visited and is already in the recursion stack, then the graph is cyclic

    • If DFS traversal completes without finding a cycle, then the graph is acyclic

  • Answered by AI
  • Q3. You have a stream of bytes from which you can read one byte at a time. You only have enough space to store one byte. After processing those bytes, you have to return a random byte. Note: The probability of...
  • Ans. 

    Return a random byte from a stream of bytes with equal probability.

    • Create a variable to store the count of bytes read

    • Create a variable to store the current random byte

    • For each byte read, generate a random number between 0 and the count of bytes read

    • If the random number is 0, store the current byte as the random byte

    • Return the random byte

  • Answered by AI
  • Q4. Find if a given Binary Tree is BST or not
  • Ans. 

    Check if a binary tree is a binary search tree or not.

    • Traverse the tree in-order and check if the values are in ascending order.

    • For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.

    • Use recursion to check if all nodes in the tree satisfy the above condition.

  • Answered by AI
  • Q5. Devise an algorithm to determine the Nth-to-Last element in a singly linked list of unknown length. If N = 0, then your algorithm must return the last element. You should parse the list only once
  • Ans. 

    Algorithm to find Nth-to-Last element in a singly linked list of unknown length

    • Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning

    • Move both pointers simultaneously until the second pointer reaches the end of the list

    • The first pointer will be pointing to the Nth-to-Last element

    • If N=0, return the last element

    • Parse the list only once

  • Answered by AI
  • Q6. Given an array of integers, print all possible permutations. Also explain your approach
  • Ans. 

    Print all possible permutations of an array of integers

    • Use recursion to swap elements and generate permutations

    • Start with the first element and swap it with each subsequent element

    • Repeat the process for the remaining elements

    • Stop when all elements have been swapped with the first element

    • Print each permutation as it is generated

  • Answered by AI
  • Q7. Design a Stack DS that also prints in O(1) the minimum element you pushed in the stack
  • Ans. 

    Design a stack that prints the minimum element pushed in O(1)

    • Use two stacks, one for storing elements and another for storing minimums

    • When pushing an element, compare it with the top of minimum stack and push the smaller one

    • When popping an element, pop from both stacks

    • To get the minimum element, just return the top of minimum stack

  • Answered by AI
  • Q8. Given a linked list with loop, how would you find the starting point of the loop ?
  • Ans. 

    To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.

    • Use two pointers, one moving at twice the speed of the other.

    • When they meet, move one pointer to the head of the list and keep the other at the meeting point.

    • Move both pointers one step at a time until they meet again, which is the starting point of the loop.

  • Answered by AI
  • Q9. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-decreasingly. What will be the complexity of the solution
  • Ans. 

    To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.

    • Use binary search to find the number in each row and column

    • Start from the top-right corner or bottom-left corner to optimize search

    • Time complexity: O(m log n) or O(n log m) depending on the starting corner

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: Na

Skills evaluated in this interview

I appeared for an interview in Jun 2017.

Interview Questionnaire 

2 Questions

  • Q1. What is HTML, PHP and CSS
  • Ans. 

    HTML, PHP, and CSS are programming languages used for creating and designing websites.

    • HTML (Hypertext Markup Language) is used for creating the structure and content of web pages.

    • PHP (Hypertext Preprocessor) is a server-side scripting language used for creating dynamic web pages.

    • CSS (Cascading Style Sheets) is used for styling and formatting the layout of web pages.

    • Example: HTML is used to create headings, paragraphs, ...

  • Answered by AI
  • Q2. In my technical test, they asked me to replicate the privacy pages of Twitter and facebook.

Interview Preparation Tips

Round: Resume Shortlist
Experience: I was referred to by a friend so this step was comparatively easier.
Tips: Resume should be straightforward and extra and incomplete information should be avoided.

Round: Technical + HR Interview
Experience: A formal face to face interview was conducted. They tested my past knowledge about concepts related to the functioning of their company. It was a smooth interview.
Tips: Be confident, and if you are not thorough with a particular topic, be straightforward and tell the interviewer. Honesty is the best policy to crack an interview.

Round: Client interview
Experience: In this round, a conference call was held between the client in US and me. I was expected to put my exisiting knowledge in to practice to solve the problem at hand.
Tips: Be clear and concise and communicate appropriately. At this stage, a proficiency in English language and a good command over it is a must. Even if you are nervous and sweating, don't EVER show it.

Skills: Technical Analysis, Communication

Skills evaluated in this interview

I appeared for an interview before Jan 2021.

Interview Questionnaire 

4 Questions

  • Q1. Call routing
  • Q2. Be ready with 2G to 4G call routing studied
  • Q3. Revenue assurance and fraud management
  • Q4. Other basic telecom background questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Don't worry, people are friendly here.
You'll do good

I applied via Recruitment Consultant and was interviewed in Dec 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. First round was coding round : 1. One string rotaion of other 2. Nearest largest and smallest prime value of given input. interview questions:What is difference between reference variable and pointer ?

Interview Preparation Tips

Interview preparation tips for other job seekers - Study on cpp , python basic if specified , data structure , oop.
Round 1 - Aptitude Test 

Grammer and general understanding

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident. Show a learning attitude. Be polite and positive
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Aug 2022. There were 3 interview rounds.

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 tips
Round 2 - Group Discussion 

It was more about soft skills based on your work experience

Round 3 - Group Activity 

(1 Question)

  • Q1. Team interview - job responsibilites and work exp

Interview Preparation Tips

Interview preparation tips for other job seekers - be confident. interview is simple based on your resume
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

It included question from aptitude, reasoning, English, CSE fundamentals like oops and sql

Round 2 - Technical 

(1 Question)

  • Q1. It included everything which was mentioned in your resume
Round 3 - Technical 

(1 Question)

  • Q1. Same as round 2, it has few managerial questions as well
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
6-8 weeks
Result
Selected Selected

I applied via CoCubes and was interviewed before Dec 2021. There were 5 interview rounds.

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 tips
Round 2 - Coding Test 

There were some basic aptitude questions and OOP questions as MCQs. At the end there was a simple conding question.

Round 3 - Technical 

(2 Questions)

  • Q1. What is pre/post increment/decrement operator?
  • Ans. 

    Pre/post increment/decrement operators are used to increase/decrease the value of a variable by 1.

    • Pre-increment operator (++x) increases the value of x by 1 before using it in an expression.

    • Post-increment operator (x++) increases the value of x by 1 after using it in an expression.

    • Pre-decrement operator (--x) decreases the value of x by 1 before using it in an expression.

    • Post-decrement operator (x--) decreases the valu...

  • Answered by AI
  • Q2. Projects worked on Internships
  • Ans. 

    I have worked on various projects and internships during my time as a software engineer.

    • Developed a web application for a retail company to manage inventory and sales.

    • Collaborated with a team to create a mobile app for a healthcare startup to track patient vitals.

    • Implemented a machine learning algorithm for a research project in the field of natural language processing.

    • Optimized database queries and improved performanc...

  • Answered by AI
Round 4 - Technical 

(3 Questions)

  • Q1. Program to find middle of a linked list
  • Ans. 

    Program to find middle of a linked list

    • Traverse the linked list using two pointers, one moving twice as fast as the other

    • When the faster pointer reaches the end, the slower pointer will be at the middle

    • Handle even and odd length linked lists separately

  • Answered by AI
  • Q2. Discussion on projects and internships
  • Q3. Other simple DSA questions
Round 5 - Technical 

(3 Questions)

  • Q1. What data structures would you use to save images?
  • Ans. 

    I would use a binary format like JPEG or PNG to save images.

    • JPEG and PNG are common binary formats used to save images.

    • These formats use compression to reduce file size without losing quality.

    • Other options include BMP, GIF, and TIFF, but they may not be as efficient.

    • Images can also be saved as arrays of pixels or as vectors, depending on the type of image.

    • The choice of data structure depends on the specific use case an

  • Answered by AI
  • Q2. Write a function to swap. What exceptions it may throw?
  • Ans. 

    Function to swap two variables and possible exceptions

    • Function should take two variables as input

    • Use a temporary variable to swap the values

    • Possible exceptions include null pointer exception or out of bounds exception

  • Answered by AI
  • Q3. System design of a carrom board game
  • Ans. 

    Designing a carrom board game system

    • Define game rules and mechanics

    • Create game board and pieces

    • Implement player turns and scoring system

    • Include AI for single player mode

    • Consider multiplayer options and networking

    • Test and debug thoroughly

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Bentley Systems Associate Software Engineer interview:
  • C
  • C++
  • Javascript
  • React.Js
  • C#
Interview preparation tips for other job seekers - Keep your fundamentals strong. Do some projects. Have good communication.

Skills evaluated in this interview

Bravura Solutions Interview FAQs

How many rounds are there in Bravura Solutions Graduate Engineer Trainee (Get) interview?
Bravura Solutions interview process usually has 5 rounds. The most common rounds in the Bravura Solutions interview process are Resume Shortlist, Aptitude Test and One-on-one Round.
What are the top questions asked in Bravura Solutions Graduate Engineer Trainee (Get) interview?

Some of the top questions asked at the Bravura Solutions Graduate Engineer Trainee (Get) interview -

  1. Singly,doubly link list Joins type and proj...read more
  2. Technical interview questions from core java and sql quer...read more

Tell us how to improve this page.

Bravura Solutions Graduate Engineer Trainee (Get) Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Mobileum Interview Questions
3.3
 • 38 Interviews
SOTI Interview Questions
3.2
 • 23 Interviews
Backbase Interview Questions
3.7
 • 22 Interviews
FinThrive Interview Questions
3.7
 • 21 Interviews
Bentley Systems Interview Questions
4.3
 • 21 Interviews
3Pillar Global Interview Questions
3.3
 • 20 Interviews
Mentor Graphics Interview Questions
4.0
 • 18 Interviews
View all
Bravura Solutions Graduate Engineer Trainee (Get) Salary
based on 4 salaries
₹4.5 L/yr - ₹6.5 L/yr
37% more than the average Graduate Engineer Trainee (Get) Salary in India
View more details
Senior Test Analyst
77 salaries
unlock blur

₹8 L/yr - ₹18.5 L/yr

Senior Software Engineer
75 salaries
unlock blur

₹8 L/yr - ₹18 L/yr

Test Analyst
49 salaries
unlock blur

₹6 L/yr - ₹13.5 L/yr

Software Engineer
41 salaries
unlock blur

₹5.4 L/yr - ₹14 L/yr

Developer
36 salaries
unlock blur

₹6 L/yr - ₹15 L/yr

Explore more salaries
Compare Bravura Solutions with

Duck Creek Technologies

4.4
Compare

FinThrive

3.7
Compare

Mobileum

3.3
Compare

AgreeYa Solutions

3.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview