Envié una solicitud electrónica. El proceso duró 6 semanas. Acudí a una entrevista en UBS (Weehawken, NJ) en mar 2017
Entrevista
I applied to the program and got a call from a male recruiter in the Connecticut office one week after I applied to do a basic phone screen to start the process. A day after the phone screen, I was invited to an on site superday which was scheduled for the following Friday. 3 30 min interviews with members of the team and a 45 min group exercise. I receive reject via phone call three weeks after the superday.
Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 1 semana. Acudí a una entrevista en UBS (Hyderabad) en sept 2025
Entrevista
It was smooth and wonderful, the best interview I had so far. It typically consists of four rounds. The first is technical assessment followed by TR1, TR2 and the HR round
Zuerst normale Fragen wie "Was sind deine besten Kurse im Studium?" oder "Was sind deine Stärken" und danach mehr technische Fragen zu Investments, Bilanzen und Banking allgemein. Insgesamt war mein Eindruck sehr positiv.
The process began with a Pre-Placement Talk, followed by an online assessment on HackerRank, consisting of 30 MCQs (15 technical and 15 aptitude) and one coding question. I solved the coding problem completely and most MCQs, which helped me get shortlisted among 209 students. The technical interview lasted about 45 minutes and covered my resume projects (SQL-based and ML), Java OOPs concepts, and basic DSA questions. Despite missing one SQL query and not knowing the singleton class, I tackled most questions confidently. The HR round was relaxed, focusing on personal background and interests.
Preguntas de entrevista [1]
Pregunta 1
There is a ring with each node labeled from 1 to m. Starting from node 1. We were also given an
array of nodes to travel of size n and a time time array which tells the required time to go to any
adj node of size m. We can travel clockwise as well as anti-clockwise. We need to find the
minimum time required to visit all nodes.
Eg.
N = 4
NextNodeToVisit = [2, 3, 1, 3]
M = 3
TimeToMove = [1, 4, 2]
Initially we are standing at 1
