Practice Tests

Empower yourself with our comprehensive practice tests designed to mirror the actual exam experience. These tests help gauge your preparedness, build confidence, and provide a realistic assessment of your strengths and areas for improvement. Refine time management and problem-solving skills as you tackle each question. Detailed performance feedback guides your study plan for a targeted and effective approach. Elevate your preparation and achieve your goals with purposeful practice.

Filters

View Reports

Maze

Desc: You are trapped in a maze, represented by a 2D grid of size N x M. Some cells are passable (denoted by 0), and some cells are blocked (denoted by 1). You start from the top-left corner of the maze and need to reach the bottom-right corner. However, you can only move right or down. Find the number of distinct paths from the top-left corner to the bottom-right corner of the maze. If there is no possible path, return 0. Input: A 2D grid maze of integers where: 1. 0 represents a passable cell. 2. 1 represents a blocked cell. Output: Return the total number of distinct paths from the top-left to the bottom-right of the grid.
Desc: You are trapped in a maze, represented by a 2D grid of size N x M. Some cells are passable (denoted by 0), and some cells are blocked (denoted by 1). You start from the top-left corner of the maze and need to reach the bottom-right corner. However, you can only move right or down. Find the number of distinct paths from the top-left corner to the bottom-right corner of the maze. If there is no possible path, return 0. Input: A 2D grid maze of integers where: 1. 0 represents a passable cell. 2. 1 represents a blocked cell. Output: Return the total number of distinct paths from the top-left to the bottom-right of the grid.

Kingdom

Desc: In the kingdom of Arlon, the defense ministry must protect the border from invading forces. The border is represented as a series of connected watchtowers, each with a certain number of soldiers. Some towers are stronger than others. Your job is to find the strongest contiguous segment of watchtowers in terms of total soldiers. Write a function that takes a list of integers representing the number of soldiers at each watchtower and returns the maximum number of soldiers in any contiguous subarray. Input: A list of integers representing the number of soldiers in each watchtower. Output: The maximum number of soldiers in any contiguous segment of watchtowers.
Desc: In the kingdom of Arlon, the defense ministry must protect the border from invading forces. The border is represented as a series of connected watchtowers, each with a certain number of soldiers. Some towers are stronger than others. Your job is to find the strongest contiguous segment of watchtowers in terms of total soldiers. Write a function that takes a list of integers representing the number of soldiers at each watchtower and returns the maximum number of soldiers in any contiguous subarray. Input: A list of integers representing the number of soldiers in each watchtower. Output: The maximum number of soldiers in any contiguous segment of watchtowers.