Game-Based Assessment (the 12 Pymetrics games)
~25-30 minutes total
What it tests. Risk tolerance, memory, attention, emotional recognition, processing speed and learning agility.
Common traps. Trying to act like an "ideal banker" creates an unnatural, inconsistent trait profile.
How to handle it. In the Balloon game cash out consistently at 4-6 pumps; in the Tower game pause 5-10 seconds to plan; in the Money Exchange game err toward fairness and collaboration.
Numerical Reasoning (SHL / aptitude tracks)
~75-90 seconds per question
What it tests. Data interpretation, ratio analysis, percentage change and isolating relevant variables from noise.
Common traps. Distractor variables and unit/currency mismatches forcing an unseen conversion step.
How to handle it. Read the prompt first, locate only the metrics you need, and keep a clean scratchpad.
Verbal Reasoning (SHL / aptitude tracks)
Strict per-question
What it tests. Deductive logic, comprehension and suppressing outside assumptions.
Common traps. The real-world-knowledge trap and stretching "some/often" into "all/always".
How to handle it. Treat the passage as the only universe of facts; if it is not supported, the answer is Cannot Say.
Logical / Inductive Reasoning (SHL)
Strict
What it tests. Abstract reasoning, pattern recognition and rule induction.
Common traps. Fixating on one variable while missing a simultaneous rule (e.g., rotation plus a count increment).
How to handle it. Scan a checklist each step: shape, shading, orientation, element count, position.
Situational Judgment Test (SJT)
What it tests. Professional judgment, escalation awareness and prioritization.
Common traps. The "hero" fallacy (solving a major error alone) and the passive bystander.
How to handle it. Filter every option through the firm principles: protect client data, escalate compliance risk, communicate transparently.
HackerRank (Software Engineering Program)
60 minutes
What it tests. Algorithmic logic, Big-O efficiency and edge-case validation.
Common traps. A brute-force O(n^2) solution that passes visible cases but times out on hidden ones.
How to handle it. Write optimal, modular code and pass every hidden edge case (empty inputs, negatives, overflow).