{"id":24185405,"url":"https://github.com/tadod12/leetdaily","last_synced_at":"2026-01-04T14:05:48.366Z","repository":{"id":260659227,"uuid":"881981502","full_name":"tadod12/leetdaily","owner":"tadod12","description":"Daily solving Leetcode problems and tracking progress ","archived":false,"fork":false,"pushed_at":"2025-03-01T01:07:07.000Z","size":822,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-01T02:19:47.695Z","etag":null,"topics":["daily","leetcode","python"],"latest_commit_sha":null,"homepage":"https://leetcode.com/u/tadod/","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/tadod12.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}},"created_at":"2024-11-01T16:17:35.000Z","updated_at":"2025-03-01T01:07:10.000Z","dependencies_parsed_at":"2024-11-01T17:23:25.754Z","dependency_job_id":"3de396e3-e32f-406c-aed1-b54807b70152","html_url":"https://github.com/tadod12/leetdaily","commit_stats":null,"previous_names":["dodat-12/leetdaily","tadod12/leetdaily"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tadod12%2Fleetdaily","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tadod12%2Fleetdaily/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tadod12%2Fleetdaily/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tadod12%2Fleetdaily/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tadod12","download_url":"https://codeload.github.com/tadod12/leetdaily/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241587788,"owners_count":19986628,"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","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":["daily","leetcode","python"],"created_at":"2025-01-13T11:21:41.947Z","updated_at":"2026-01-04T14:05:48.360Z","avatar_url":"https://github.com/tadod12.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cdiv align=\"center\"\u003e\n\n[![CI](https://github.com/fastify/fastify/workflows/ci/badge.svg)](https://github.com/fastify/fastify/actions/workflows/ci.yml)\n[![py-standard-style](https://img.shields.io/badge/code%20style-standard-brightgreen.svg?style=flat)](https://standardjs.com/)\n[![License: MIT](https://cdn.prod.website-files.com/5e0f1144930a8bc8aace526c/65dd9eb5aaca434fac4f1c34_License-MIT-blue.svg)](/LICENSE)\n[![Deps](https://cdn.prod.website-files.com/5e0f1144930a8bc8aace526c/65dd9eb5aaca434fac4f1c9e_Deps-Up--to--date-brightgreen.svg)]()\n\n\u003c/div\u003e\n\n\u003cdiv align=\"center\"\u003e\n\n# Daily solving LeetCode problems\n\n\u003c/div\u003e\n\n\u003csmall\u003eLast Updated: 08:23:55 04-01-2026\u003c/small\u003e\n\n### Ranking: 1006899\n\n### Progress: 144/3797\n\n| Difficulty | Solved | Total |\n|------------|--------|-------|\n| Easy | 100 | 920 |\n| Medium | 43 | 1980 |\n| Hard | 1 | 897 |\n\n## Badges\n\n\u003cimg src=\"https://assets.leetcode.com/static_assets/marketing/2024-50-lg.png\" style=\"width: 100px;\" title=\"50 Days Badge 2024\" /\u003e\u003cimg src=\"https://assets.leetcode.com/static_assets/others/Top_SQL_50.png\" style=\"width: 100px;\" title=\"Top SQL 50\" /\u003e\n\n## Problems solved\n\n| Problem ID | Problem Name | Topic | Solution |\n|------------|--------------|-------|------|\n| 24 | [Swap Nodes In Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | LinkedList | [Solution](./solutions/LinkedList/24_swap_nodes_in_pairs.py) |\n| 26 | [Remove Duplicates From Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | TwoPointers | [Solution](./solutions/TwoPointers/26_remove_duplicates_from_sorted_array.py) |\n| 27 | [Remove Element](https://leetcode.com/problems/remove-element) | TwoPointers | [Solution](./solutions/TwoPointers/27_remove_element.py) |\n| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | BinarySearch | [Solution](./solutions/BinarySearch/35_search_insert_position.py) |\n| 46 | [Permutations](https://leetcode.com/problems/permutations) | Backtracking | [Solution](./solutions/Backtracking/46_permutations.py) |\n| 47 | [Permutations Ii](https://leetcode.com/problems/permutations-ii) | Backtracking | [Solution](./solutions/Backtracking/47_permutations_ii.py) |\n| 50 | [Pow X N](https://leetcode.com/problems/pow-x-n) | Recursion | [Solution](./solutions/Recursion/50_pow_x_n.py) |\n| 69 | [Sqrt X](https://leetcode.com/problems/sqrt-x) | BinarySearch | [Solution](./solutions/BinarySearch/69_sqrt_x.py) |\n| 77 | [Combinations](https://leetcode.com/problems/combinations) | Backtracking | [Solution](./solutions/Backtracking/77_combinations.py) |\n| 78 | [Subsets](https://leetcode.com/problems/subsets) | Backtracking | [Solution](./solutions/Backtracking/78_subsets.py) |\n| 79 | [Word Search](https://leetcode.com/problems/word-search) | Backtracking | [Solution](./solutions/Backtracking/79_word_search.py) |\n| 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array) | TwoPointers | [Solution](./solutions/TwoPointers/88_merge_sorted_array.py) |\n| 89 | [Gray Code](https://leetcode.com/problems/gray-code) | Backtracking | [Solution](./solutions/Backtracking/89_gray_code.py) |\n| 92 | [Reverse Linked List Ii](https://leetcode.com/problems/reverse-linked-list-ii) | LinkedList | [Solution](./solutions/LinkedList/92_reverse_linked_list_ii.py) |\n| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | TwoPointers | [Solution](./solutions/TwoPointers/125_valid_palindrome.py) |\n| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | TwoPointers | [Solution](./solutions/TwoPointers/141_linked_list_cycle.py) |\n| 142 | [Linked List Cycle Ii](https://leetcode.com/problems/linked-list-cycle-ii) | TwoPointers | [Solution](./solutions/TwoPointers/142_linked_list_cycle_ii.py) |\n| 143 | [Reorder List](https://leetcode.com/problems/reorder-list) | TwoPointers | [Solution](./solutions/TwoPointers/143_reorder_list.py) |\n| 160 | [Intersection Of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | TwoPointers | [Solution](./solutions/TwoPointers/160_intersection_of_two_linked_lists.py) |\n| 191 | [Number Of 1 Bits](https://leetcode.com/problems/number-of-1-bits) | DivideAndConquer | [Solution](./solutions/DivideAndConquer/191_number_of_1_bits.py) |\n| 202 | [Happy Number](https://leetcode.com/problems/happy-number) | TwoPointers | [Solution](./solutions/TwoPointers/202_happy_number.py) |\n| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | LinkedList | [Solution](./solutions/LinkedList/206_reverse_linked_list.py) |\n| 215 | [Kth Largest Element In An Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | DivideAndConquer | [Solution](./solutions/DivideAndConquer/215_kth_largest_element_in_an_array.py) |\n| 231 | [Power Of Two](https://leetcode.com/problems/power-of-two) | Recursion | [Solution](./solutions/Recursion/231_power_of_two.py) |\n| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list) | TwoPointers | [Solution](./solutions/TwoPointers/234_palindrome_linked_list.py) |\n| 268 | [Missing Number](https://leetcode.com/problems/missing-number) | BinarySearch | [Solution](./solutions/BinarySearch/268_missing_number.py) |\n| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version) | BinarySearch | [Solution](./solutions/BinarySearch/278_first_bad_version.py) |\n| 326 | [Power Of Three](https://leetcode.com/problems/power-of-three) | Recursion | [Solution](./solutions/Recursion/326_power_of_three.py) |\n| 342 | [Power Of Four](https://leetcode.com/problems/power-of-four) | Recursion | [Solution](./solutions/Recursion/342_power_of_four.py) |\n| 344 | [Reverse String](https://leetcode.com/problems/reverse-string) | TwoPointers | [Solution](./solutions/TwoPointers/344_reverse_string.py) |\n| 345 | [Reverse Vowels Of A String](https://leetcode.com/problems/reverse-vowels-of-a-string) | TwoPointers | [Solution](./solutions/TwoPointers/345_reverse_vowels_of_a_string.py) |\n| 349 | [Intersection Of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays) | TwoPointers | [Solution](./solutions/TwoPointers/349_intersection_of_two_arrays.py) |\n| 350 | [Intersection Of Two Arrays Ii](https://leetcode.com/problems/intersection-of-two-arrays-ii) | TwoPointers | [Solution](./solutions/TwoPointers/350_intersection_of_two_arrays_ii.py) |\n| 367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square) | BinarySearch | [Solution](./solutions/BinarySearch/367_valid_perfect_square.py) |\n| 455 | [Assign Cookies](https://leetcode.com/problems/assign-cookies) | TwoPointers | [Solution](./solutions/TwoPointers/455_assign_cookies.py) |\n| 496 | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | Stack | [Solution](./solutions/Stack/496_next_greater_element_i.py) |\n| 509 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number) | Recursion | [Solution](./solutions/Recursion/509_fibonacci_number.py) |\n| 594 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | SlidingWindow | [Solution](./solutions/SlidingWindow/594_longest_harmonious_subsequence.py) |\n| 643 | [Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i) | SlidingWindow | [Solution](./solutions/SlidingWindow/643_maximum_average_subarray_i.py) |\n| 739 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures) | Stack | [Solution](./solutions/Stack/739_daily_temperatures.py) |\n| 876 | [Middle Of The Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | TwoPointers | [Solution](./solutions/TwoPointers/876_middle_of_the_linked_list.py) |\n| 1422 | [Maximum Score After Splitting A String](https://leetcode.com/problems/maximum-score-after-splitting-a-string) | PrefixSum | [Solution](./solutions/PrefixSum/1422_maximum_score_after_splitting_a_string.py) |\n| 1480 | [Running Sum Of 1D Array](https://leetcode.com/problems/running-sum-of-1d-array) | PrefixSum | [Solution](./solutions/PrefixSum/1480_running_sum_of_1d_array.py) |\n| 1763 | [Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring) | DivideAndConquer | [Solution](./solutions/DivideAndConquer/1763_longest_nice_substring.py) |\n| 1863 | [Sum Of All Subset Xor Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals) | Backtracking | [Solution](./solutions/Backtracking/1863_sum_of_all_subset_xor_totals.py) |\n| 1984 | [Minimum Different Between Highest And Lowest Of K Scores](https://leetcode.com/problems/minimum-different-between-highest-and-lowest-of-k-scores) | SlidingWindow | [Solution](./solutions/SlidingWindow/1984_minimum_different_between_highest_and_lowest_of_k_scores.py) |\n| 1991 | [Find The Middle Index In Array](https://leetcode.com/problems/find-the-middle-index-in-array) | PrefixSum | [Solution](./solutions/PrefixSum/1991_find_the_middle_index_in_array.py) |\n| 2485 | [Find The Pivot Integer](https://leetcode.com/problems/find-the-pivot-integer) | PrefixSum | [Solution](./solutions/PrefixSum/2485_find_the_pivot_integer.py) |\n| 2574 | [Left And Right Sum Differencies](https://leetcode.com/problems/left-and-right-sum-differencies) | PrefixSum | [Solution](./solutions/PrefixSum/2574_left_and_right_sum_differencies.py) |\n| 2932 | [Maximum Strong Pair Xor I](https://leetcode.com/problems/maximum-strong-pair-xor-i) | SlidingWindow | [Solution](./solutions/SlidingWindow/2932_maximum_strong_pair_xor_i.py) |\n| 3151 | [Special Array I](https://leetcode.com/problems/special-array-i) | SlidingWindow | [Solution](./solutions/SlidingWindow/3151_special_array_i.py) |\n| 3304 | [Find The Kth Character In String Game I](https://leetcode.com/problems/find-the-kth-character-in-string-game-i) | Recursion | [Solution](./solutions/Recursion/3304_find_the_kth_character_in_string_game_i.py) |\n| 3318 | [Find X Sum Of All K Long Subarrays I](https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i) | SlidingWindow | [Solution](./solutions/SlidingWindow/3318_find_x_sum_of_all_k_long_subarrays_i.py) |\n| 3354 | [Make Array Elements Equal To Zero](https://leetcode.com/problems/make-array-elements-equal-to-zero) | PrefixSum | [Solution](./solutions/PrefixSum/3354_make_array_elements_equal_to_zero.py) |\n| 3364 | [Minimum Positive Sum](https://leetcode.com/problems/minimum-positive-sum) | SlidingWindow | [Solution](./solutions/SlidingWindow/3364_minimum_positive_sum.py) |\n| 3411 | [Maximum Subarray With Equal Products](https://leetcode.com/problems/maximum-subarray-with-equal-products) | SlidingWindow | [Solution](./solutions/SlidingWindow/3411_maximum_subarray_with_equal_products.py) |\n| 3427 | [Sum Of Variable Length Subarrays](https://leetcode.com/problems/sum-of-variable-length-subarrays) | PrefixSum | [Solution](./solutions/PrefixSum/3427_sum_of_variable_length_subarrays.py) |\n| 3432 | [Count Partitions With Even Sum Difference](https://leetcode.com/problems/count-partitions-with-even-sum-difference) | PrefixSum | [Solution](./solutions/PrefixSum/3432_count_partitions_with_even_sum_difference.py) |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftadod12%2Fleetdaily","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftadod12%2Fleetdaily","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftadod12%2Fleetdaily/lists"}