🎓 Romanian Bacalaureat programming practice

Practice programming problems for the Romanian Bacalaureat exam, organized by topic.

86 problems available · Log in to track your progress

Digits

0 / 7

Alternating digit sum

Convert to base b

Count digit occurrences

Largest digit and its frequency

Smallest palindrome at least n

Remove a digit from a number

Count perfect-square digits

Expressions

0 / 6

Balanced brackets

Count operands and operators

Evaluate arithmetic expression

Minimum of a quadratic expression on an integer interval

Maximum parenthesis nesting depth

Evaluate postfix expression

Graphs

0 / 7

BFS shortest path length

Adjacency matrix from edge list

Is the graph complete?

Connected components

Count isolated vertices

Transpose of a directed graph

Subprograms

0 / 6

Remove vowels in place

Swap via pointers and sort

Max and number of occurrences via reference

Count occurrences of a digit

Number of divisors

Recursive digit sum and digital root

Strings & arrays

0 / 7

Longest run of identical characters

Sort: odd before even, each ascending

Palindrome ignoring spaces and case

Rotate array to the left by k

Second-largest distinct value

Backtracking

0 / 6

Binary strings without two adjacent 1s

k-combinations from {1..n}

Number of n-queens placements

Balanced parenthesizations of n pairs

Partitions into distinct summands

All permutations of 1..n

Recursion

0 / 7

Recursive binary search

Recursive GCD of n numbers

Recursive array maximum

Recursive digit occurrences

Recursive mirror of a number

Recursive fast power

Recursive digit sum

Subsequences

0 / 6

Longest alternating-sign run

Count subarrays with sum K

Longest run of equal values

Longest strictly increasing run

Maximum contiguous sum

Window of length L with maximum sum

Merging sorted arrays

0 / 7

Count matched elements between two sorted arrays

Intersection of two sorted arrays

Merge three sorted arrays

Merge two sorted arrays

Set difference of two sorted arrays

Symmetric difference of two sorted arrays

Union of two sorted arrays

Structs

0 / 6

Best student by average

Books published before year

Closest two points

Salaries grouped by department

Sort employees by salary

Top K students by average

Trees

0 / 7

Children of a node

Count leaves of a tree

Lowest common ancestor

Nodes at given depth

Path from node to root

Tree root from parent vector

Files

0 / 7

Sum of values in a CSV row

Words by frequency

Words of exact length k

Maximum and its position (read until EOF)

Statistics on a sequence of numbers

Text: lines, words, letters

Distinct values in a sequence

Lists, stacks & queues

0 / 6

Circular queue, final state

Evaluate a postfix expression with a stack

Reverse a singly linked list

Insert into a sorted linked list

Balanced parentheses with a stack

Stack of distinct values, printed top-down

Arrays & matrices

0 / 1

Snake-pattern matrix