# Problemas para Competições: Arthur D'Olival (PIBITI)

Repositório com a formatação de problemas que exploram variadas técnicas de programação.

---

### Divide and Conquer

- [Bolhas](./bolhas/)
- [Dominância de Pontos](./dominancia-de-pontos/)

---

## Greedy

- [Caching Offline](./caching-offline)
- [Inclusão de Subintervalos](./inclusao-de-subintervalos)
- [Unconventional Pairs](./unconventional-pairs)

---

## Dynamic Programming

- [Análise de Dados](./analise-de-dados)
- [Decode Ways](./decode-ways)
- [Delete and Earn](./delete-and-earn)
- [Edit Distance](./edit-distance)
- [Estouro](./estouro)
- [Flowers](./flowers)
- [Knapsack 0/1](./knapsack-zero-one)
- [Longest Common Subsequence](./longest-common-subsequence)
- [Longest Increasing Subsequence](./longest-increasing-subsequence)
- [Longest Increasing Subsequence II](./longest-increasing-subsequence-II)
- [Longest Palindromic Subsequence](./longest-palindromic-subsequence)
- [Maximum Subarray Sum](./maximum-subarray-sum)
- [Minimum Sum Path 2D](./min-sum-path-2d)
- [Rod Cutting](./rod-cuttting)
- [Subset Sum](./subset-sum)
- [Vacations](./vacations)

---

## Priority Queue

- [Argus](./argus)
- [Breakdown Desastroso](./breakdown-desastroso)

---

## BFS

- [Conversor Fonético Genérico](./conversor-fonetico-generico)
- [Knight Moves](./knight-moves)
- [Sliding Puzzle](./sliding-puzzle)

---

## Queue / Stack

- [O Problema dos Pacotes Viajantes](./o-problema-dos-pacotes-viajantes)