i
UBS
Filter interviews by
I appeared for an interview in Jul 2021.
Round duration - 120 minutes
Round difficulty - Easy
2 coding questions and 10 MCQ based on find output of code and some aptitude.
Given a string (STR
) of length N
, you are tasked to create a new string through the following method:
Select the smallest character from the first K
characters of STR
, remov...
Given a string and an integer, create a new string by selecting the smallest character from the first K characters of the input string and repeating the process until the input string is empty.
Iterate through the input string, selecting the smallest character from the first K characters each time.
Remove the selected character from the input string and append it to the new string.
Continue this process until the input st...
Given an array of non-negative integers representing the digits of a number and an integer 'K', calculate the maximum possible number by swapping its digits up to 'K...
Given an array of digits and an integer K, find the maximum number by swapping digits up to K times.
Sort the digits in non-increasing order to maximize the number.
Swap the digits to achieve the maximum number within the given number of swaps.
Handle cases where there are repeating digits and leading zeros.
Round duration - 45 minutes
Round difficulty - Easy
C++ questions, one coding question, some python question
Given 'K' different arrays that are individually sorted in ascending order, merge all these arrays into a single array that is also sorted in ascending order.
Merge K sorted arrays into a single sorted array.
Create a min heap to store the first element of each array along with the array index.
Pop the top element from the heap, add it to the result array, and push the next element from the same array back to the heap.
Continue this process until all elements are processed.
Time complexity can be optimized using a priority queue or merge sort technique.
Round duration - 45 minutes
Round difficulty - Easy
C++ related questions, coding questions, past internship experience,some python questions
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while iterating through the array.
Swap elements based on the values encountered to sort the array in-place.
Ensure to handle edge cases like all 0s, all 1s, and all 2s in the array.
Given an unsorted array of integers, modify the array such that all the zeroes are moved to the end, while maintaining the order of non-zero elements as they appear or...
Move all zeroes to the end of an unsorted array while maintaining the order of non-zero elements.
Iterate through the array and keep track of the index to place non-zero elements.
Once all non-zero elements are placed, fill the rest of the array with zeroes.
Ensure to maintain the relative order of non-zero elements.
Example: Input: [0, 1, -2, 3, 4, 0, 5, -27, 9, 0], Output: [1, -2, 3, 4, 5, -27, 9, 0, 0, 0]
Round duration - 60 minutes
Round difficulty - Medium
Data Structure questions, trees questions.
Given an array PREORDER
representing the preorder traversal of a Binary Search Tree (BST) with N
nodes, construct the original BST.
Each element in the given...
Given a preorder traversal of a BST, construct the BST and return its inorder traversal.
Create a binary search tree from the preorder traversal array
Return the inorder traversal of the constructed BST
Ensure each element in the array is distinct
Given a binary search tree (BST) and a key value K
, your task is to delete the node with value K
. It is guaranteed that a node with value K
exists in the BST.
A bi...
Delete a node with a given value from a binary search tree (BST).
Traverse the BST to find the node with the value K to be deleted.
Handle different cases like node with no children, one child, or two children.
Update the pointers of the parent node and child nodes accordingly.
Recursively delete the node and adjust the tree structure.
Return the root of the modified BST after deletion.
Tip 1 : Have good knowledge of C++
Tip 2 : Practice easy, medium questions from leetcode mostly arrays, stack, trees.
Tip 3 : Have some knowledge of Python
Tip 1 : Have some achievements like coding contest ratings, etc
Tip 2 : Have 1 or 2 good projects on Web Development or Machine Learning or any internship experience is even better.
posted on 4 Dec 2016
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Yes, I have coded in curriculum. The most complex one was a project on building a web application using React and Node.js.
Built a full-stack web application using React and Node.js
Implemented user authentication and authorization using JSON Web Tokens (JWT)
Used MongoDB as the database and Mongoose as the ODM
Implemented real-time updates using Socket.IO
Deployed the application on Heroku
Handled errors and implemented log
Big data refers to large and complex data sets that cannot be processed using traditional data processing methods.
Big data is characterized by its volume, velocity, and variety
It is used in various industries such as healthcare, finance, and retail
Examples of big data include social media data, sensor data, and transactional data
It is called 'big' because it involves processing massive amounts of data
Big data requires ...
I am passionate about technology and eager to learn new skills in the IT sector.
I have always had a keen interest in technology and enjoy working with computers.
I believe the IT sector offers more opportunities for growth and advancement in my career.
I have seen the impact of technology on various industries and want to be a part of that innovation.
I have taken courses in programming and networking to prepare myself fo
To find the product of all data points using SelectSum(), log(), and exp() functions.
Use the log() function to convert the product into a sum of logarithms
Apply the SelectSum() function to calculate the sum of logarithms
Finally, use the exp() function to convert the sum back into the product
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
I am a highly motivated individual with a passion for learning and achieving my goals.
I have a degree in computer science and have worked as a software developer for 3 years.
I am proficient in multiple programming languages including Java, Python, and C++.
I enjoy working in a team environment and collaborating with others to solve complex problems.
In my free time, I enjoy hiking and exploring new places.
I grew up in a small town with my parents and younger sister. We were a close-knit family.
Grew up in a small town
Close-knit family
Parents and younger sister
Participated in community events
Enjoyed outdoor activities
I enjoy reading, hiking, and trying new recipes in my free time.
Reading books on various topics, including fiction, non-fiction, and self-improvement
Hiking in local parks and nature reserves to explore new trails and enjoy the outdoors
Experimenting with new recipes and cooking techniques in the kitchen
Attending cultural events such as concerts, plays, and art exhibits
Spending time with family and friends, playing board
I would expect a supportive work environment, opportunities for growth and development, and a commitment to excellence.
Supportive and collaborative team culture
Clear communication and feedback
Opportunities for professional development and advancement
Commitment to high-quality work and customer satisfaction
Competitive compensation and benefits package
Yes, I have a cousin who lives in Bangalore.
I have a cousin who has been living in Bangalore for the past 5 years.
We keep in touch and he has shown me around the city during my visits.
He works in the IT industry and enjoys the vibrant culture of Bangalore.
Loop in a circular linked list can be found using Floyd's cycle-finding algorithm.
Initialize two pointers, slow and fast, both pointing to the head of the linked list.
Move slow pointer by one node and fast pointer by two nodes in each iteration.
If there is a loop, both pointers will eventually meet at some point.
If there is no loop, fast pointer will reach the end of the linked list.
Time complexity of this algorithm is
Pre-fix and post-fix operations can be performed on a string expression using appropriate operators.
Pre-fix operation involves placing the operator before the operand in the expression.
Post-fix operation involves placing the operator after the operand in the expression.
Examples of pre-fix operators include ++, --, !, and ~.
Examples of post-fix operators include ++ and --.
Data analytics is the process of examining data sets to draw conclusions about the information they contain.
Data analytics involves collecting, cleaning, and analyzing data to identify patterns and trends.
It can help businesses make informed decisions by providing insights into customer behavior, market trends, and operational efficiency.
For example, a retail company can use data analytics to analyze sales data and ide...
Strengths include adaptability and teamwork. Weaknesses include public speaking. Non-core background allows for diverse perspective. JPMorgan Chase's reputation and opportunities attract me.
Strengths: adaptability, teamwork
Weakness: public speaking
Non-core background brings diverse perspective
Attracted to JPMorgan Chase's reputation and opportunities
I would pursue my entrepreneurial dream and start my own company.
I would conduct market research to validate my idea and identify potential competitors.
I would create a business plan outlining my goals, strategies, and financial projections.
I would secure funding through investors or loans.
I would assemble a team of talented individuals with diverse skills and experiences.
I would continuously evaluate and adapt my busi
I would listen to both sides, gather more information, and try to find a compromise that satisfies everyone.
Listen to both sides and understand their perspectives
Gather more information about both ideas
Try to find common ground and a compromise that satisfies everyone
Encourage open communication and respect for each other's ideas
Consider the potential impact and benefits of each idea
Involve a neutral third party if nec
I applied via Campus Placement and was interviewed in Dec 2016. There were 3 interview rounds.
Company is a global technology company known for its innovative products and services.
Founded in 1976 by Steve Jobs, Steve Wozniak, and Ronald Wayne.
Known for products such as iPhone, iPad, Mac computers, and Apple Watch.
Offers services like Apple Music, iCloud, and Apple Pay.
Has a strong focus on design and user experience.
I applied via Campus Placement
ATM transaction involves multiple background processes including authentication, authorization, and communication with bank servers.
Customer inserts card and enters PIN
ATM authenticates the card and PIN
ATM requests authorization from bank server
Bank server verifies account balance and approves or denies transaction
ATM dispenses cash or completes other requested transaction
ATM updates account balance and sends transacti
Cut cake into 8 pieces using knife 3 times only.
First, cut the cake horizontally into two equal halves.
Then, cut the cake vertically into four equal pieces.
Finally, cut the cake horizontally again into eight equal pieces.
Make sure to use the knife efficiently to minimize the number of cuts.
Practice visualization before making the cuts to avoid mistakes.
The one bird was already dead.
The bird was already dead before the shot was fired.
The bird was injured and unable to fly away with the rest of the birds.
The bird was a decoy bird used for hunting purposes.
The bird was a trained bird used for falconry.
Developed a web-based attendance management system and a mobile app for event management.
Created a database schema and implemented CRUD operations using PHP and MySQL.
Designed the user interface using HTML, CSS, and JavaScript.
Integrated Google Maps API for location tracking in the mobile app.
Implemented push notifications using Firebase Cloud Messaging.
Collaborated with a team of four to complete the projects within t
I applied via Campus Placement
I appeared for an interview in Dec 2016.
The algorithm reverses a given string.
Iterate through the string from the last character to the first character.
Append each character to a new string or an array in reverse order.
Return the reversed string or array.
As the CEO, I would select the candidate based on their qualifications and skills, regardless of their background or personal characteristics.
I would focus on the qualifications, skills, and experience of each candidate.
I would consider their ability to contribute to the company's goals and objectives.
I would ensure a fair and unbiased selection process.
I would prioritize diversity and inclusion in the workplace.
I woul...
I appeared for an interview before Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
There were 33 questions in total. The objective questions were simple.
Mary is an enthusiastic party-goer who struggles with remembering event dates. Help Mary by sorting a given list of event dates in an ascending order.
Sort a list of event dates in ascending order based on year, month, and day.
Sort the list of dates based on year, then month, and finally day.
Use a sorting algorithm to rearrange the dates in ascending order.
Ensure the constraints are met for each date in the list.
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Given an array and a target sum, find all pairs of elements that add up to the target sum.
Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the pairs based on the first element and then the second element.
Handle edge cases like duplicate elements and pairs with the same values.
Example...
Given an integer N
, your task is to recursively break it into three integer parts: N / 2
, N / 3
, and N / 4
. You need to compute the maximum sum possible by dividing the numbe...
Given an integer N, recursively break it into three parts and find the maximum sum possible.
Recursively divide N into N/2, N/3, and N/4 to find the maximum sum
Compare the sum obtained by dividing N with the sum of N itself
Return the maximum sum for each test case
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions based on DSA.
Given an array ARR
of size N
, containing each number between 1 and N-1
at least once, identify the single integer that appears twice.
The first line contains an integer...
Identify the duplicate integer in an array containing numbers between 1 and N-1.
Iterate through the array and keep track of the frequency of each element using a hashmap.
Return the element with a frequency greater than 1 as the duplicate integer.
Ensure the constraints are met and a duplicate number is guaranteed to be present.
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
Calculate the total sum of all root to leaf paths in a binary tree formed by concatenating node values.
Traverse the binary tree from root to leaf nodes, keeping track of the current path sum
Add the current node value to the path sum and multiply by 10 for each level
When reaching a leaf node, add the final path sum to the total sum
Return the total sum modulo (10^9 + 7)
You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.
A directed acyclic g...
Implement a function to perform topological sorting on a directed acyclic graph (DAG) and return any valid ordering.
Create a graph data structure to represent the DAG
Use depth-first search (DFS) to perform topological sorting
Maintain a visited array to keep track of visited nodes
Return the ordering of nodes after DFS traversal
Round duration - 60 minutes
Round difficulty - Easy
Technical interview round with questions based on DSA.
You are given a binary tree consisting of distinct integers and two nodes, X
and Y
. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other.
Consider edge cases like when X or Y is the root node.
Implement a recursive or iterative solution to find the LCA efficiently.
You are provided with a sorted array that has undergone 'K' rotations (the exact value of 'K' is unknown). A rotation involves shifting each element of the array to the right,...
Implement a function to find the minimum number in a rotated sorted array efficiently.
Use binary search to find the minimum element in the rotated array.
Compare the mid element with the start and end elements to determine which half of the array to search next.
Continue the binary search until the minimum element is found.
Given an array TREE
of 'N' unique integers, construct a maximum binary tree using the following rules:
TREE
.Construct a maximum binary tree from an array of unique integers following specific rules.
Find the maximum number in the array to set as the root of the tree.
Recursively construct the left subtree with elements before the maximum number.
Recursively construct the right subtree with elements after the maximum number.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Associate Director
3.4k
salaries
| ₹14.8 L/yr - ₹53.5 L/yr |
Assistant Vice President
2.3k
salaries
| ₹16 L/yr - ₹49 L/yr |
Authorized Officer
1.7k
salaries
| ₹9.7 L/yr - ₹29 L/yr |
Exempt NON Officer
1.5k
salaries
| ₹7.5 L/yr - ₹29.1 L/yr |
ENO
1.3k
salaries
| ₹6.9 L/yr - ₹25 L/yr |
Morgan Stanley
Goldman Sachs
JPMorgan Chase & Co.
Deutsche Bank