https://github.com/daniil-tiunchyk/leetcode-solutions-archive
This repository serves as a comprehensive collection of my solutions to LeetCode coding challenges.
https://github.com/daniil-tiunchyk/leetcode-solutions-archive
java leetcode
Last synced: 7 months ago
JSON representation
This repository serves as a comprehensive collection of my solutions to LeetCode coding challenges.
- Host: GitHub
- URL: https://github.com/daniil-tiunchyk/leetcode-solutions-archive
- Owner: Daniil-Tiunchyk
- License: mit
- Created: 2023-10-20T00:33:23.000Z (about 2 years ago)
- Default Branch: main
- Last Pushed: 2024-02-13T19:17:43.000Z (over 1 year ago)
- Last Synced: 2025-02-14T12:41:43.242Z (8 months ago)
- Topics: java, leetcode
- Language: Java
- Homepage: https://leetcode.com/Daniil-Tsiunchyk/
- Size: 56.6 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# LeetCode-Solutions-Archive
Welcome to my LeetCode Solutions Archive! This repository is a comprehensive collection of my solutions to various LeetCode coding challenges.
Below is a list of the tasks I've solved, along with detailed explanations for select tasks.
## Solved Tasks
| № | Name | Difficulty | Detailed Explanations |
|----|--------------------------------------------------------------|------------|----------------------------------------------------------------------------------------------------------------------|
| 1 | [Two Sum](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_1.java) |Easy| - |
| 9 | [Palindrome Number](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_9.java) |Easy| - |
| 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/) |
| 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/) |
| 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/) |
| 70 | [Climbing Stairs](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_70.java) |Easy| - |
| 150 | [Evaluate Reverse Polish Notation](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_150.java) |Medium| -
| 198| [House Robber](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_198.java) |Medium| - |
| 231| [Power of Two](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_231.java) |Easy| - |
| 232| [Implement Queue using Stacks](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_232.java)|Easy| - |
| 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/)|
| 300| [Longest Increasing Subsequence](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_300.java)|Medium| - |
| 326| [Power of Three](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_326.java) |Easy| - |
| 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/) |
| 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/)|
| 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/) |
| 605| [Can Place Flowers](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_605.java) |Easy| - |
| 645| [Set Mismatch](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_645.java) |Easy| - |
| 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/)
| 872| [Leaf-Similar Trees](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_872.java) |Easy| - |
| 907| [Sum of Subarray Minimums](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_907.java)|Medium| - |
| 931| [Minimum Falling Path Sum](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_931.java)|Medium| - |
| 938| [Range Sum of BST](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_938.java) |Easy| - |
|1026| [Maximum Difference Between Node and Ancestor](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_1026.java)|Medium| - |
|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/) |
|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| - |
|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/)|
|1431| [Kids With the Greatest Number of Candies](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_1431.java)|Easy| - |
|1657| [Determine if Two Strings Are Close](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_1657.java)|Medium| - |
|1704| [Determine if String Halves Are Alike](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_1704.java)|Easy| - |
|2125| [Number of Laser Beams in a Bank](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_2125.java)|Medium| - |
|2108| [Find First Palindromic String in the Array](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_2108.java)|Easy| - |
|2225| [Find Players With Zero or One Losses](https://github.com/Daniil-Tsiunchyk/LeetCode-Solutions-Archive/tree/main/LeetCode/Problem_2225.java)|Medium| - |
|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| - |
|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| -