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 Client Service Trainee Interview Questions and Answers

Updated 24 Nov 2022

Bravura Solutions Client Service Trainee Interview Experiences

1 interview found

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Aptitude Test 

The questions very good and easy

Round 3 - Technical 

(2 Questions)

  • Q1. Asked various questions related to programming languages
  • Q2. Asked questions about myself

Interview Preparation Tips

Interview preparation tips for other job seekers - Don't hesitate go with full confidence. Also the interview process was very smooth

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 

1 Question

  • Q1. Mostly on C language especially strings.Implement strcmp,strcat,strrev and structures and unions.

Interview Preparation Tips

Interview preparation tips for other job seekers - Brush your knowledge on basics of C
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 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

Interview Questionnaire 

1 Question

  • Q1. Simple and General Linux related questions, Oracle installations, Linux commands etc

Interview Preparation Tips

Interview preparation tips for other job seekers - My interview for the deployment team to be responsible for deploying the security products to global customers

I applied via Campus Placement and was interviewed in Jan 2021. There were 3 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Telecom Architecture
  • Q2. OSS/BSS
  • Q3. Security

Interview Preparation Tips

Interview preparation tips for other job seekers - Read topics relating to telecom infrastructure

Interview Questionnaire 

2 Questions

  • Q1. Multithreading in C++, casting and OOPs concepts
  • Q2. Cover the basic concepts.
Round 1 - Technical 

(1 Question)

  • Q1. Angular Architecture, basic angular questions such as data binding, rxjs, dependency injection etc.
Round 2 - Technical 

(1 Question)

  • Q1. Coding assignment to fetch data from API and render on the UI. Using httpclient module.
  • Ans. 

    Fetch data from API and render on UI using httpclient module

    • Create an instance of httpclient module

    • Use httpclient to make a GET request to API endpoint

    • Parse the response data and render on UI

  • Answered by AI
Round 3 - Behavioral 

(1 Question)

  • Q1. Normal question on roles and responsibilities alongwith cultural fitment check.
Round 4 - Client Interview 

(1 Question)

  • Q1. Client interview to get the knowledge of UX and responsive web application. Css etc.

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and even if you don't know the answer properly at least tell them the approach and try your best to answer or complete the assignment given.

Skills evaluated in this interview

Bravura Solutions Interview FAQs

How many rounds are there in Bravura Solutions Client Service Trainee interview?
Bravura Solutions interview process usually has 3 rounds. The most common rounds in the Bravura Solutions interview process are Resume Shortlist, Aptitude Test and Technical.

Tell us how to improve this page.

Interview Questions from Similar Companies

Mobileum Interview Questions
3.3
 • 37 Interviews
SOTI Interview Questions
3.3
 • 23 Interviews
Backbase Interview Questions
3.7
 • 22 Interviews
FinThrive Interview Questions
3.7
 • 20 Interviews
Bentley Systems Interview Questions
4.3
 • 20 Interviews
3Pillar Global Interview Questions
3.3
 • 19 Interviews
Mentor Graphics Interview Questions
4.0
 • 18 Interviews
View all
Senior Software Engineer
80 salaries
unlock blur

₹8.5 L/yr - ₹18 L/yr

Senior Test Analyst
77 salaries
unlock blur

₹8 L/yr - ₹18.5 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