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
• Dominância de Pontos

---

Greedy

• Caching Offline
• Inclusão de Subintervalos
• Unconventional Pairs

---

Dynamic Programming

• Análise de Dados
• Decode Ways
• Delete and Earn
• Edit Distance
• Estouro
• Flowers
• Knapsack 0/1
• Longest Common Subsequence
• Longest Increasing Subsequence
• Longest Increasing Subsequence II
• Longest Palindromic Subsequence
• Maximum Subarray Sum
• Minimum Sum Path 2D
• Rod Cutting
• Subset Sum
• Vacations

---

Priority Queue

• Argus
• Breakdown Desastroso

---

BFS

• Conversor Fonético Genérico
• Knight Moves
• Sliding Puzzle

---

Queue / Stack

• O Problema dos Pacotes Viajantes