Rust Online Test

The Rust Online test uses scenario-based MCQs to evaluate candidates on their knowledge of Rust programming language, including syntax, data types, memory management, and concurrency. The test aims to evaluate a candidate's ability to write safe and efficient Rust code that meets specific requirements. The test includes a coding question to evaluate hands-on Rust programming skills.

Get started for free

Preview questions

Screen candidates with a 35 mins test

Test duration: 35 mins

Difficulty level: Moderate

Availability: Ready to use

Questions:

6 Rust MCQs
1 Rust Coding Question

Covered skills:

Standard Rust Operators and Syntax

Enums and Pattern Matching

Generic Structs

Smart Pointers

Reference Counting

Thread Pools and Worker

Ownership Concepts

Loops and Strings

OOPS concepts

Generic Iterators

Concurrency

Threads

Get started for free

Preview questions

Use Adaface tests trusted by recruitment teams globally

Adaface is used by 1500+ businesses in 80 countries.

Adaface skill assessments measure on-the-job skills of candidates, providing employers with an accurate tool for screening potential hires.

Use the Rust Test to shortlist qualified candidates

The Rust Online Test helps recruiters and hiring managers identify qualified candidates from a pool of resumes, and helps in taking objective hiring decisions. It reduces the administrative overhead of interviewing too many candidates and saves time by filtering out unqualified candidates at the first step of the hiring process.

The test screens for the following skills that hiring managers look for in candidates:

Ability to write correct and efficient Rust code using standard operators and syntax
Ability to work with enums and pattern matching in Rust
Ability to understand and utilize generic structs in Rust
Ability to work with smart pointers in Rust
Ability to comprehend and implement reference counting in Rust
Ability to use thread pools and workers in Rust
Understanding of ownership concepts in Rust
Ability to work with loops and strings in Rust
Understanding of OOPS concepts in Rust
Ability to work with generic iterators in Rust
Understanding of concurrency concepts in Rust
Ability to work with threads in Rust

Get started for free

Preview questions

Screen candidates with the highest quality questions

We have a very high focus on the quality of questions that test for on-the-job skills. Every question is non-googleable and we have a very high bar for the level of subject matter experts we onboard to create these questions. We have crawlers to check if any of the questions are leaked online. If/ when a question gets leaked, we get an alert. We change the question for you & let you know.

How we design questions

These are just a small sample from our library of 15,000+ questions. The actual questions on this Rust Online Test will be non-googleable.

🧐 Question
Easy Join Handles Concurrency	Solve
Review the following two Rust code snippets: Notice the handle.join().unwrap() line added in snippet two. Pick the correct statements: A: Snippet one prints 1 to 5 in the spawned thread and 1 to 3 in the main thread always. B: Snippet one prints 1 to 3 in the main thread but spawned thread might be closed before it prints all the numbers. C: Snippet two prints 1 to 5 in the spawned thread and 1 to 3 in the main thread always. D: Snippet two prints 1 to 3 in the main thread but the spawned thread might be closed before it prints all the numbers.
Medium Mutable Sample Structs Variables and Mutability	Solve
What does the following Rust code print?
Medium Passed Function Closures	Solve
Review the following code and pick the correct statements: A: The code prints 1223 B: The code prints 1111 C: The code prints 1234 D: The callPassedFunction(passedFunction) on line 7 makes a copy of passedFunction to become the argument of callPassedFunction. The copy gets executed and the x of copy becomes 2, but the original closure still holds a value of 1 for its captured x. E: The callPassedFunction(passedFunction) on line 7 makes a copy of passedFunction to become the argument of callPassedFunction. The copy gets executed and x of the copy and the origin both become 2.
Easy Registration Queue Logic Queues	Solve
We want to register students for the next semester. All students have a receipt which shows the amount pending for the previous semester. A positive amount (or zero) represents that the student has paid extra fees, and a negative amount represents that they have pending fees to be paid. The students are in a queue for the registration. We want to arrange the students in a way such that the students who have a positive amount on the receipt get registered first as compared to the students who have a negative amount. We are given a queue in the form of an array containing the pending amount. For example, if the initial queue is [20, 70, -40, 30, -10], then the final queue will be [20, 70, 30, -40, -10]. Note that the sequence of students should not be changed while arranging them unless required to meet the condition. ⚠️⚠️⚠️ Note: - The first line of the input is the length of the array. The second line contains all the elements of the array. - The input is already parsed into an array of "strings" and passed to a function. You will need to convert string to integer/number type inside the function. - You need to "print" the final result (not return it) to pass the test cases. For the example discussed above, the input will be: 5 20 70 -40 30 -10 Your code needs to print the following to the standard output: 20 70 30 -40 -10
Medium Visitors Count Strings Logic	Solve
A manager hires a staff member to keep a record of the number of men, women, and children visiting the museum daily. The staff will note W if any women visit, M for men, and C for children. You need to write code that takes the string that represents the visits and prints the count of men, woman and children. The sequencing should be in decreasing order. Example: Input: WWMMWWCCC Expected Output: 4W3C2M Explanation: ‘W’ has the highest count, then ‘C’, then ‘M’. ⚠️⚠️⚠️ Note: - The input is already parsed and passed to a function. - You need to "print" the final result (not return it) to pass the test cases. - If the input is- “MMW”, then the expected output is "2M1W" since there is no ‘C’. - If any of them have the same count, the output should follow this order - M, W, C.

	🧐 Question	🔧 Skill
	Easy Join Handles Concurrency	2 mins Rust	Solve
Review the following two Rust code snippets: Notice the handle.join().unwrap() line added in snippet two. Pick the correct statements: A: Snippet one prints 1 to 5 in the spawned thread and 1 to 3 in the main thread always. B: Snippet one prints 1 to 3 in the main thread but spawned thread might be closed before it prints all the numbers. C: Snippet two prints 1 to 5 in the spawned thread and 1 to 3 in the main thread always. D: Snippet two prints 1 to 3 in the main thread but the spawned thread might be closed before it prints all the numbers.
	Medium Mutable Sample Structs Variables and Mutability	2 mins Rust	Solve
What does the following Rust code print?
	Medium Passed Function Closures	2 mins Rust	Solve
Review the following code and pick the correct statements: A: The code prints 1223 B: The code prints 1111 C: The code prints 1234 D: The callPassedFunction(passedFunction) on line 7 makes a copy of passedFunction to become the argument of callPassedFunction. The copy gets executed and the x of copy becomes 2, but the original closure still holds a value of 1 for its captured x. E: The callPassedFunction(passedFunction) on line 7 makes a copy of passedFunction to become the argument of callPassedFunction. The copy gets executed and x of the copy and the origin both become 2.
	Easy Registration Queue Logic Queues	30 mins Coding	Solve
We want to register students for the next semester. All students have a receipt which shows the amount pending for the previous semester. A positive amount (or zero) represents that the student has paid extra fees, and a negative amount represents that they have pending fees to be paid. The students are in a queue for the registration. We want to arrange the students in a way such that the students who have a positive amount on the receipt get registered first as compared to the students who have a negative amount. We are given a queue in the form of an array containing the pending amount. For example, if the initial queue is [20, 70, -40, 30, -10], then the final queue will be [20, 70, 30, -40, -10]. Note that the sequence of students should not be changed while arranging them unless required to meet the condition. ⚠️⚠️⚠️ Note: - The first line of the input is the length of the array. The second line contains all the elements of the array. - The input is already parsed into an array of "strings" and passed to a function. You will need to convert string to integer/number type inside the function. - You need to "print" the final result (not return it) to pass the test cases. For the example discussed above, the input will be: 5 20 70 -40 30 -10 Your code needs to print the following to the standard output: 20 70 30 -40 -10
	Medium Visitors Count Strings Logic	30 mins Coding	Solve
A manager hires a staff member to keep a record of the number of men, women, and children visiting the museum daily. The staff will note W if any women visit, M for men, and C for children. You need to write code that takes the string that represents the visits and prints the count of men, woman and children. The sequencing should be in decreasing order. Example: Input: WWMMWWCCC Expected Output: 4W3C2M Explanation: ‘W’ has the highest count, then ‘C’, then ‘M’. ⚠️⚠️⚠️ Note: - The input is already parsed and passed to a function. - You need to "print" the final result (not return it) to pass the test cases. - If the input is- “MMW”, then the expected output is "2M1W" since there is no ‘C’. - If any of them have the same count, the output should follow this order - M, W, C.

	🧐 Question	🔧 Skill	💪 Difficulty	⌛ Time
	Join Handles Concurrency	Rust	Easy	2 mins	Solve
Review the following two Rust code snippets: Notice the handle.join().unwrap() line added in snippet two. Pick the correct statements: A: Snippet one prints 1 to 5 in the spawned thread and 1 to 3 in the main thread always. B: Snippet one prints 1 to 3 in the main thread but spawned thread might be closed before it prints all the numbers. C: Snippet two prints 1 to 5 in the spawned thread and 1 to 3 in the main thread always. D: Snippet two prints 1 to 3 in the main thread but the spawned thread might be closed before it prints all the numbers.
	Mutable Sample Structs Variables and Mutability	Rust	Medium	2 mins	Solve
What does the following Rust code print?
	Passed Function Closures	Rust	Medium	2 mins	Solve
Review the following code and pick the correct statements: A: The code prints 1223 B: The code prints 1111 C: The code prints 1234 D: The callPassedFunction(passedFunction) on line 7 makes a copy of passedFunction to become the argument of callPassedFunction. The copy gets executed and the x of copy becomes 2, but the original closure still holds a value of 1 for its captured x. E: The callPassedFunction(passedFunction) on line 7 makes a copy of passedFunction to become the argument of callPassedFunction. The copy gets executed and x of the copy and the origin both become 2.
	Registration Queue Logic Queues	Coding	Easy	30 mins	Solve
We want to register students for the next semester. All students have a receipt which shows the amount pending for the previous semester. A positive amount (or zero) represents that the student has paid extra fees, and a negative amount represents that they have pending fees to be paid. The students are in a queue for the registration. We want to arrange the students in a way such that the students who have a positive amount on the receipt get registered first as compared to the students who have a negative amount. We are given a queue in the form of an array containing the pending amount. For example, if the initial queue is [20, 70, -40, 30, -10], then the final queue will be [20, 70, 30, -40, -10]. Note that the sequence of students should not be changed while arranging them unless required to meet the condition. ⚠️⚠️⚠️ Note: - The first line of the input is the length of the array. The second line contains all the elements of the array. - The input is already parsed into an array of "strings" and passed to a function. You will need to convert string to integer/number type inside the function. - You need to "print" the final result (not return it) to pass the test cases. For the example discussed above, the input will be: 5 20 70 -40 30 -10 Your code needs to print the following to the standard output: 20 70 30 -40 -10
	Visitors Count Strings Logic	Coding	Medium	30 mins	Solve
A manager hires a staff member to keep a record of the number of men, women, and children visiting the museum daily. The staff will note W if any women visit, M for men, and C for children. You need to write code that takes the string that represents the visits and prints the count of men, woman and children. The sequencing should be in decreasing order. Example: Input: WWMMWWCCC Expected Output: 4W3C2M Explanation: ‘W’ has the highest count, then ‘C’, then ‘M’. ⚠️⚠️⚠️ Note: - The input is already parsed and passed to a function. - You need to "print" the final result (not return it) to pass the test cases. - If the input is- “MMW”, then the expected output is "2M1W" since there is no ‘C’. - If any of them have the same count, the output should follow this order - M, W, C.

Test candidates on core Rust Hiring Test topics

Standard Rust Operators and Syntax: This skill covers understanding and implementing standard operators and syntax in the Rust programming language. It is important to measure this skill as it forms the foundation of any Rust program, allowing developers to perform operations on variables, control flow, and manipulate data effectively.

Enums and Pattern Matching: Enums and pattern matching in Rust are powerful tools for managing complex data types and making decisions based on different cases. This skill should be measured to assess a candidate's ability to work with and manipulate data structures in Rust using enum types and pattern matching constructs.

Generic Structs: Generic structs allow developers to create reusable data structures that can work with different types. Measuring this skill helps assess a candidate's understanding of generic programming concepts in Rust and their ability to write flexible and efficient code using generic structs.

Smart Pointers: Smart pointers are data structures in Rust that provide additional functionality and safety guarantees compared to regular pointers. This skill should be measured to evaluate a candidate's proficiency in managing memory, avoiding memory leaks, and utilizing advanced memory management features with smart pointers.

Reference Counting: Reference counting in Rust involves managing the ownership and lifetime of shared data through reference counts. Assessing this skill helps determine a candidate's understanding of memory management in Rust and their ability to handle shared resource ownership with reference counting.

Thread Pools and Worker: Thread pools and workers are essential for concurrency and parallelism in Rust. Measuring this skill is important for evaluating a candidate's knowledge of Rust's concurrency mechanisms, their ability to leverage thread pools for efficient execution, and their understanding of creating worker threads for distributing workloads.

Ownership Concepts: Ownership is a fundamental concept in Rust that determines how memory is allocated, accessed, and cleaned up. Evaluating this skill helps assess a candidate's grasp of unique ownership, borrowing, and lifetimes in Rust, enabling them to write safe and efficient code.

Loops and Strings: Loops and strings are basic constructs used in almost every programming language, and Rust is no exception. Measuring this skill allows recruiters to assess a candidate's familiarity with loop structures and their ability to manipulate and process string data in Rust.

OOPS concepts: OOPS (Object-Oriented Programming Systems) concepts are relevant in many programming languages, including Rust. Assessing this skill helps recruiters determine a candidate's understanding of encapsulation, inheritance, polymorphism, and other OOP principles, and their ability to apply these concepts in Rust development.

Generic Iterators: Generic iterators are essential in Rust for performing various operations on collections of data. This skill should be measured to evaluate a candidate's proficiency in using and manipulating iterators in Rust, which aids in writing concise, expressive, and efficient code.

Concurrency: Concurrency is the ability of a program to execute multiple tasks simultaneously. Measuring this skill helps determine a candidate's understanding of Rust's concurrency mechanisms, such as threads, channels, and locks, and their ability to write concurrent code that is both correct and efficient.

Threads: Threads in Rust enable the execution of multiple independent tasks concurrently. Assessing this skill allows recruiters to evaluate a candidate's knowledge of thread-related concepts, their ability to create and manage threads in Rust, and their expertise in writing safe and efficient concurrent programs.

Get started for free

Preview questions

Make informed decisions with actionable reports and benchmarks

View sample scorecard

Screen candidates in 3 easy steps

Pick a test from over 500+ tests

The Adaface test library features 500+ tests to enable you to test candidates on all popular skills- everything from programming languages, software frameworks, devops, logical reasoning, abstract reasoning, critical thinking, fluid intelligence, content marketing, talent acquisition, customer service, accounting, product management, sales and more.

Invite your candidates with 2-clicks

Make informed hiring decisions

Get started for free

Preview questions

Try the most advanced candidate assessment platform

ChatGPT Protection

Non-googleable Questions

Web Proctoring

IP Proctoring

Webcam Proctoring

MCQ Questions

Coding Questions

Typing Questions

Personality Questions

Custom Questions

Ready-to-use Tests

Custom Tests

Custom Branding

Bulk Invites

Public Links

ATS Integrations

Multiple Question Sets

Custom API integrations

Role-based Access

Priority Support

GDPR Compliance

Pick a plan based on your hiring needs

The most advanced candidate screening platform.
14-day free trial. No credit card required.

From

$15

per month (paid annually)

View pricing plans

With Adaface, we were able to optimise our initial screening process by upwards of 75%, freeing up precious time for both hiring managers and our talent acquisition team alike!

Brandon Lee, Head of People, Love, Bonito

It's very easy to share assessments with candidates and for candidates to use. We get good feedback from candidates about completing the tests. Adaface are very responsive and friendly to deal with.

Kirsty Wood, Human Resources, WillyWeather

We were able to close 106 positions in a record time of 45 days! Adaface enables us to conduct aptitude and psychometric assessments seamlessly. My hiring managers have never been happier with the quality of candidates shortlisted.

Amit Kataria, CHRO, Hanu

We evaluated several of their competitors and found Adaface to be the most compelling. Great library of questions that are designed to test for fit rather than memorization of algorithms.

Swayam Narain, CTO, Affable