Can you give examples of algorithmic problems that differ in complexity level?

Examples of algorithmic problems of various difficulty levels:

For junior:

• Finding the maximum element in a list.
• Checking if a string is a palindrome.
• Bubble sort of an array.

For middle:

• Finding the shortest path in a graph (e.g., Dijkstra's algorithm).
• Implementing a balanced tree (e.g., AVL or red-black tree).
• Tasks on dynamic programming, such as the knapsack problem.

This approach helps assess basic skills and the ability to work with more complex structures and algorithms.