# This Python Algorithms Online Test Separates Good From Bad Hires

##### Check our public questions below

Solve questions to get feedback or
take a practice test and get a free certificate.

##### Screen with work-sample questions

Work-samples are the best predictor of work performance. 8,000+ companies use TestDome premium questions.

The Python Algorithms online test assesses candidates' algorithmic-thinking skills and their ability to implement algorithms using Python.

It's an ideal test for pre-employment screening. A good developer will be able to design and implement algorithms that are both correct and efficient. Computational complexity is important not only when scaling applications but when creating responsive, maintainable, and efficient code.

This online test requires candidates to analyze or design an algorithm using Python as the programming language.

#### Sample public questions

Binary search tree (BST) is a binary tree where the value of each node is larger or equal to the values in all the nodes in that node's left subtree and is smaller than the values in all the nodes in that node's right subtree.

Write a function that, efficiently with respect to time used, checks if a given binary search tree contains a given value.

For example, for the following tree:

• n1 (Value: 1, Left: null, Right: null)
• n2 (Value: 2, Left: n1, Right: n3)
• n3 (Value: 3, Left: null, Right: null)

Call to contains(n2, 3) should return True since a tree with root at n2 contains number 3.

Python
Algorithmic Thinking
Recursion
Tree
Easy
15 min
code
Public

A playlist is considered a repeating playlist if any of the songs contain a reference to a previous song in the playlist. Otherwise, the playlist will end with the last song which points to None.

Implement a function is_repeating_playlist that, efficiently with respect to time used, returns true if a playlist is repeating or false if it is not.

For example, the following code prints "True" as both songs point to each other.

``````first = Song("Hello")
second = Song("Eye of the tiger")

first.next_song(second)
second.next_song(first)

print(first.is_repeating_playlist())``````
Python
Algorithmic Thinking
Set
Easy
15 min
code
Public

#### For jobseekers: get certified

Earn a free certificate by achieving top 25% on the Python Algorithms test with public questions.

Peter Gibbons

Java and SQL

TestDome
Certificate

#### Skills and topics tested

• Python
• Algorithmic Thinking
• Queue
• Dictionary
• Sorting
• Set
• Lists
• Tree
• Graphs

#### For job roles

• Back-End Developer
• Data Analyst
• Python Developer
• Web Developer

## Solve all your skill testing needs

From web development and database administration to project management and customer support. See all pre-made tests.

###### Multi-skills Test

Mix questions for different skills or even custom questions in one test.

1
2
3
4