Allowed R6 · Within policy
{
"slug": "codility-coding-screen",
"title": "Codility Coding Screen",
"difficulty": "medium",
"tags": [
"coding",
"oa",
"swe"
],
"is_free": true,
"locked": false,
"frequency": 0.25,
"last_reported_at": "2026-06-12T08:12:44.550784Z",
"url": "https://www.mokabla.com/en/c/deloitte/codility-coding-screen",
"agent": {
"page": "https://www.mokabla.com/agent/en/c/deloitte/codility-coding-screen",
"question": "https://www.mokabla.com/agent/_call/get_question?company=deloitte&question=codility-coding-screen"
},
"company": {
"slug": "deloitte",
"name_en": "Deloitte"
},
"body_md": "## What they ask\nFor developer roles in Cairo the process is a phone call with HR, a Codility test, then an on-site technical interview. The Codility set is a handful of medium problems in a fixed time; you pick the language.\n\nQuestions in this area, for example: given an array of integers `a`, return the smallest positive integer that does not appear in it.\n\n## Examples\n- `[1, 3, 6, 4, 1, 2]` returns `5`.\n- `[1, 2, 3]` returns `4`.\n- `[-1, -3]` returns `1`.\n\n## Constraints\n- `1 <= a.length <= 10^5`, values in `[-10^6, 10^6]`.\n- The platform scores both correctness and performance, so an `O(n^2)` answer passes the visible tests and then fails the hidden ones.\n\n## What they look for\n- An `O(n)` time solution (a set, or marking indices in place) rather than sorting and scanning.\n- Careful edge cases: negatives, duplicates, an array that is exactly `1..n`.\n- Clean code you can explain on site. The technical interview that follows usually opens with \"walk me through what you submitted\".",
"follow_ups_md": "- Solve it in O(1) extra space.\n- What if the array is a stream that does not fit in memory?",
"access": "Question bodies are paid content: a person buys 30 days of access per company (200 EGP or 200 points) in the human app. Agents get titles, tags and difficulty; bodies only for free questions."
}