{"id":25345495,"url":"https://github.com/daniil-tiunchyk/leetcode-solutions-archive","last_synced_at":"2025-04-08T16:14:34.243Z","repository":{"id":202270231,"uuid":"707460672","full_name":"Daniil-Tiunchyk/LeetCode-Solutions-Archive","owner":"Daniil-Tiunchyk","description":"This repository serves as a comprehensive collection of my solutions to LeetCode coding challenges.","archived":false,"fork":false,"pushed_at":"2024-02-13T19:17:43.000Z","size":58,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-14T12:41:43.242Z","etag":null,"topics":["java","leetcode"],"latest_commit_sha":null,"homepage":"https://leetcode.com/Daniil-Tsiunchyk/","language":"Java","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/Daniil-Tiunchyk.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}},"created_at":"2023-10-20T00:33:23.000Z","updated_at":"2024-01-09T08:25:39.000Z","dependencies_parsed_at":"2023-10-23T00:24:45.994Z","dependency_job_id":"4dfe1ba7-5802-4dca-965a-10b860e87b6a","html_url":"https://github.com/Daniil-Tiunchyk/LeetCode-Solutions-Archive","commit_stats":null,"previous_names":["daniil-tsiunchyk/leetcode-solutions-archive","daniil-tiunchyk/leetcode-solutions-archive"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Daniil-Tiunchyk%2FLeetCode-Solutions-Archive","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Daniil-Tiunchyk%2FLeetCode-Solutions-Archive/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Daniil-Tiunchyk%2FLeetCode-Solutions-Archive/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Daniil-Tiunchyk%2FLeetCode-Solutions-Archive/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Daniil-Tiunchyk","download_url":"https://codeload.github.com/Daniil-Tiunchyk/LeetCode-Solutions-Archive/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247878019,"owners_count":21011158,"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":["java","leetcode"],"created_at":"2025-02-14T12:35:26.881Z","updated_at":"2025-04-08T16:14:34.220Z","avatar_url":"https://github.com/Daniil-Tiunchyk.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode-Solutions-Archive\n\nWelcome to my LeetCode Solutions Archive! This repository is a comprehensive collection of my solutions to various LeetCode coding challenges. \nBelow is a list of the tasks I've solved, along with detailed explanations for select tasks.\n\n## Solved Tasks\n\n| №  | Name                                                         | Difficulty | Detailed Explanations                                                                                               |\n|----|--------------------------------------------------------------|------------|----------------------------------------------------------------------------------------------------------------------|\n| 1  | [Two Sum](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_1.java)                   |Easy| -                                                                                                                    |\n| 9  | [Palindrome Number](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_9.java)          |Easy| -                                                                                                                    |\n| 12 | [Integer to Roman](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_12.java)         |Medium| [LeetCode Discussion](https://leetcode.com/discuss/topic/4192765/efficient-integer-to-roman-numeral-conversion-algorithm-in-java/)            |\n| 13 | [Roman to Integer](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_13.java)         |Easy| [LeetCode Discussion](https://leetcode.com/discuss/topic/4189498/efficient-roman-to-integer-conversion-algorithm-in-java/)            |\n| 69 | [Sqrt(x)](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_69.java)               |Easy| [LeetCode Discussion](https://leetcode.com/problems/sqrtx/solutions/4615741/newton-raphson-method/)                       |\n| 70 | [Climbing Stairs](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_70.java)        |Easy| -                                                                                                                    |\n| 150 | [Evaluate Reverse Polish Notation](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_150.java)        |Medium| -  \n| 198| [House Robber](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_198.java)          |Medium| -                                                                                                                    |\n| 231| [Power of Two](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_231.java)          |Easy| -                                                                                                                    |\n| 232| [Implement Queue using Stacks](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_232.java)|Easy| -    |\n| 273| [Integer to English Words](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_273.java)|Hard| [LeetCode Discussion](https://leetcode.com/problems/integer-to-english-words/solutions/4197447/a-three-digit-group-approach-in-java/)|\n| 300| [Longest Increasing Subsequence](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_300.java)|Medium| -                                                                                                                    |\n| 326| [Power of Three](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_326.java)        |Easy| -                                                                                                                    |\n| 342| [Power of Four](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_342.java)        |Easy| [LeetCode Discussion](https://leetcode.com/problems/power-of-four/solutions/4197543/logarithmic-approach-in-java/)           |\n| 380| [Insert Delete GetRandom O(1)](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_380.java)|Medium| [LeetCode Discussion](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/solutions/4557838/beautiful-java-solution/)|\n| 455| [Assign Cookies](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_455.java)      |Easy| [LeetCode Discussion](https://leetcode.com/problems/assign-cookies/solutions/4489190/an-efficient-greedy-algorithm-java/)  |\n| 605| [Can Place Flowers](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_605.java)    |Easy| -                                                                                                                    |\n| 645| [Set Mismatch](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_645.java)       |Easy| -                                                                                                                    |\n| 739| [Daily Temperatures](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_739.java)       |Medium| [LeetCode Discussion](https://leetcode.com/problems/daily-temperatures/solutions/4654150/stack-based-approach/)  \n| 872| [Leaf-Similar Trees](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_872.java)  |Easy| -                                                                                                                    |\n| 907| [Sum of Subarray Minimums](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_907.java)|Medium| -                                                                                                                    |\n| 931| [Minimum Falling Path Sum](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_931.java)|Medium| -                                                                                                                    |\n| 938| [Range Sum of BST](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_938.java)   |Easy| -                                                                                                                    |\n|1026| [Maximum Difference Between Node and Ancestor](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_1026.java)|Medium| -                                                                                                                    |\n|1207| [Unique Number of Occurrences](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_1207.java)|Easy| [LeetCode Discussion](https://leetcode.com/problems/unique-number-of-occurrences/solutions/4581210/optimal-java-solution/)   |\n|1239| [Maximum Length of a Concatenated String with Unique Characters](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_1239.java)|Medium| -                                                                                                           |\n|1347| [Minimum Number of Steps to Make Two Strings Anagram](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_1347.java)|Medium| [LeetCode Discussion](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/solutions/4557838/beautiful-java-solution/)|\n|1431| [Kids With the Greatest Number of Candies](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_1431.java)|Easy| -                                                                                                           |\n|1657| [Determine if Two Strings Are Close](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_1657.java)|Medium| -                                                                                                           |\n|1704| [Determine if String Halves Are Alike](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_1704.java)|Easy| -                                                                                                           |\n|2125| [Number of Laser Beams in a Bank](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_2125.java)|Medium| -                                                                                                           |\n|2108| [Find First Palindromic String in the Array](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_2108.java)|Easy| -  |\n|2225| [Find Players With Zero or One Losses](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_2225.java)|Medium| -                                                                                                           |\n|2385| [Amount of Time for Binary Tree to Be Infected](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_2385.java)|Medium| -                                                                                                           |\n|2610| [Convert an Array Into a 2D Array With Conditions](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_2610.java)|Medium| -                                                                                                      \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdaniil-tiunchyk%2Fleetcode-solutions-archive","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdaniil-tiunchyk%2Fleetcode-solutions-archive","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdaniil-tiunchyk%2Fleetcode-solutions-archive/lists"}