You are given an N × M grid. Each cell contains some number of coins (0 ≤ coins ≤ 100). Two agents start: Agent A starts at (0, 0) — top-left corner Agent B starts at (0, M−1) — top-right corner Both agents must move to the bottom row (any column). They move simultaneously, and each step they can: Move down-left Move down Move down-right If both agents land on the same cell, the coins in that cell are counted only once.
Generic questions about what’s on your resume + technical coding questions.
What are you salary expactations?
Cosa faresti per affrontare un audit interno?
All process related with business analysis and delivery/project management
Classic questions, in french, english, spanish. The sequence was really fast (30 minutes with a lot of questions)
Tell me about yourself. Describe yourself. What attracts you to our company?
Tell me about yourself
Just questions about you and your availability, why you want to work there, etc.
Do you have a favorite typeface or website (specifically one that inspires you?)
Viewing 391 - 400 interview questions