105+ Pseudocode Challenges for Algorithm Practice

Read the length and width of a rectangle and print its perimeter.

Read the side length of a square and print its area.

Read three integers and print their total.

Calculate the total laundry cost using the weight and the price per kilogram.

Calculate how much change a customer should get after paying for an order.

Return the lowest taxi fare from a list of ride prices.

Calculate the final phone bill using the base fee and the extra call charges.

Add up the prices in a grocery basket and return the final total.

Given delivery locations and road costs, return the minimum cost to reach the target location.

Check if there is enough coffee beans for brewing.

A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. In this task, you will write an algorithm that takes a number as input and determines whether it is a prime number by checking for divisibility across its potential factors.

Compare the mass of liquid in two cylindrical containers and print BALANCE or the mass difference.

Read one integer and print whether it is positive, negative, or zero.

Check whether a water bottle is empty based on the amount left inside.

Check whether there are still empty seats left on a bus.

Check whether a container needs a refill based on the current level and the minimum safe level.

Calculate the parking fee using a base price and an extra hourly charge.

Check whether a store is open based on the current hour and its opening hours.

Count how many tasks are already marked as finished in a task list.

Count how many tickets have already been sold in a list of ticket statuses.

Count how many seats are still empty in a row of seat statuses.

Count how many product quantities are below the restock threshold.

Read two positive integers and print their greatest common divisor using recursion.

Read a non-negative integer and print its factorial using recursion.

Read a non-negative integer and print the sum of its digits using recursion.

Organizing data in a specific order makes it much easier to search and manage. Your goal is to take a list of unsorted integers and arrange them in ascending order from smallest to largest. This is a great opportunity to practice nested loops and the logic behind basic sorting algorithms.

When dealing with sorted information, we can find specific items much faster than with a simple linear scan. In this challenge, you will implement an efficient search algorithm to find the position of a target number within a sorted list using a divide-and-conquer approach.

Finding the largest number in a collection is a common task in data processing. You will be provided with a list of numbers, and you need to determine which one has the highest value. This challenge requires you to iterate through an array and use comparison logic to keep track of the maximum value found so far.

Read three integers and print the smallest value.

Read two integers and print the larger value.

Return the longest call duration from a list of call times.

Return the highest score from a list of test results.

Return the highest temperature from a list of daily readings.

Given a list of busy time blocks, find the earliest time a new meeting can fit.