{"id":19773510,"url":"https://github.com/biogui/guia-leetcode","last_synced_at":"2025-09-11T17:47:04.057Z","repository":{"id":46304650,"uuid":"348149250","full_name":"biogui/guia-leetcode","owner":"biogui","description":"[PT-BR] Guia de estudos voltados para o leetcode.com baseado na Curva de Esquecimento de Ebbinghaus","archived":false,"fork":false,"pushed_at":"2021-10-31T23:48:33.000Z","size":569,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-05-26T18:08:00.503Z","etag":null,"topics":["algorithms-and-data-structures","cpp","hacktoberfest","hacktoberfest2021"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/biogui.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2021-03-15T23:14:45.000Z","updated_at":"2024-11-21T18:56:38.000Z","dependencies_parsed_at":"2022-08-27T23:53:29.252Z","dependency_job_id":null,"html_url":"https://github.com/biogui/guia-leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/biogui/guia-leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/biogui%2Fguia-leetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/biogui%2Fguia-leetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/biogui%2Fguia-leetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/biogui%2Fguia-leetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/biogui","download_url":"https://codeload.github.com/biogui/guia-leetcode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/biogui%2Fguia-leetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":274681400,"owners_count":25330236,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-09-11T02:00:13.660Z","response_time":74,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["algorithms-and-data-structures","cpp","hacktoberfest","hacktoberfest2021"],"created_at":"2024-11-12T05:09:54.218Z","updated_at":"2025-09-11T17:47:04.008Z","avatar_url":"https://github.com/biogui.png","language":"C++","readme":"# Guia LeetCode - Curva de Esquecimento de Ebbinghaus\n\n### Dia 001: Warm up - Arrays:\n\n**Problemas**:\n\n- [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii)\n\n- [Move Zeroes](https://leetcode.com/problems/move-zeroes/)\n\n**Soluções**: \n\n- [ Dia 001 - Soluções](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_001_warmup_arrays)\n\n---\n\n### Dia 002: Warm up - Strings\n\n**Problemas**:\n\n- [Valid Anagram](https://leetcode.com/problems/valid-anagram/)\n\n- [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)\n\n**Soluções**: \n\n- [ Dia 002 - Soluções](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_002_warmup_strings)\n\n---\n\n### Dia 003: Warm up - Linked List\n\n**Problemas**:\n\n- [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)\n\n- [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)\n\n**Soluções**: \n\n- [ Dia 003 - Soluções](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_003_warmup_linked_list)\n\n---\n\n### Dia 004: Warm up - Trees\n\n**Problemas**:\n\n- [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)\n\n- [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)\n\n**Soluções**:\n\n- [ Dia 004 - Soluções](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_004_warmup_trees)\n\n---\n\n### Dia 005: Warm up - Graph\n\n**Problemas**:\n\n- [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)\n\n- [Employee Importance](https://leetcode.com/problems/employee-importance/)\n\n**Soluções**:\n\n- [ Dia 005 - Soluções](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_005_warmup_graph)\n\n---\n\n\n### Dia 006: Warm up - Hash\n\n**Problemas**:\n\n- [Sum of Unique Elements](https://leetcode.com/problems/sum-of-unique-elements/)\n\n- [Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number/)\n\n**Soluções**:\n\n- [ Dia 006 - Soluções](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_006_warmup_hash)\n\n---\n\n### Dia 007: Arrays #1\n\n**Problema**:\n\n- [Rotate Image](https://leetcode.com/problems/rotate-image/)\n\n**Solução**:\n\n- [ Dia 007 - Solução](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_007_arrays_1)\n\n---\n\n### Dia 008: Arrays #2\n\n**Problema**:\n\n- [3sum](https://leetcode.com/problems/3sum/)\n\n**Solução**:\n\n- [ Dia 008 - Solução](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_008_arrays_2)\n\n---\n\n### Dia 009: Arrays #3\n\n**Problema**:\n\n- [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)\n\n**Soluções**:\n\n- [ Dia 009 - Soluções](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_009_arrays_3)\n\n---\n\n### Dia 010: Arrays #4\n\n**Problema**:\n\n- [Tuple with Same Product](https://leetcode.com/problems/tuple-with-same-product/)\n\n**Solução**:\n\n- [ Dia 010 - Solução](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_010_arrays_4)\n\n---\n\n\n### Dia 011: Arrays #5\n\n**Problema**:\n\n- [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/)\n\n**Solução**:\n\n- [ Dia 011 - Solução](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_011_arrays_5)\n\n---\n\n### Dia 012: Strings #1\n\n**Problema**:\n\n- [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)\n\n**Solução**:\n\n- [ Dia 012 - Solução](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_012_strings_1)\n\n---\n\n### Dia 013: Strings #2\n\n**Problema**:\n\n- [Count and Say](https://leetcode.com/problems/count-and-say/)\n\n**Solução**:\n\n- [ Dia 013 - Solução](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_013_strings_2)\n\n---\n\n### Dia 014: Strings #3\n\n**Problema**:\n\n- [Find Kth Bit in Nth Binary String](https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/)\n\n**Solução**:\n\n- [ Dia 014 - Solução](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_014_strings_3)\n\n---\n\n### Dia 015: Strings #4\n\n**Problema**:\n\n- [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)\n\n**Solução**:\n\n- [ Dia 015 - Solução](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_015_strings_4)\n\n---\n\n### Dia 016: Strings #5\n\n**Problema**:\n\n- [Group Anagrams](https://leetcode.com/problems/group-anagrams/)\n\n**Solução**:\n\n- [ Dia 016 - Solução](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_016_strings_5)\n\n---\n\n### Dia 017: Linked List #1\n\n**Problema**:\n\n- [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)\n\n**Soluções**:\n\n- [ Dia 017 - Soluções](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_017_linked_list_1)\n\n\n---\n\n### Dia 018: Linked List #2\n\n**Problema**:\n\n- [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)\n\n**Solução**:\n\n- [ Dia 018 - Solução](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_018_linked_list_2)\n\n---\n\n### Dia 019: Linked List #3\n\n**Problema**:\n\n- [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)\n\n**Solução**:\n\n- [ Dia 019 - Solução](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_019_linked_list_3)\n\n---\n\n### Dia 020: Linked List #4\n\n**Problema**:\n\n- [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/)\n\n**Solução**:\n\n- [ Dia 020 - Solução](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_020_linked_list_4)\n\n---\n\n### Dia 021: Linked List #5\n\n**Problema**:\n\n- [Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/)\n\n**Solução**:\n\n- [ Dia 021 - Solução](https://github.com/biogui/guia-leetcode/tree/main/exercicios/dia_021_linked_list_5)","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbiogui%2Fguia-leetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbiogui%2Fguia-leetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbiogui%2Fguia-leetcode/lists"}