🐝 Beecrowd — Solutions

A personal archive of solutions to Beecrowd (formerly URI Online Judge) problems, organized by algorithms and data-structures topic. The goal is to practice and track progress in competitive-programming fundamentals.

Solutions are mostly in C/C++, with data structures implemented by hand (no built-in libraries) whenever the point is to understand the structure itself — for example, a binary search tree using pointers and manual allocation.

📚 Organization

Problems are grouped into folders by category:

Folder	Topic
1-Iniciante	Introductory problems
2-AD-HOC	Logic and uncategorized problems
3-Strings	String manipulation
4-Estruturas_e_bibliotecas	Stacks, queues, and data structures (e.g., parenthesis balancing, queue handling)
5-Matematica	Math problems
6-Paradigmas	Solving paradigms (e.g., greedy, divide and conquer)
7-grafos	Graphs and trees (e.g., binary search tree)
8-GeometriaComputacional	Computational geometry
9-SQL	SQL queries

Each file follows the pattern P-<number>-<name>.ext and includes, at the top, the number and title of the corresponding Beecrowd problem.

🎯 Why this repository

More than just collecting solutions, the topic-based split acts as a study map: each category gathers the fundamentals of one area (linear structures, graphs, geometry, strings, math) and makes explicit which concepts have already been practiced.

▶️ How to run a solution

# C++
g++ 4-Estruturas_e_bibliotecas/P-1068-balanco_de_parenteses_stack.cpp -o solution
./solution

# C
gcc 7-grafos/P-1195-ArvoreBuscaBinaria.cpp -o solution && ./solution

Most solutions read from standard input (stdin) following the format described in each problem statement.