Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 semana. Fui entrevistado pela UBS (Londres, Inglaterra) em out. de 2015
Entrevista
Online tests (logical and numerical SHL) followed by short 15 minute (competency based) phone interview and then an assessment centre. The assessment centre was very focused on competency and skills - personally I wasn't asked any technical questions - i.e. how to calculate a DCF and only a few commercial questions - i.e. what effect ECB QE might have on european bonds. The interviewers really put me at ease and I didn't feel they were trying to trip me up in their questioning. Was pleased to be asked questions on ethics. AC was a bit shorter than some others I attended - about a half day.
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 semana. Fui entrevistado pela UBS (Hyderābād) em set. de 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.
Perguntas de entrevista [1]
Pergunta 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
