Python Algorithms and SQL Online Test

TestDome skill assessments are used by more than 6,000 companies and 450,000 individual test takers.

Jobseekers: Get a Certificate

Take a Practice Test

Companies: Try First, Pay Later

Sign Up To Use This Test

The Python and SQL online test assesses candidates' knowledge of programming in the Python language and their ability to use SQL.

It's an ideal test for pre-employment screening. A good Python developer needs to be able not only to solve problems using Python but also to write and analyze SQL queries to access a database.

This online test requires candidates to solve coding problems in Python and to write SQL queries that extract, combine, and manipulate data.

Recommended Job Roles
Back-End Developer
Data Analyst
Python Developer
SQL Developer
Web Developer
Sample Candidate Report

Sample Free Questions

Students

3min
  -  
Easy  
  -  
CODE

SQL Aggregation Select Public

Given the following data definition, write a query that returns the number of students whose first name is John. String comparisons should be case sensitive.

TABLE students
   id INTEGER PRIMARY KEY,
   firstName VARCHAR(30) NOT NULL,
   lastName VARCHAR(30) NOT NULL

Enrollment

5min
  -  
Easy  
  -  
CODE

SQL Conditions Update Public

A table containing the students enrolled in a yearly course has incorrect data in records with ids between 20 and 100 (inclusive).

TABLE enrollments
  id INTEGER NOT NULL PRIMARY KEY
  year INTEGER NOT NULL
  studentId INTEGER NOT NULL

Write a query that updates the field 'year' of every faulty record to 2015.

Binary Search Tree

15min
  -  
Easy  
  -  
CODE

Python Algorithmic thinking Recursion Tree Public

A three-node binary tree.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.

Use Free Questions On a Trial Plan

Premium Questions

The premium question library contains our unique, hand-crafted questions. We offer a refund if you find any of them answered online.

Questions
Roads, Ingredients, ATM Locations, Authors, Autocomplete, Ban Users, Bank Branches, Cheapest Product, Countries, Developers, Employee Manager, Hospital Patients, Index Performance, Menu Items, Merge Stock Index, Movies, Movies Live, Projects, Rectangles, Restaurant Menu, Retirees, Sales, SMS Messages, Student Activities, Tasks, Transactions, Youngest Child, Manager Sales, Delete Orders, Average Salary, Movie Genres, Auto Show, Poll, Book Sale, Moving Total, Unique Product, Internal Nodes, Paper Strip, Department Report, Veterinarian, Unique Numbers, Max Sum, Student Rankings, Welfare Organization, Student Max Score
Skills
SQL Conditions Views Subqueries Update Constraints Create table Database schema Select Create index Performance tuning Alter table Aggregation Ordering Bug fixing Left join Indexes Union Group by Insert Joins CTE Delete SQL CASE Python Algorithmic thinking Dictionary Sorting Set Lists Tree Queue
Score Distribution
# of candidates
0-33%
34-66%
67-100%
Score
Pricing For Premium Questions