рд╕рдВрдЬреНрдЮрд╛рдирд╛рддреНрдордХ рдХреНрд╖рдорддрд╛

Computational thinking test for hiring

See how candidates reason through structured problems without writing code.

  • 10 рдорд┐рдирд┐рдЯреЗ
  • 15 рдкреНрд░рд╢реНрди
  • рдордзреНрдпрдо
  • рдмрд╣реБрдкрд░реНрдпрд╛рдпреА, рдХреНрд░рдо рд▓рд╛рд╡рдгреЗ
  • рдЗрдВрдЧреНрд░рдЬреА рдордзреАрд▓ рдкреНрд░рд╢реНрди
  • рдлреЛрди рдЖрдгрд┐ рдбреЗрд╕реНрдХрдЯреЙрдк

рдереЛрдбрдХреНрдпрд╛рдд рдЙрддреНрддрд░

The Computational Thinking test is a 10-minute, 15-question hiring assessment for roles that solve structured problems with data or systems. It measures how candidates find rules in examples, follow and order procedures, break tasks into parts, and focus on relevant details under time pressure. It is designed for roles including software developers, data analysts, and systems analysts.

рд╣реЗ рдХрд╛рдп рдореЛрдЬрддреЗ

Finding rules in examples, following and ordering procedures, breaking tasks into parts, and focusing on the details that matter, under time pressure.

Pattern recognition

Candidates identify the rule that explains a set of examples.

Algorithmic thinking

Candidates follow and arrange plain-English steps into a workable procedure.

Decomposition

Candidates split a larger task into smaller parts and put those parts in a workable order.

Abstraction

Candidates pick out the details that matter for a stated goal.

рдкреНрд░рд╢реНрдирд╛рдВрдЪреЗ рдкреНрд░рдХрд╛рд░

рдмрд╣реБрдкрд░реНрдпрд╛рдпреА

рдЙрдореЗрджрд╡рд╛рд░: рдереЛрдбрдХреНрдпрд╛рдд рджрд┐рд▓реЗрд▓реА рдкрд░рд┐рд╕реНрдерд┐рддреА, рддрдХреНрддрд╛ рдХрд┐рдВрд╡рд╛ рд╡рд┐рдзрд╛рди рд╡рд╛рдЪреВрди рдпреЛрдЧреНрдп рдЙрддреНрддрд░ рдХрд┐рдВрд╡рд╛ рд╕рд░реНрд╡ рдпреЛрдЧреНрдп рдЙрддреНрддрд░реЗ рдирд┐рд╡рдбрддреЗ.

рддреБрдореНрд╣рд╛рд▓рд╛ рджрд┐рд╕рддреЗ: рдЙрдореЗрджрд╡рд╛рд░рд╛рд▓рд╛ рд╡рд┐рд╖рдпрд╛рдЪреЗ рдЬреНрдЮрд╛рди рдХреЗрд╡рд│ рдУрд│рдЦрдгреНрдпрд╛рдкреБрд░рддреЗрдЪ рдирд╛рд╣реА, рддрд░ рддреЗ рд▓рд╛рдЧреВ рдХрд░рддрд╛ рдпреЗрдИрд▓ рдЗрддрдХреЗ рдЖрд╣реЗ рдХреА рдирд╛рд╣реА.

рдХреНрд░рдо рд▓рд╛рд╡рдгреЗ

рдЙрдореЗрджрд╡рд╛рд░: рдкрд╛рдпрд▒реНрдпрд╛ рдХрд┐рдВрд╡рд╛ рд╡рд╕реНрддреВ рдпреЛрдЧреНрдп рдХреНрд░рдорд╛рдиреЗ рд▓рд╛рд╡рддреЗ.

рддреБрдореНрд╣рд╛рд▓рд╛ рджрд┐рд╕рддреЗ: рдПрдЦрд╛рджреА рдкреНрд░рдХреНрд░рд┐рдпрд╛ рд╕реБрд░реБрд╡рд╛рддреАрдкрд╛рд╕реВрди рд╢реЗрд╡рдЯрдкрд░реНрдпрдВрдд рд╕рдордЬреВрди рдШреЗрдгреЗ.

10 рдорд┐рдирд┐рдЯрд╛рдВрдд 15 рдкреНрд░рд╢реНрди, рдПрдХрд╛ рд╡реЗрд│реА рдПрдХ рдкреНрд░рд╢реНрди рджрд┐рд▓рд╛ рдЬрд╛рддреЛ.

рд╣реА рдЪрд╛рдЪрдгреА рд▓рд╛рдЧреВ рд╣реЛрдгрд╛рд▒реНрдпрд╛ рднреВрдорд┐рдХрд╛

Roles that solve structured problems with data or systems: software developers and engineers, data analysts and scientists, machine learning engineers, systems and security analysts, network administrators and quantitative finance roles.

What this test can show

  1. Reasoning beyond a resume

    See how a candidate spots rules, orders procedures, and handles small tables, rather than relying only on listed experience.

  2. A focused hiring signal

    Use one timed assessment to review pattern recognition, step-by-step thinking, task breakdown, and attention to relevant details.

  3. No coding requirement

    Procedures use numbered plain-English steps, so the questions assess computational thinking without requiring a programming language or prior coding experience.

  4. A short assessment

    The 10-minute test has 15 multiple-choice and ordering questions. Scratch paper is allowed, and the arithmetic is light enough to do without a calculator.

рдкреНрд░рддреНрдпреЗрдХ рдЙрдореЗрджрд╡рд╛рд░рд╛рд╕рд╛рдареА рддреБрдореНрд╣рд╛рд▓рд╛ рдХрд╛рдп рдорд┐рд│рддреЗ

рдЙрджрд╛рд╣рд░рдгрд╛рд░реНрде рдЕрд╣рд╡рд╛рд▓ (рдХрд╛рд▓реНрдкрдирд┐рдХ рдбреЗрдЯрд╛)рд╕рдВрдЧрдгрдХреАрдп рд╡рд┐рдЪрд╛рд░
ремрен%рдкрд░реНрд╕реЗрдВрдЯрд╛рдЗрд▓ 37. рдмреЗрдВрдЪрдорд╛рд░реНрдХ: HireValid рдЙрдореЗрджрд╡рд╛рд░, n = реиренрен
Pattern recognitionреореж%
Algorithmic thinkingрелрен%
Decompositionрелрео%
Abstractionренрез%
Integrity ScoreрдЙрдЪреНрдЪ рд╡рд┐рд╢реНрд╡рд╛рд╕рдкрд╛рддрд│реА
  • рд╕рдВрдкреВрд░реНрдг рдЪрд╛рдЪрдгреАрджрд░рдореНрдпрд╛рди рдЪрд╛рдЪрдгреАрдЪрд╛ рдЯреЕрдм рдЙрдШрдбрд╛ рдареЗрд╡рд▓рд╛
  • рдкреЗрд╕реНрдЯ рдХреЗрд▓реЗрд▓реА рдЙрддреНрддрд░реЗ рдирд╛рд╣реАрдд
  • рд╕реНрдерд┐рд░ рдЧрддреАрдиреЗ рдЙрддреНрддрд░реЗ рджрд┐рд▓реА

рд╕реНрдХреЛрдЕрд░, рдкреНрд░реЛрдлрд╛рдЗрд▓ рдЖрдгрд┐ Integrity Score рдордзреАрд▓ рд╕рдВрдХреЗрдд рд╣реЗ рдореБрд▓рд╛рдЦрддреАрд╕реЛрдмрдд рддреБрдореНрд╣реА рддрдкрд╛рд╕рдгреНрдпрд╛рд╕рд╛рдареАрдЪреЗ рдкреБрд░рд╛рд╡реЗ рдЖрд╣реЗрдд; рддреЗ рдХрдзреАрд╣реА рд╕реНрд╡рдпрдВрдЪрд▓рд┐рдд рдирд┐рд░реНрдгрдпрд╛рдЪрд╛ рдЖрдзрд╛рд░ рдирд╕рддрд╛рдд.

рд╣реА рдЯреЗрд╕реНрдЯ рд╡рд┐рдирд╛рдореВрд▓реНрдп рд╡рд╛рдкрд░рд╛

Assessment integrity features

Each candidate receives a different set of questions from large question pools. Questions and answer options are shuffled, and the browser receives one question at a time. Answer keys stay on HireValidтАЩs servers. Timing runs on the server; reloading restores the same question with only the time left. Candidates cannot go back to earlier questions. Question text cannot be copied or selected, and a blocked copy attempt is recorded in the timeline. A personal invitation link expires, and a finished test cannot be taken again. HireValid summarizes signals such as time away from the test tab, pastes into answers, and answers faster than a question can be read in an Integrity Score with an evidence timeline. The employer reviews this evidence; it does not decide on its own. With candidate consent, an employer can add webcam photos at random moments.

Use the score as one piece of evidence

Review the score alongside a job-relevant work sample and a structured interview. For a data role, for example, ask the candidate to explain how they would break a small analysis task into steps. Compare that reasoning with the testтАЩs evidence about finding rules, ordering procedures, and selecting relevant details. The score should inform a personтАЩs review, not decide the hiring outcome. For a related reasoning test, see Abstract Reasoning.

Structured interview questions

  1. Tell me how you would break a complex work task into smaller steps and decide what to do first.

    Listen for a clear sequence, workable parts, and an explanation of what depends on what.

  2. Describe a time you used examples or data to work out a rule. What did you look for?

    Listen for how the candidate compared examples, identified a pattern, and checked whether it fit.

  3. How would you decide which details matter when working toward a specific result?

    Listen for a connection between the goal and the details selected, rather than an unfocused list.

рдирд┐рд╖реНрдкрдХреНрд╖рддрд╛ рдЖрдгрд┐ рдЖрд╡рд╢реНрдпрдХ рд╕реБрд╡рд┐рдзрд╛

No programming language or prior coding experience is needed: procedures are written as numbered plain-English steps and data appears in small tables. Scenarios use everyday workplace tasks with names from many backgrounds, metric units, no money, idioms or local knowledge, and nothing depends on color. Scratch paper is allowed for every candidate, and the arithmetic is light enough to do without a calculator.

рд╕реЛрдпреАрд╕рд╛рдареА рддреБрдореНрд╣реА рдХреЛрдгрддреНрдпрд╛рд╣реА рдЙрдореЗрджрд╡рд╛рд░рд╛рд▓рд╛ рдЕрддрд┐рд░рд┐рдХреНрдд рд╡реЗрд│ рджреЗрдК рд╢рдХрддрд╛. рдирд┐рдХрд╛рд▓ рд╣реЗ рдПрдЦрд╛рджреНрдпрд╛ рд╡реНрдпрдХреНрддреАрдиреЗ рддрдкрд╛рд╕рдгреНрдпрд╛рд╕рд╛рдареАрдЪреЗ рдкреБрд░рд╛рд╡реЗ рдЖрд╣реЗрдд, рд╕реНрд╡рдпрдВрдЪрд▓рд┐рдд рдирд┐рд░реНрдгрдпрд╛рдЪрд╛ рдЖрдзрд╛рд░ рдирд╛рд╣реАрдд.

Provisional: reliability is reported once 200 candidates have completed it.

рдирд┐рд╖реНрдкрдХреНрд╖рддреЗрдмрд╛рдмрддрдЪрд╛ рдЖрдордЪрд╛ рджреГрд╖реНрдЯрд┐рдХреЛрди рд╡рд╛рдЪрд╛

рдЪрд╛рдЪрдгреАрдЪреЗ рддрдкрд╢реАрд▓

A short, timed test of how a candidate approaches problems the way a programmer or analyst would, without writing any code. Candidates spot the rule behind examples, follow and arrange step-by-step procedures, split a larger task into parts in a workable order, and pick out the details that matter for a goal.

  • рдкреНрд░рд╢реНрди рдЗрдВрдЧреНрд░рдЬреАрдордзреНрдпреЗ рдЖрд╣реЗрдд.
  • рдкрд░рд╡рд╛рдирдЧреА рдЕрд╕рд▓реЗрд▓реА рд╕рд╛рдзрдиреЗ: рдЦрд░рдбрдгреНрдпрд╛рд╕рд╛рдареАрдЪрд╛ рдХрд╛рдЧрдж.
  • рдкреНрд░рддреНрдпреЗрдХ рдкреНрд░рд╢реНрдирд╛рдЪреЗ рдЙрддреНрддрд░ рдХреНрд░рдорд╛рдиреЗ рдПрдХрджрд╛рдЪ рджреЗрддрд╛ рдпреЗрддреЗ. рдорд╛рдЧреАрд▓ рдкреНрд░рд╢реНрдирд╛рдХрдбреЗ рдкрд░рдд рдЬрд╛рддрд╛ рдпреЗрдд рдирд╛рд╣реА.
  • рд╡реЗрд│реЗрдЪреНрдпрд╛ рдорд░реНрдпрд╛рджреЗрддреАрд▓ рдЯреЗрд╕реНрдЯрдкреВрд░реНрд╡реА 4 рд╕рд░рд╛рд╡ рдкреНрд░рд╢реНрди, 4 рдорд┐рдирд┐рдЯреЗ.

рд╡рд╛рд░рдВрд╡рд╛рд░ рд╡рд┐рдЪрд╛рд░рд▓реЗ рдЬрд╛рдгрд╛рд░реЗ рдкреНрд░рд╢реНрди

What does the Computational Thinking test measure?+

It measures how candidates find rules in examples, follow and order procedures, break tasks into parts, and focus on details that matter for a goal. Questions use multiple-choice and ordering formats. Procedures are written as numbered plain-English steps, and data appears in small tables.

How long does the Computational Thinking test take?+

The Computational Thinking test takes 10 minutes and has 15 questions. Candidates see one question at a time and cannot return to an earlier question. A practice set has 4 questions and takes 4 minutes, so candidates can get familiar with the question formats before starting.

Who should use the Computational Thinking test?+

It is intended for roles that solve structured problems with data or systems, including software developers and engineers, data analysts and scientists, machine learning engineers, systems and security analysts, network administrators, and quantitative finance roles. It assesses reasoning without requiring code.

Does the Computational Thinking test require coding?+

No. No programming language or prior coding experience is needed. Procedures are numbered plain-English steps, and data appears in small tables. Everyday workplace scenarios use metric units and do not depend on money, idioms, local knowledge, or color. Scratch paper is allowed, and the arithmetic is light enough to do without a calculator.

рд╕рдВрдмрдВрдзрд┐рдд рдЪрд╛рдЪрдгреНрдпрд╛

рд╕рдВрдЬреНрдЮрд╛рдирд╛рддреНрдордХ рдХреНрд╖рдорддрд╛

рдЕрдореВрд░реНрдд рддрд░реНрдХрд╢рдХреНрддреА

10 рдорд┐рдирд┐рдЯреЗ, рд╕рдВрдЬреНрдЮрд╛рдирд╛рддреНрдордХ рдХреНрд╖рдорддрд╛

рдПрдХреНрд╕рдкреНрд▓реЛрд░ рдХрд░рд╛
рд╕рдВрдЬреНрдЮрд╛рдирд╛рддреНрдордХ рдХреНрд╖рдорддрд╛

Verbal Reasoning

10 рдорд┐рдирд┐рдЯреЗ, рд╕рдВрдЬреНрдЮрд╛рдирд╛рддреНрдордХ рдХреНрд╖рдорддрд╛

рдПрдХреНрд╕рдкреНрд▓реЛрд░ рдХрд░рд╛
рд╕рдВрдЬреНрдЮрд╛рдирд╛рддреНрдордХ рдХреНрд╖рдорддрд╛

рд╡рд╛рдЪрди рдЖрдХрд▓рди

13 рдорд┐рдирд┐рдЯреЗ, рд╕рдВрдЬреНрдЮрд╛рдирд╛рддреНрдордХ рдХреНрд╖рдорддрд╛

рдПрдХреНрд╕рдкреНрд▓реЛрд░ рдХрд░рд╛
рд╕рдВрдЬреНрдЮрд╛рдирд╛рддреНрдордХ рдХреНрд╖рдорддрд╛

рдЕрд╡рдХрд╛рд╢реАрдп рддрд░реНрдХрд╢рдХреНрддреА

10 рдорд┐рдирд┐рдЯреЗ, рд╕рдВрдЬреНрдЮрд╛рдирд╛рддреНрдордХ рдХреНрд╖рдорддрд╛

рдПрдХреНрд╕рдкреНрд▓реЛрд░ рдХрд░рд╛
рд╕рдВрдЬреНрдЮрд╛рдирд╛рддреНрдордХ рдХреНрд╖рдорддрд╛

рд╕рдВрдЦреНрдпрд╛рддреНрдордХ рддрд░реНрдХрд╢рдХреНрддреА

12 рдорд┐рдирд┐рдЯреЗ, рд╕рдВрдЬреНрдЮрд╛рдирд╛рддреНрдордХ рдХреНрд╖рдорддрд╛

рдПрдХреНрд╕рдкреНрд▓реЛрд░ рдХрд░рд╛
рд╕рдВрдЬреНрдЮрд╛рдирд╛рддреНрдордХ рдХреНрд╖рдорддрд╛

рдЪрд┐рдХрд┐рддреНрд╕рдХ рд╡рд┐рдЪрд╛рд░

12 рдорд┐рдирд┐рдЯреЗ, рд╕рдВрдЬреНрдЮрд╛рдирд╛рддреНрдордХ рдХреНрд╖рдорддрд╛

рдПрдХреНрд╕рдкреНрд▓реЛрд░ рдХрд░рд╛

рддреБрдордЪреНрдпрд╛ рдкреБрдвреАрд▓ рднрд░рддреАрд╕рд╛рдареА рд╕рдВрдЧрдгрдХреАрдп рд╡рд┐рдЪрд╛рд░ рдЯреЗрд╕реНрдЯ рд╡рд╛рдкрд░рд╛

Free рд╕рд╣рд┐рдд рдкреНрд░рддреНрдпреЗрдХ рдкреНрд▓реЕрдирдордзреНрдпреЗ рд╕рдВрдкреВрд░реНрдг рдЯреЗрд╕реНрдЯ рд▓рд╛рдпрдмреНрд░рд░реА рдЙрдкрд▓рдмреНрдз рдЖрд╣реЗ.

рд╣реА рдЯреЗрд╕реНрдЯ рд╡рд┐рдирд╛рдореВрд▓реНрдп рд╡рд╛рдкрд░рд╛Free рдкреНрд▓реЕрди. рдХреНрд░реЗрдбрд┐рдЯ рдХрд╛рд░реНрдбрдЪреА рдЧрд░рдЬ рдирд╛рд╣реА.
Free рдкреНрд▓реЕрди. рдХреНрд░реЗрдбрд┐рдЯ рдХрд╛рд░реНрдбрдЪреА рдЧрд░рдЬ рдирд╛рд╣реА.рд╣реА рдЯреЗрд╕реНрдЯ рд╡рд┐рдирд╛рдореВрд▓реНрдп рд╡рд╛рдкрд░рд╛

рд╕рдВрдкрд╛рджрдХреАрдп рдЯреАрдордмрджреНрджрд▓

HireValid editorial team рдиреЗ рд▓рд┐рд╣рд┐рд▓реЗрд▓реЗ рдЖрдгрд┐ рддрдереНрдпрд╛рдВрдЪреА рдкрдбрддрд╛рд│рдгреА рдХреЗрд▓реЗрд▓реЗ. рддрдкрд╛рд╕рд▓реЗрд▓реЗ рд╕реНрд░реЛрдд . рд╕рдВрдкрд╛рджрдХреАрдп рдзреЛрд░рдг рд╡рд╛рдЪрд╛.