Unifi Capital Head Retail Sales Interview Questions and Answers

Q1. Business volume
Add your answer
Q2. DSA / connector list
Add your answer

Q1. Interview started with some basic questions like tell me about yourself, your current experience
Ans. I just explain about myself and current job like what is my work
Answered Anonymously
Add your answer

Q1. 2nd round was taken by process head where he asked questions in depth about the process
Add your answer
Q2. What is you current role ? What is demat account? What are documents required for demat account opening? What is your achievement? Why are changing the job ? Do you have experience in UAT ?
Ans. 
I am currently working as a Relationship Manager. I have experience in demat account opening and UAT.
• I am a Relationship Manager with experience in demat account opening and UAT.

• Demat account is an account that holds securities in electronic form.

• Documents required for demat account opening include PAN card, Aadhaar card, and a cancelled cheque.

• My achievement includes achieving 120% of the sales target in the last quar...read more
Answered by AI
View 1 more answer

Q1. Asking about team handling experience
Add your answer
Q2. Asking about mortgage loan experience
Add your answer

Assignment was given

Q1. Work location, skills, future plans
Add your answer

Q1. How will you achieve target?
Add your answer

Q1. How will you achieve your target?
Add your answer
Q2. What is your current role ?
Add your answer

Round duration - 70 Minutes
Round difficulty - Hard

The test link was active for a week, and you can give anytime you like. The IDE was very good and self explanatory. There were 2 coding questions and 15 aptitude questions.

Q1. 
Unweighted Graph Shortest Path Problem
You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has N houses numbered from 1 ...read more
Ans. 
Find the shortest path between two houses in a city represented as an unweighted graph.
• Use breadth-first search (BFS) algorithm to find the shortest path in an unweighted graph.

• Start BFS from the source house and keep track of the path taken to reach each house.

• Once the destination house is reached, backtrack from destination to source to find the shortest path.

• Consider using a queue data structure to implement BFS eff...read more
Answered by AI
Add your answer
Q2. 
Check If Two Nodes Are Cousins
You are given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, and two node values, a and b. Your task is to determine if ...read more
Ans. 
Check if two nodes in a binary tree are cousins by comparing their levels and parents.
• Traverse the tree to find the levels and parents of the given nodes.

• Compare the levels and parents of the two nodes to determine if they are cousins.

• If the levels are the same and the parents are different, the nodes are cousins.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It contained two programming questions.

Q1. 
Counting Nodes in a Complete Binary Tree - Problem Statement
Given the root of a complete binary tree, calculate the total number of nodes in this tree.
A complete binary tree is defined as a binary tree...read more
Ans. 
Count the total number of nodes in a complete binary tree given its root.
• Traverse the tree in level order and count the nodes

• Use a queue to keep track of nodes at each level

• Check for null nodes represented by -1 in the input

• The total number of nodes in the example tree is 7
Answered by AI
Add your answer
Q2. 
Rearrange Array Numbers for Largest Possible Number
Given an array ARR consisting of non-negative integers, rearrange the numbers to form the largest possible numerical value. You are not permitted to alt...read more
Ans. 
Rearrange array numbers to form the largest possible numerical value by combining digits of each number in the array.
• Convert integers in the array to strings for easier manipulation.

• Sort the array of strings in non-increasing order based on custom comparison function.

• Join the sorted strings to form the largest possible number.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This was more of a interaction round with some technical skills.

Q1. Can you explain the ACID properties and the rollback mechanism in DBMS?
Ans. 
ACID properties ensure database transactions are processed reliably. Rollback mechanism undoes changes if transaction fails.
• ACID properties: Atomicity, Consistency, Isolation, Durability

• Atomicity ensures all operations in a transaction are completed successfully or none at all

• Consistency ensures database remains in a valid state before and after transaction

• Isolation ensures transactions are independent and do not inter...read more
Answered by AI
Add your answer

Leetcode simple problems. But with coding

C++ basics and operating systems basic

Q1. C++ templates and advanced c++
Add your answer
Q2. Low level design
Add your answer