200 Problems10 Tracks1,370+ Tests

Python Algorithm Problem Catalog

Curated Python interview problems across 10 engineering tracks. Write, execute, and verify your solutions directly in the browser with automated test suites.

Easy
62
Medium
89
Hard
49
Showing 200 of 200 problems
✓IDProblemTopicDifficultyTestsAction
K01
packages_above_average(weights: list[int]) -> int
Arrays & HashingEasy12 testsSolve
K02
word_masker(sentence: str) -> str
Arrays & HashingEasy12 testsSolve
K04
missing_product_codes(n: int, scanned: list[int]) -> list[int]
Arrays & HashingEasy12 testsSolve
K06
compress_logs(s: str) -> str
Arrays & HashingEasy12 testsSolve
K08
letter_grades(scores: list[int]) -> list[str]
Arrays & HashingEasy11 testsSolve
O05
crack_caesar_cipher(ciphertext: str, dictionary: list[str]) -> str
Arrays & HashingMedium12 testsSolve
O11
zero_sum_subarrays(nums: list[int]) -> int
Arrays & HashingMedium7 testsSolve
O12
product_except_self(nums: list[int]) -> list[int]
Arrays & HashingMedium7 testsSolve
O13
max_profit(prices: list[int]) -> int
Arrays & HashingEasy7 testsSolve
O14
find_missing_and_repeated(nums: list[int]) -> list[int]
Arrays & HashingMedium6 testsSolve
O15
group_anagrams(words: list[str]) -> list[list[str]]
Arrays & HashingMedium6 testsSolve
O16
spiral_order(matrix: list[list[int]]) -> list[int]
Arrays & HashingMedium11 testsSolve
O17
diagonal_difference(matrix: list[list[int]]) -> int
Arrays & HashingEasy6 testsSolve
O18
move_zeroes(nums: list[int]) -> list[int]
Arrays & HashingEasy7 testsSolve
Z11
first_missing_positive(nums: list[int]) -> int
Arrays & HashingHard8 testsSolve
Z12
longest_consecutive_sequence(nums: list[int]) -> int
Arrays & HashingMedium7 testsSolve
Z13
majority_elements(nums: list[int]) -> list[int]
Arrays & HashingHard7 testsSolve
Z14
top_k_frequent(nums: list[int], k: int) -> list[int]
Arrays & HashingMedium6 testsSolve
Z15
palindrome_pairs(words: list[str]) -> list[list[int]]
Arrays & HashingHard6 testsSolve
Z16
subarray_product_less_than_k(nums: list[int], k: int) -> int
Arrays & HashingHard7 testsSolve
K03
max_adjacent_temp_difference(temperatures: list[int]) -> int
Two Pointers & WindowEasy12 testsSolve
K10
longest_consecutive_ones(packets: list[int]) -> int
Two Pointers & WindowEasy12 testsSolve
K11
is_palindrome(s: str) -> bool
Two Pointers & WindowEasy8 testsSolve
K12
two_sum_sorted(nums: list[int], target: int) -> list[int]
Two Pointers & WindowEasy6 testsSolve

Frequently Asked Questions

Can I run catalog questions directly in the browser?

Yes. Your Python code runs instantly in your browser and is verified against edge and hidden test suites.

Which topics and levels are covered?

Covering Arrays, Two Pointers, Trees, Graphs, Dynamic Programming, and Concurrency across 10 modules with 62 Easy, 89 Medium, and 49 Hard problems.

How can I access free questions?

Each module contains free problems you can solve right away without registration. Use the 'Access: Free' filter to view them.