рдкреНрд░реЛрдЧреНрд░рд╛рдорд┐рдВрдЧ рд╕реНрдХрд┐рд▓реНрд╕

Coding graphs test for hiring

See how candidates turn a connected-data problem into a working program.

  • 35 рдорд┐рдирдЯ
  • 1 рдЯрд╛рд╕реНрдХ
  • рдордзреНрдпрдо рд╕реНрддрд░
  • рдХреЛрдбрд┐рдВрдЧ рдЯрд╛рд╕реНрдХ
  • рдЕрдВрдЧреНрд░реЗрдЬрд╝реА рдореЗрдВ рдкреНрд░рд╢реНрди
  • рд╕рд┐рд░реНрдлрд╝ рдбреЗрд╕реНрдХрдЯреЙрдк

рдЫреЛрдЯрд╛ рдЬрд╡рд╛рдм

The Coding: Graphs test is an intermediate, single-task programming assessment for software engineers, backend and full stack developers, and other programming roles that model networks, dependencies or routes. It measures whether candidates can represent a problem as a graph and write correct code using a fitting traversal or algorithm.

рдпрд╣ рдХреНрдпрд╛ рдорд╛рдкрддрд╛ рд╣реИ

Writing correct code that models a problem as a graph and solves it with a fitting traversal or algorithm.

Graph algorithms

Candidates model connections as a graph and choose a traversal or algorithm to solve the stated problem.

рдкреНрд░рд╢реНрдиреЛрдВ рдХреЗ рдлрд╝реЙрд░реНрдореИрдЯ

рдХреЛрдбрд┐рдВрдЧ рдЯрд╛рд╕реНрдХ

рдЙрдореНрдореАрджрд╡рд╛рд░: рдПрдбрд┐рдЯрд░ рдореЗрдВ рдХреЛрдб рд▓рд┐рдЦрддреЗ рд╣реИрдВ рдпрд╛ рдареАрдХ рдХрд░рддреЗ рд╣реИрдВ рдФрд░ рдЙрд╕реЗ рдЙрджрд╛рд╣рд░рдгреЛрдВ рдХреЗ рд╕рд╛рде рдЪрд▓рд╛рдХрд░ рджреЗрдЦрддреЗ рд╣реИрдВред

рдЖрдкрдХреЛ рджрд┐рдЦрддрд╛ рд╣реИ: рдЪрд▓рдиреЗ рд╡рд╛рд▓реЗ рдХреЛрдб рдХреЛ рдЫрд┐рдкреЗ рд╣реБрдП рдЯреЗрд╕реНрдЯ рдХреЗрд╕ рдХреЗ рдЖрдзрд╛рд░ рдкрд░ рдЬрд╛рдБрдЪрд╛ рдЬрд╛рддрд╛ рд╣реИ, рд╕рд┐рд░реНрдлрд╝ рд╕рд┐рдВрдЯреИрдХреНрд╕ рдХреА рдЬрд╛рдирдХрд╛рд░реА рдХреЗ рдЖрдзрд╛рд░ рдкрд░ рдирд╣реАрдВред

35 рдорд┐рдирдЯ рдореЗрдВ 1 рдЯрд╛рд╕реНрдХред

рдпрд╣ рдЯреЗрд╕реНрдЯ рдХрд┐рди рднреВрдорд┐рдХрд╛рдУрдВ рдХреЗ рд▓рд┐рдП рдЙрдкрдпреБрдХреНрдд рд╣реИ

Software engineers, backend and full stack developers, and other programming roles where data is modeled as networks, dependencies or routes.

What this test helps you see

  1. Code for connected data

    The task shows how candidates translate a problem about routes, dependencies or networks into a graph-based program with a fitting traversal or algorithm.

  2. Unreachable nodes and cycles

    Hidden cases include unreachable nodes and cycles, so you see whether the solution handles more than the shown examples.

  3. A graph setting that needs no outside knowledge

    Tasks use neutral settings such as servers, tasks or rooms, and the problem states everything needed, without assuming knowledge of a place, sport or culture.

рд╣рд░ рдЙрдореНрдореАрджрд╡рд╛рд░ рдХреЗ рд▓рд┐рдП рдЖрдкрдХреЛ рдХреНрдпрд╛ рдорд┐рд▓рддрд╛ рд╣реИ

рдЙрджрд╛рд╣рд░рдг рд░рд┐рдкреЛрд░реНрдЯ (рдХрд╛рд▓реНрдкрдирд┐рдХ рдбреЗрдЯрд╛)рдХреЛрдбрд┐рдВрдЧ: рдЧреНрд░рд╛рдлрд╝
59%рдкрд░реНрд╕реЗрдВрдЯрд╛рдЗрд▓ 20ред рдмреЗрдВрдЪрдорд╛рд░реНрдХ: HireValid рдХреЗ рдЙрдореНрдореАрджрд╡рд╛рд░, n = 1,540
Graph algorithms59%
Integrity ScoreрдЙрдЪреНрдЪ рднрд░реЛрд╕рд╛
  • рдкреВрд░реЗ рдЯреЗрд╕реНрдЯ рдХреЗ рджреМрд░рд╛рди рдЯреЗрд╕реНрдЯ рдЯреИрдм рдкрд░ рд░рд╣реЗ
  • рдЬрд╡рд╛рдм рдХреЙрдкреА-рдкреЗрд╕реНрдЯ рдирд╣реАрдВ рдХрд┐рдП рдЧрдП
  • рдПрдХ рд╕реНрдерд┐рд░ рдЧрддрд┐ рд╕реЗ рдЬрд╡рд╛рдм рджрд┐рдП

рд╕реНрдХреЛрд░, рдкреНрд░реЛрдлрд╝рд╛рдЗрд▓ рдФрд░ Integrity Score рдХреЗ рд╕рдВрдХреЗрдд рдЗрдВрдЯрд░рд╡реНрдпреВ рдХреЗ рд╕рд╛рде рдЖрдкрдХреА рд╕рдореАрдХреНрд╖рд╛ рдХреЗ рд▓рд┐рдП рд╕рдмреВрдд рд╣реИрдВ, рдЕрдкрдиреЗ-рдЖрдк рд▓рд┐рдпрд╛ рдЧрдпрд╛ рдирд┐рд░реНрдгрдп рдХрднреА рдирд╣реАрдВред

рдЗрд╕ рдЯреЗрд╕реНрдЯ рдХрд╛ рдореБрдлрд╝реНрдд рдореЗрдВ рдЗрд╕реНрддреЗрдорд╛рд▓ рдХрд░реЗрдВ

Test integrity signals

Each candidate receives a different set of questions from large question pools. The browser shows one question at a time, and answer keys stay on HireValidтАЩs servers. The 35-minute timer runs on the server; reloading restores the same question with only the remaining time, and candidates cannot go back. Code runs against hidden cases on HireValidтАЩs servers, where the cases and solutions stay out of the browser. Pastes into the editor are recorded. HireValid can also record signals such as time away from the test tab and summarize them with an evidence timeline for employer review. The Integrity Score does not make a decision on its own. See how we build our tests and the pre-employment testing guide for more context.

Use the score as evidence

Treat the score as a signal to review, not a hiring decision. It comes from one taskтАЩs hidden cases, so it reflects a sample of graph skills from one problem. Pair it with a work sample that resembles the connected-data problems in the role, then use a structured interview to ask how the candidate approached their solution. Review the code and the candidateтАЩs explanation together. For related hiring context, see the Software Engineer test and Algorithms for Software Engineering.

Structured interview questions

  1. How would you start modeling a problem where some routes may not connect every location?

    Listen for how the candidate identifies nodes and connections, clarifies the required result, and plans to account for unreachable nodes.

  2. Tell me about a project where dependencies affected the order of work.

    Listen for a concrete account of representing dependencies, handling cycles if they arose, and checking that the chosen approach matched the problem.

  3. How would you test a graph solution beyond the examples provided?

    Listen for a practical testing plan that considers edge cases, including unreachable nodes or cycles when relevant to the stated problem.

рдирд┐рд╖реНрдкрдХреНрд╖рддрд╛ рдФрд░ рдЬрд╝рд░реВрд░реА рд╕реБрд╡рд┐рдзрд╛рдПрдБ

Every task is told in a plain, neutral setting such as servers, tasks or rooms, with everything needed stated in the problem and no knowledge of any place, sport or culture assumed. Candidates choose among six common languages, input and output are plain text read the same way in each, and the time limit leaves room to read, plan, write and test one solution.

рдЖрдк рдХрд┐рд╕реА рднреА рдЙрдореНрдореАрджрд╡рд╛рд░ рдХреЛ рд╕реБрд╡рд┐рдзрд╛ рдХреЗ рддреМрд░ рдкрд░ рдЕрддрд┐рд░рд┐рдХреНрдд рд╕рдордп рджреЗ рд╕рдХрддреЗ рд╣реИрдВред рдирддреАрдЬреЗ рдХрд┐рд╕реА рд╡реНрдпрдХреНрддрд┐ рджреНрд╡рд╛рд░рд╛ рд╕рдореАрдХреНрд╖рд╛ рдХреЗ рд▓рд┐рдП рд╕рдмреВрдд рд╣реИрдВ, рдХрднреА рднреА рдЕрдкрдиреЗ-рдЖрдк рд▓рд┐рдпрд╛ рдЧрдпрд╛ рдлрд╝реИрд╕рд▓рд╛ рдирд╣реАрдВред

Provisional: the score comes from one task's hidden cases, so it reflects one problem's sample of graph skills. Reliability is reported once 200 candidates have completed it.

рд╣рдорд╛рд░рд╛ рдирд┐рд╖реНрдкрдХреНрд╖рддрд╛ рджреГрд╖реНрдЯрд┐рдХреЛрдг рдкрдврд╝реЗрдВ

рдЯреЗрд╕реНрдЯ рдХреА рдЬрд╛рдирдХрд╛рд░реА

A single programming task built around a graph: the candidate reads a short problem about connections between things, such as routes, dependencies or networks, and writes a working program that solves it. The program is run against the shown examples and against hidden cases, including edge cases such as unreachable nodes and cycles. Candidates may write their solution in Python, JavaScript, Java, C#, C++ or Go.

  • рдкреНрд░рд╢реНрди English рдореЗрдВ рд╣реИрдВред
  • рдЕрдиреБрдордд рд╕рд╣рд╛рдпрдХ рд╕рд╛рдзрди: рд░рдлрд╝ рдкреЗрдкрд░ред
  • рд╕рдордпрдмрджреНрдз рдЯреЗрд╕реНрдЯ рд╕реЗ рдкрд╣рд▓реЗ 1 рдЕрднреНрдпрд╛рд╕ рдЯрд╛рд╕реНрдХ, 10 рдорд┐рдирдЯред
  • рдбреЗрд╕реНрдХрдЯреЙрдк рдпрд╛ рд▓реИрдкрдЯреЙрдк рдХрдВрдкреНрдпреВрдЯрд░ рдкрд░ рджрд┐рдпрд╛ рдЬрд╛рддрд╛ рд╣реИред

Python, JavaScript, Java, C#, C++, Go рдЕрдкрдиреЗ рдорд╛рд▓рд┐рдХреЛрдВ рдХреЗ рдЯреНрд░реЗрдбрдорд╛рд░реНрдХ рд╣реИрдВред HireValid рдЙрдирд╕реЗ рд╕рдВрдмрджреНрдз рдирд╣реАрдВ рд╣реИ рдФрд░ рди рд╣реА рдЙрдирдХрд╛ рд╕рдорд░реНрдерди рдкреНрд░рд╛рдкреНрдд рд╣реИред

рдЕрдХреНрд╕рд░ рдкреВрдЫреЗ рдЬрд╛рдиреЗ рд╡рд╛рд▓реЗ рд╕рд╡рд╛рд▓

What does the Coding: Graphs test ask candidates to do?+

Candidates read a short problem about connections, such as routes, dependencies or networks, then write a program to solve it. The program runs against shown examples and hidden cases, including edge cases such as unreachable nodes and cycles. The test measures graph modeling and the use of a fitting traversal or algorithm.

How does the Coding: Graphs test support a fair task?+

The task uses a plain, neutral setting, such as servers, tasks or rooms, and states everything needed to solve it. Candidates choose among six common languages, and input and output are plain text read the same way in each. The time limit leaves room to read, plan, write and test one solution.

Can candidates use scratch paper or practice before the Coding: Graphs test?+

Scratch paper is allowed. Candidates can also take a practice set with one question and a 10-minute limit. The hiring test itself is desktop-only and has one coding task with a 35-minute limit, so candidates should complete it on a desktop device.

Which roles fit the intermediate Coding: Graphs test?+

It is intended for software engineers, backend and full stack developers, and other programming roles where data is modeled as networks, dependencies or routes. Its intermediate level makes it a relevant signal for hiring into those roles when graph-based work is part of the job.

рд╕рдВрдмрдВрдзрд┐рдд рдЯреЗрд╕реНрдЯ

рдкреНрд░реЛрдЧреНрд░рд╛рдорд┐рдВрдЧ рд╕реНрдХрд┐рд▓реНрд╕

рдХреЛрдбрд┐рдВрдЧ: рдПрд▓реНрдЧреЛрд░рд┐рджрдо, рд╢реБрд░реБрдЖрддреА рд╕реНрддрд░

15 рдорд┐рдирдЯ, рдкреНрд░реЛрдЧреНрд░рд╛рдорд┐рдВрдЧ рд╕реНрдХрд┐рд▓реНрд╕

рдЬрд╛рдиреЗрдВ
рдкреНрд░реЛрдЧреНрд░рд╛рдорд┐рдВрдЧ рд╕реНрдХрд┐рд▓реНрд╕

рдХреЛрдбрд┐рдВрдЧ: рдПрд▓реНрдЧреЛрд░рд┐рджрдо, рдордзреНрдпрдо рд╕реНрддрд░

35 рдорд┐рдирдЯ, рдкреНрд░реЛрдЧреНрд░рд╛рдорд┐рдВрдЧ рд╕реНрдХрд┐рд▓реНрд╕

рдЬрд╛рдиреЗрдВ
рдкреНрд░реЛрдЧреНрд░рд╛рдорд┐рдВрдЧ рд╕реНрдХрд┐рд▓реНрд╕

.NET

10 рдорд┐рдирдЯ, рдкреНрд░реЛрдЧреНрд░рд╛рдорд┐рдВрдЧ рд╕реНрдХрд┐рд▓реНрд╕

рдЬрд╛рдиреЗрдВ
рдкреНрд░реЛрдЧреНрд░рд╛рдорд┐рдВрдЧ рд╕реНрдХрд┐рд▓реНрд╕

GitHub

10 рдорд┐рдирдЯ, рдкреНрд░реЛрдЧреНрд░рд╛рдорд┐рдВрдЧ рд╕реНрдХрд┐рд▓реНрд╕

рдЬрд╛рдиреЗрдВ
рдкреНрд░реЛрдЧреНрд░рд╛рдорд┐рдВрдЧ рд╕реНрдХрд┐рд▓реНрд╕

рдСрдмреНрдЬреЗрдХреНрдЯ-рдУрд░рд┐рдПрдВрдЯреЗрдб рдкреНрд░реЛрдЧреНрд░рд╛рдорд┐рдВрдЧ

10 рдорд┐рдирдЯ, рдкреНрд░реЛрдЧреНрд░рд╛рдорд┐рдВрдЧ рд╕реНрдХрд┐рд▓реНрд╕

рдЬрд╛рдиреЗрдВ
рдкреНрд░реЛрдЧреНрд░рд╛рдорд┐рдВрдЧ рд╕реНрдХрд┐рд▓реНрд╕

рдХреНрд▓реАрди рдХреЛрдб

10 рдорд┐рдирдЯ, рдкреНрд░реЛрдЧреНрд░рд╛рдорд┐рдВрдЧ рд╕реНрдХрд┐рд▓реНрд╕

рдЬрд╛рдиреЗрдВ

рдЕрдкрдиреА рдЕрдЧрд▓реА рднрд░реНрддреА рдореЗрдВ рдХреЛрдбрд┐рдВрдЧ: рдЧреНрд░рд╛рдлрд╝ рдЯреЗрд╕реНрдЯ рдХрд╛ рдЗрд╕реНрддреЗрдорд╛рд▓ рдХрд░реЗрдВ

рд╣рд░ рдкреНрд▓рд╛рди рдореЗрдВ, Free рд╕рд╣рд┐рдд, рдЯреЗрд╕реНрдЯ рдХреА рдкреВрд░реА рд▓рд╛рдЗрдмреНрд░реЗрд░реА рд╢рд╛рдорд┐рд▓ рд╣реИред

рдЗрд╕ рдЯреЗрд╕реНрдЯ рдХрд╛ рдореБрдлрд╝реНрдд рдореЗрдВ рдЗрд╕реНрддреЗрдорд╛рд▓ рдХрд░реЗрдВFree рдкреНрд▓рд╛рдиред рдХреНрд░реЗрдбрд┐рдЯ рдХрд╛рд░реНрдб рдХреА рдЬрд╝рд░реВрд░рдд рдирд╣реАрдВред
Free рдкреНрд▓рд╛рдиред рдХреНрд░реЗрдбрд┐рдЯ рдХрд╛рд░реНрдб рдХреА рдЬрд╝рд░реВрд░рдд рдирд╣реАрдВредрдЗрд╕ рдЯреЗрд╕реНрдЯ рдХрд╛ рдореБрдлрд╝реНрдд рдореЗрдВ рдЗрд╕реНрддреЗрдорд╛рд▓ рдХрд░реЗрдВ

рд╕рдВрдкрд╛рджрдХреАрдп рдЯреАрдо рдХреЗ рдмрд╛рд░реЗ рдореЗрдВ

HireValid рдХреА editorial team рджреНрд╡рд╛рд░рд╛ рд▓рд┐рдЦрд╛ рдФрд░ fact-check рдХрд┐рдпрд╛ рдЧрдпрд╛ред рдЬрд╛рдБрдЪреЗ рдЧрдП рд╕реНрд░реЛрдд . рд╕рдВрдкрд╛рджрдХреАрдп рдиреАрддрд┐ рдкрдврд╝реЗрдВред