Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/heartsker/leetcode


https://github.com/heartsker/leetcode

algorithms hard leetcode leetcode-solutions leetcode-swift solutions

Last synced: about 1 month ago
JSON representation

Awesome Lists containing this project

README

        

# LeetCodeSolutions-Hard

LeetCode is a very popular resourse to upgrade your skill in solving algorithmic problems

And the most interesting ones are the hardest ones

You can find these problems [here](https://leetcode.com/problemset/algorithms/?difficulty=HARD&page=1)

---

In this repo you can find my solutions for LeetCode Problems

For your convenience, here is a table of contents:

- [4. Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)
- [Solution](https://github.com/heartsker/LeetCodeSolutions-Hard/blob/main/0004_Median_of_Two_Sorted_Arrays.swift)

- [10. Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/)
- [Solution](https://github.com/heartsker/LeetCodeSolutions-Hard/blob/main/0010_Regular_Expression_Matching.swift)

- [23. Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)
- [Solution](https://github.com/heartsker/LeetCodeSolutions-Hard/blob/main/0023_Merge_k_Sorted_Lists.swift)

- [25. Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)
- [Solution](https://github.com/heartsker/LeetCodeSolutions-Hard/blob/main/25_Reverse_Nodes_in_k-Group.swift)

- [30. Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)
- [Solution](https://github.com/heartsker/LeetCodeSolutions-Hard/blob/main/0030_Substring_with_Concatenation_of_All_Words.swift)

- [1526. Minimum Number of Increments on Subarrays to Form a Target Array](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/)
- [Solution](https://github.com/heartsker/LeetCodeSolutions-Hard/blob/main/1526_Minimum_Number_of_Increments_on_Subarrays_to_Form_a_Target_Array)