{"id":39158882,"url":"https://github.com/emicy963/algorithms-and-data-structure","last_synced_at":"2026-01-17T22:01:00.567Z","repository":{"id":331519737,"uuid":"971611520","full_name":"Emicy963/Algorithms-and-Data-Structure","owner":"Emicy963","description":"Este repositório documenta minha jornada de 55 dias no bootcamp de Estruturas de Dados e Algoritmos. Como desenvolvedor Backend Python/Django em transição para Engenharia de IA, este desafio é fundamental para fortalecer as bases que sustentam sistemas inteligentes e escaláveis.","archived":false,"fork":false,"pushed_at":"2026-01-09T23:34:11.000Z","size":42,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2026-01-10T21:35:13.671Z","etag":null,"topics":["100daysofcode","algorithms-and-data-structures","machine-learning","python"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Emicy963.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2025-04-23T19:35:09.000Z","updated_at":"2026-01-09T23:34:15.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/Emicy963/Algorithms-and-Data-Structure","commit_stats":null,"previous_names":["emicy963/algorithms-and-data-structure"],"tags_count":null,"template":false,"template_full_name":null,"purl":"pkg:github/Emicy963/Algorithms-and-Data-Structure","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Emicy963%2FAlgorithms-and-Data-Structure","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Emicy963%2FAlgorithms-and-Data-Structure/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Emicy963%2FAlgorithms-and-Data-Structure/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Emicy963%2FAlgorithms-and-Data-Structure/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Emicy963","download_url":"https://codeload.github.com/Emicy963/Algorithms-and-Data-Structure/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Emicy963%2FAlgorithms-and-Data-Structure/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28519276,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-17T18:55:29.170Z","status":"ssl_error","status_checked_at":"2026-01-17T18:55:03.375Z","response_time":85,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["100daysofcode","algorithms-and-data-structures","machine-learning","python"],"created_at":"2026-01-17T22:00:59.795Z","updated_at":"2026-01-17T22:01:00.557Z","avatar_url":"https://github.com/Emicy963.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cp align=\"center\"\u003e\n  \u003cimg src=\"https://img.shields.io/badge/🚀-55%20Days%20DSA%20Bootcamp-blueviolet?style=for-the-badge\" alt=\"Challenge Badge\"/\u003e\n\u003c/p\u003e\n\n\u003ch1 align=\"center\"\u003e📊 Algorithm \u0026 Data Structures\u003c/h1\u003e\n\n\u003cp align=\"center\"\u003e\n  \u003cstrong\u003eUma jornada de 55 dias dominando Estruturas de Dados e Algoritmos\u003c/strong\u003e\n\u003c/p\u003e\n\n\u003cp align=\"center\"\u003e\n  \u003ca href=\"https://github.com/Emicy963\"\u003e\n    \u003cimg src=\"https://img.shields.io/badge/GitHub-Emicy963-181717?style=flat-square\u0026logo=github\" alt=\"GitHub\"/\u003e\n  \u003c/a\u003e\n  \u003cimg src=\"https://img.shields.io/badge/Python-3.10+-3776AB?style=flat-square\u0026logo=python\u0026logoColor=white\" alt=\"Python\"/\u003e\n  \u003cimg src=\"https://img.shields.io/badge/Status-Em%20Progresso-yellow?style=flat-square\" alt=\"Status\"/\u003e\n  \u003cimg src=\"https://img.shields.io/badge/Dia-04%2F55-green?style=flat-square\" alt=\"Progress\"/\u003e\n\u003c/p\u003e\n\n---\n\n## 🎯 Sobre o Projeto\n\nEste repositório documenta minha jornada de **55 dias** no bootcamp de Estruturas de Dados e Algoritmos. Como desenvolvedor **Backend Python/Django** em transição para **Engenharia de IA**, este desafio é fundamental para fortalecer as bases que sustentam sistemas inteligentes e escaláveis.\n\n\u003e 💡 _\"Algoritmos são a linguagem secreta que separa bons desenvolvedores de desenvolvedores excepcionais.\"_\n\n---\n\n## 📚 Estrutura do Repositório\n\n```\n📁 Algorithm and Data Structured/\n├── 📁 docs/              # Documentação adicional\n├── 📁 src/               # Código fonte por dia\n│   ├── 📁 Day 01/        # Arrays \u0026 Big O\n│   ├── 📁 Day 02/        # Recursion\n│   └── ...\n├── 📄 .gitignore\n├── 📄 LICENSE\n└── 📄 README.md\n```\n\n---\n\n## 🗓️ Roadmap Completo - 55 Dias\n\n### 📦 Fase 1: Fundamentos (Day 1)\n\n| Dia | Tópico                            | Problemas                             | Status |\n| --- | --------------------------------- | ------------------------------------- | ------ |\n| 01  | [Arrays \u0026 Big O](./src/Day%2001/) | Sorted Squared Array, Monotonic Array | ✅     |\n\n---\n\n### 🔄 Fase 2: Recursion (Days 2-3)\n\n| Dia | Tópico    | Problemas                                | Status |\n| --- | --------- | ---------------------------------------- | ------ |\n| 02  | [Recursion](./src/Day%2002/) | K-th Symbol in Grammar, Josephus Problem | ✅     |\n| 03  | [Recursion](./src/Day%2003/) | Tower of Hanoi, Power Sum                | ✅     |\n\n---\n\n### 🔙 Fase 3: Backtracking (Days 4-8)\n\n| Dia | Tópico       | Problemas                              | Status |\n| --- | ------------ | -------------------------------------- | ------ |\n| 04  | [Backtracking](./src/Day%2004/) | Permutations, Permutations 2           | ✅    |\n| 05  | Backtracking | Subsets, Subsets 2                     | ⏳     |\n| 06  | Backtracking | Combinations, Combinations Sum 1       | ⏳     |\n| 07  | Backtracking | Combinations Sum 2, Combinations Sum 3 | ⏳     |\n| 08  | Backtracking | Sudoku Solver, N Queens                | ⏳     |\n\n---\n\n### 📈 Fase 4: Dynamic Programming (Days 9-18)\n\n| Dia | Tópico            | Problemas                                   | Status |\n| --- | ----------------- | ------------------------------------------- | ------ |\n| 09  | DP - Basics       | Fibonacci, Climbing Stairs                  | ⏳     |\n| 10  | DP - Stairs       | Min Cost Climbing Stairs, Tribonacci        | ⏳     |\n| 11  | DP - Knapsack     | 01 Knapsack, Unbounded Knapsack             | ⏳     |\n| 12  | DP - Subsets      | Target Sum, Partition Equal Subset Sum      | ⏳     |\n| 13  | DP - Strings      | LCS, Edit Distance                          | ⏳     |\n| 14  | DP - Sequences    | LIS, Max Length of Pair Chain, Russian Doll | ⏳     |\n| 15  | DP - Palindromes  | Palindromic Substrings, Longest Palindromic | ⏳     |\n| 16  | DP - Partitioning | Palindrome Partitioning 1 \u0026 2               | ⏳     |\n| 17  | DP - Advanced     | Word Break, Matrix Chain Multiplication     | ⏳     |\n| 18  | DP - Kadane's     | Max Subarray, Maximum Product Subarray      | ⏳     |\n\n---\n\n### 🎯 Fase 5: Greedy Algorithms (Days 19-23)\n\n| Dia | Tópico | Problemas                                      | Status |\n| --- | ------ | ---------------------------------------------- | ------ |\n| 19  | Greedy | Fractional Knapsack, Non-overlapping Intervals | ⏳     |\n| 20  | Greedy | Jump Game 1, Min Arrows to Burst Balloons      | ⏳     |\n| 21  | Greedy | Two City Scheduling, Boats to Save People      | ⏳     |\n| 22  | Greedy | Task Scheduler, Largest Number                 | ⏳     |\n| 23  | Greedy | Gas Stations, Jump Game 2                      | ⏳     |\n\n---\n\n### 🔤 Fase 6: Arrays, Hash Tables \u0026 Strings (Days 24-27)\n\n| Dia | Tópico      | Problemas                                | Status |\n| --- | ----------- | ---------------------------------------- | ------ |\n| 24  | Arrays      | Rotate Array, Container with Most Water  | ⏳     |\n| 25  | Hash Tables | Two Sum, Isomorphic Strings              | ⏳     |\n| 26  | Strings     | Non-Repeating Character, Palindrome      | ⏳     |\n| 27  | Strings     | Longest Unique Substring, Group Anagrams | ⏳     |\n\n---\n\n### 🔍 Fase 7: Searching \u0026 Sorting (Days 28-32)\n\n| Dia | Tópico    | Problemas                                        | Status |\n| --- | --------- | ------------------------------------------------ | ------ |\n| 28  | Searching | Binary Search, Search in Rotated Sorted Array    | ⏳     |\n| 29  | Searching | Find First and Last Position, Search in 2D Array | ⏳     |\n| 30  | Sorting   | Bubble Sort, Insertion Sort                      | ⏳     |\n| 31  | Sorting   | Selection Sort, Merge Sort                       | ⏳     |\n| 32  | Sorting   | Quick Sort, Radix Sort                           | ⏳     |\n\n---\n\n### 🔗 Fase 8: Linked Lists (Days 33-36)\n\n| Dia | Tópico              | Problemas                         | Status |\n| --- | ------------------- | --------------------------------- | ------ |\n| 33  | Singly Linked Lists | Construct SLL, Delete Duplicates  | ⏳     |\n| 34  | Singly Linked Lists | Reverse SLL, Cycle Detection      | ⏳     |\n| 35  | Singly Linked Lists | Find Duplicate, Add 2 Numbers     | ⏳     |\n| 36  | Doubly Linked Lists | DLL Remove/Insert, DLL Remove All | ⏳     |\n\n---\n\n### 📚 Fase 9: Stacks \u0026 Queues (Days 37-38)\n\n| Dia | Tópico | Problemas                                   | Status |\n| --- | ------ | ------------------------------------------- | ------ |\n| 37  | Stacks | Construct Stack, Reverse Polish Notation    | ⏳     |\n| 38  | Queues | Construct Queue, Implement Queue with Stack | ⏳     |\n\n---\n\n### 🌳 Fase 10: Binary Trees (Days 39-50)\n\n| Dia | Tópico          | Problemas                                      | Status |\n| --- | --------------- | ---------------------------------------------- | ------ |\n| 39  | Binary Trees    | Construct BST, Traversal Techniques            | ⏳     |\n| 40  | Traversal       | Pre-order \u0026 In-order Iterative                 | ⏳     |\n| 41  | Traversal       | Post-order Iterative, Path Sum 2               | ⏳     |\n| 42  | Construction    | Build Tree from Pre/In-order \u0026 In/Post-order   | ⏳     |\n| 43  | Level Order     | Level Order Traversal, Left/Right View         | ⏳     |\n| 44  | Level Order     | Level Order 2, ZigZag Traversal                | ⏳     |\n| 45  | Advanced        | Vertical Order Traversal, Sum Root to Leaf     | ⏳     |\n| 46  | Tree Operations | Invert Tree, Diameter of Tree                  | ⏳     |\n| 47  | BST             | Convert Sorted Array to BST, Validate BST      | ⏳     |\n| 48  | BST             | Lowest Common Ancestor BST, Unique BST 2       | ⏳     |\n| 49  | Binary Tree     | Lowest Common Ancestor BT, Unique BST 1        | ⏳     |\n| 50  | Serialization   | Serialize/Deserialize BT, N-ary Tree Traversal | ⏳     |\n\n---\n\n### 🏔️ Fase 11: Heaps (Day 51)\n\n| Dia | Tópico | Problemas                    | Status |\n| --- | ------ | ---------------------------- | ------ |\n| 51  | Heaps  | Max Heap, Min Priority Queue | ⏳     |\n\n---\n\n### 🕸️ Fase 12: Graphs (Days 52-55)\n\n| Dia | Tópico | Problemas                                       | Status |\n| --- | ------ | ----------------------------------------------- | ------ |\n| 52  | Graphs | BFS, DFS                                        | ⏳     |\n| 53  | Graphs | Connected Components, Topological Sort          | ⏳     |\n| 54  | Graphs | Number of Provinces, Find Path in Graph         | ⏳     |\n| 55  | Graphs | Number of Islands, Same Consecutive Differences | ⏳     |\n\n---\n\n## 📊 Legenda de Complexidade\n\n| Notação    | Nome         | Performance  |\n| ---------- | ------------ | ------------ |\n| O(1)       | Constante    | 🟢 Excelente |\n| O(log n)   | Logarítmica  | 🟢 Ótima     |\n| O(n)       | Linear       | 🟡 Boa       |\n| O(n log n) | Linearítmica | 🟡 Aceitável |\n| O(n²)      | Quadrática   | 🟠 Ruim      |\n| O(2ⁿ)      | Exponencial  | 🔴 Péssima   |\n\n---\n\n## 🚀 Como Usar\n\n```bash\n# Clone o repositório\ngit clone https://github.com/Emicy963/Algorithm-and-Data-Structured.git\n\n# Entre no diretório\ncd Algorithm-and-Data-Structured\n\n# Execute os exemplos de um dia específico\npython src/Day\\ 01/03_sorted_squared_array.py\n```\n\n---\n\n## 🛠️ Tecnologias\n\n- **Python 3.10+** - Linguagem principal\n- **Type Hints** - Para código mais legível\n- **Docstrings** - Documentação inline\n\n---\n\n## 📈 Acompanhe a Jornada\n\nEstou documentando este desafio diariamente no **LinkedIn**! Acompanhe os insights, dificuldades e aprendizados:\n\n\u003cp align=\"center\"\u003e\n  \u003ca href=\"https://linkedin.com/in/anderson-cafurica-\"\u003e\n    \u003cimg src=\"https://img.shields.io/badge/Seguir%20no-LinkedIn-0A66C2?style=for-the-badge\u0026logo=linkedin\" alt=\"LinkedIn\"/\u003e\n  \u003c/a\u003e\n\u003c/p\u003e\n\n---\n\n## 🤝 Contribuições\n\nEncontrou um erro ou tem uma solução mais elegante? Contribuições são bem-vindas!\n\n1. Fork o projeto\n2. Crie uma branch (`git checkout -b feature/nova-solucao`)\n3. Commit suas mudanças (`git commit -m 'Add: solução alternativa'`)\n4. Push para a branch (`git push origin feature/nova-solucao`)\n5. Abra um Pull Request\n\n---\n\n## 📝 Licença\n\nEste projeto está sob a licença MIT. Veja o arquivo [LICENSE](./LICENSE) para mais detalhes.\n\n---\n\n\u003cp align=\"center\"\u003e\n  \u003cstrong\u003eFeito com 💜 por \u003ca href=\"https://github.com/Emicy963\"\u003eAnderson Cafurica\u003c/a\u003e\u003c/strong\u003e\n\u003c/p\u003e\n\n\u003cp align=\"center\"\u003e\n  \u003csub\u003e⭐ Se este repositório te ajudou, considere dar uma estrela!\u003c/sub\u003e\n\u003c/p\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Femicy963%2Falgorithms-and-data-structure","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Femicy963%2Falgorithms-and-data-structure","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Femicy963%2Falgorithms-and-data-structure/lists"}