Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso UBS nel mese di ago 2024
Colloquio
We will have 2 technical and 1 HR round they are moderate to difficult level .In
Technical rounds they asked in DSA ,cs subjects like DBMS SQL computer network oops operating systems
Domande di colloquio [1]
Domanda 1
They asked about my intro and asked me to explain my project and part of the code
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso UBS (Hyderabad) nel mese di set 2025
Colloquio
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
Ho sostenuto un colloquio presso UBS (Zürich, Zürich)
Colloquio
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.
Domande di colloquio [1]
Domanda 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
