chore: split solutions by language

Signed-off-by: Matej Focko <mfocko@redhat.com>
2024-11-10 00:09:06 +01:00 · 2023-06-02 17:19:02 +02:00 · 2023-06-02 17:19:02 +02:00 · 333866d1bc
commit 333866d1bc
parent 078993071a
131 changed files with 4 additions and 4 deletions
--- a/problems/cpp/boats-to-save-people.cpp
+++ b/problems/cpp/boats-to-save-people.cpp
--- a/problems/cpp/can-place-flowers.cpp
+++ b/problems/cpp/can-place-flowers.cpp
--- a/problems/cpp/count-good-nodes-in-binary-tree.cpp
+++ b/problems/cpp/count-good-nodes-in-binary-tree.cpp
--- a/problems/cpp/count-ways-to-build-good-strings.cpp
+++ b/problems/cpp/count-ways-to-build-good-strings.cpp
--- a/problems/cpp/design-parking-system.cpp
+++ b/problems/cpp/design-parking-system.cpp
--- a/problems/cpp/determine-if-two-strings-are-close.cpp
+++ b/problems/cpp/determine-if-two-strings-are-close.cpp
--- a/problems/cpp/divide-a-string-into-groups-of-size-k.cpp
+++ b/problems/cpp/divide-a-string-into-groups-of-size-k.cpp
--- a/problems/cpp/kth-smallest-element-in-a-sorted-matrix.cpp
+++ b/problems/cpp/kth-smallest-element-in-a-sorted-matrix.cpp
--- a/problems/cpp/matrix-diagonal-sum.cpp
+++ b/problems/cpp/matrix-diagonal-sum.cpp
--- a/problems/cpp/max-sum-of-rectangle-no-larger-than-k.cpp
+++ b/problems/cpp/max-sum-of-rectangle-no-larger-than-k.cpp
--- a/problems/cpp/maximum-running-time-of-n-computers.cpp
+++ b/problems/cpp/maximum-running-time-of-n-computers.cpp
--- a/problems/cpp/merge-strings-alternately.cpp
+++ b/problems/cpp/merge-strings-alternately.cpp
--- a/problems/cpp/middle-of-the-linked-list.cpp
+++ b/problems/cpp/middle-of-the-linked-list.cpp
--- a/problems/cpp/minimum-moves-to-reach-target-score.cpp
+++ b/problems/cpp/minimum-moves-to-reach-target-score.cpp
--- a/problems/cpp/mirror-reflection.cpp
+++ b/problems/cpp/mirror-reflection.cpp
--- a/problems/cpp/my-calendar-i.cpp
+++ b/problems/cpp/my-calendar-i.cpp
--- a/problems/cpp/n-ary-tree-level-order-traversal.cpp
+++ b/problems/cpp/n-ary-tree-level-order-traversal.cpp
--- a/problems/cpp/n-ary-tree-preorder-traversal.cpp
+++ b/problems/cpp/n-ary-tree-preorder-traversal.cpp
--- a/problems/cpp/number-of-matching-subsequences.cpp
+++ b/problems/cpp/number-of-matching-subsequences.cpp
--- a/problems/cpp/numbers-with-same-consecutive-differences.cpp
+++ b/problems/cpp/numbers-with-same-consecutive-differences.cpp
--- a/problems/cpp/out-of-boundary-paths.cpp
+++ b/problems/cpp/out-of-boundary-paths.cpp
--- a/problems/cpp/palindrome-linked-list.cpp
+++ b/problems/cpp/palindrome-linked-list.cpp
@ -169,4 +169,4 @@ int main()
    assert(test_isPalindrome(std::vector { 1 }));

    return 0;
-}
+}
--- a/problems/cpp/partition-list.cpp
+++ b/problems/cpp/partition-list.cpp
--- a/problems/cpp/pascals-triangle-ii.cpp
+++ b/problems/cpp/pascals-triangle-ii.cpp
--- a/problems/cpp/pascals-triangle.cpp
+++ b/problems/cpp/pascals-triangle.cpp
--- a/problems/cpp/ransom-note.cpp
+++ b/problems/cpp/ransom-note.cpp
--- a/problems/cpp/removing-stars-from-a-string.cpp
+++ b/problems/cpp/removing-stars-from-a-string.cpp
--- a/problems/cpp/reordered-power-of-2.cpp
+++ b/problems/cpp/reordered-power-of-2.cpp
--- a/problems/cpp/rotate-image.cpp
+++ b/problems/cpp/rotate-image.cpp
--- a/problems/cpp/same-tree.cpp
+++ b/problems/cpp/same-tree.cpp
--- a/problems/cpp/solving-questions-with-brainpower.cpp
+++ b/problems/cpp/solving-questions-with-brainpower.cpp
--- a/problems/cpp/sort-the-matrix-diagonally.cpp
+++ b/problems/cpp/sort-the-matrix-diagonally.cpp
--- a/problems/cpp/spiral-matrix-ii.cpp
+++ b/problems/cpp/spiral-matrix-ii.cpp
--- a/problems/cpp/spiral-matrix.cpp
+++ b/problems/cpp/spiral-matrix.cpp
--- a/problems/cpp/unique-paths.cpp
+++ b/problems/cpp/unique-paths.cpp
--- a/problems/cpp/utf-8-validation.cpp
+++ b/problems/cpp/utf-8-validation.cpp
--- a/problems/cpp/valid-parentheses.cpp
+++ b/problems/cpp/valid-parentheses.cpp
--- a/problems/cpp/vertical-order-traversal-of-a-binary-tree.cpp
+++ b/problems/cpp/vertical-order-traversal-of-a-binary-tree.cpp
--- a/problems/cs/average-of-levels-in-binary-tree.cs
+++ b/problems/cs/average-of-levels-in-binary-tree.cs
--- a/problems/cs/binary-tree-pruning.cs
+++ b/problems/cs/binary-tree-pruning.cs
--- a/problems/cs/poor-pigs.cs
+++ b/problems/cs/poor-pigs.cs
--- a/problems/java/binary-search-tree-iterator.java
+++ b/problems/java/binary-search-tree-iterator.java
--- a/problems/java/combination-sum-iv.java
+++ b/problems/java/combination-sum-iv.java
--- a/problems/java/convert-sorted-array-to-binary-search-tree.java
+++ b/problems/java/convert-sorted-array-to-binary-search-tree.java
--- a/problems/java/flatten-nested-list-iterator.java
+++ b/problems/java/flatten-nested-list-iterator.java
--- a/problems/java/n-ary-tree-level-order-traversal.java
+++ b/problems/java/n-ary-tree-level-order-traversal.java
--- a/problems/java/peeking-iterator.java
+++ b/problems/java/peeking-iterator.java
--- a/problems/java/rle-iterator.java
+++ b/problems/java/rle-iterator.java
--- a/problems/js/allow-one-function-call.js
+++ b/problems/js/allow-one-function-call.js
--- a/problems/js/apply-transform-over-each-element-in-array.js
+++ b/problems/js/apply-transform-over-each-element-in-array.js
--- a/problems/js/array-reduce-transformation.js
+++ b/problems/js/array-reduce-transformation.js
--- a/problems/js/cache-with-time-limit.js
+++ b/problems/js/cache-with-time-limit.js
--- a/problems/js/counter-ii.js
+++ b/problems/js/counter-ii.js
--- a/problems/js/counter.js
+++ b/problems/js/counter.js
--- a/problems/js/create-hello-world-function.js
+++ b/problems/js/create-hello-world-function.js
--- a/problems/js/curry.js
+++ b/problems/js/curry.js
--- a/problems/js/debounce.js
+++ b/problems/js/debounce.js
--- a/problems/js/filter-elements-from-array.js
+++ b/problems/js/filter-elements-from-array.js
--- a/problems/js/function-composition.js
+++ b/problems/js/function-composition.js
--- a/problems/js/memoize.js
+++ b/problems/js/memoize.js
--- a/problems/js/promise-pool.js
+++ b/problems/js/promise-pool.js
--- a/problems/js/promise-time-limit.js
+++ b/problems/js/promise-time-limit.js
--- a/problems/js/sleep.js
+++ b/problems/js/sleep.js
--- a/problems/js/throttle.js
+++ b/problems/js/throttle.js
--- a/problems/kt/binary-tree-inorder-traversal.kt
+++ b/problems/kt/binary-tree-inorder-traversal.kt
--- a/problems/kt/binary-tree-level-order-traversal.kt
+++ b/problems/kt/binary-tree-level-order-traversal.kt
@ -13,15 +13,15 @@ class Solution {
        if (root == null) {
            return levels
        }
-        
+
        if (level + 1 > levels.size) {
            levels.add(mutableListOf<Int>())
        }
-        
+
        levels[level].add(root.`val`)
        levelOrder(root.left, levels, level + 1)
        return levelOrder(root.right, levels, level + 1)
    }
-    
+
    fun levelOrder(root: TreeNode?): List<List<Int>> = levelOrder(root, mutableListOf<MutableList<Int>>(), 0)
 }
--- a/problems/kt/check-if-every-row-and-column-contains-all-numbers.kt
+++ b/problems/kt/check-if-every-row-and-column-contains-all-numbers.kt
--- a/problems/kt/construct-string-from-binary-tree.kt
+++ b/problems/kt/construct-string-from-binary-tree.kt
--- a/problems/kt/first-unique-character-in-a-string.kt
+++ b/problems/kt/first-unique-character-in-a-string.kt
--- a/problems/kt/iterator-for-combination.kt
+++ b/problems/kt/iterator-for-combination.kt
--- a/problems/kt/lowest-common-ancestor-of-a-binary-search-tree.kt
+++ b/problems/kt/lowest-common-ancestor-of-a-binary-search-tree.kt
--- a/problems/kt/max-area-of-island.kt
+++ b/problems/kt/max-area-of-island.kt
--- a/problems/kt/maximize-distance-to-closest-person.kt
+++ b/problems/kt/maximize-distance-to-closest-person.kt
--- a/problems/kt/maximum-units-on-a-truck.kt
+++ b/problems/kt/maximum-units-on-a-truck.kt
--- a/problems/kt/minimum-number-of-refueling-stops.kt
+++ b/problems/kt/minimum-number-of-refueling-stops.kt
--- a/problems/kt/power-of-three.kt
+++ b/problems/kt/power-of-three.kt
--- a/problems/kt/roman-to-integer.kt
+++ b/problems/kt/roman-to-integer.kt
--- a/problems/kt/split-array-into-consecutive-subsequences.kt
+++ b/problems/kt/split-array-into-consecutive-subsequences.kt
--- a/problems/kt/substring-with-concatenation-of-all-words.kt
+++ b/problems/kt/substring-with-concatenation-of-all-words.kt
--- a/problems/kt/unique-morse-code-words.kt
+++ b/problems/kt/unique-morse-code-words.kt
--- a/problems/kt/validate-binary-search-tree.kt
+++ b/problems/kt/validate-binary-search-tree.kt
--- a/problems/kt/word-ladder-ii.kt
+++ b/problems/kt/word-ladder-ii.kt
--- a/problems/rb/binary-search.rb
+++ b/problems/rb/binary-search.rb
--- a/problems/rb/climbing-stairs.rb
+++ b/problems/rb/climbing-stairs.rb
--- a/problems/rb/contains-duplicate.rb
+++ b/problems/rb/contains-duplicate.rb
--- a/problems/rb/fibonacci-number.rb
+++ b/problems/rb/fibonacci-number.rb
--- a/problems/rb/first-bad-version.rb
+++ b/problems/rb/first-bad-version.rb
--- a/problems/rb/insert-into-a-binary-search-tree.rb
+++ b/problems/rb/insert-into-a-binary-search-tree.rb
--- a/problems/rb/linked-list-cycle-ii.rb
+++ b/problems/rb/linked-list-cycle-ii.rb
--- a/problems/rb/maximum-subarray.rb
+++ b/problems/rb/maximum-subarray.rb
--- a/problems/rb/merge-sorted-array.rb
+++ b/problems/rb/merge-sorted-array.rb
--- a/problems/rb/min-cost-climbing-stairs.rb
+++ b/problems/rb/min-cost-climbing-stairs.rb
--- a/problems/rb/rotate-array.rb
+++ b/problems/rb/rotate-array.rb
--- a/problems/rb/search-insert-position.rb
+++ b/problems/rb/search-insert-position.rb
--- a/problems/rb/squares-of-a-sorted-array.rb
+++ b/problems/rb/squares-of-a-sorted-array.rb
--- a/problems/rb/tribonacci.rb
+++ b/problems/rb/tribonacci.rb
--- a/problems/rb/two-sum.rb
+++ b/problems/rb/two-sum.rb
--- a/problems/rb/word-pattern.rb
+++ b/problems/rb/word-pattern.rb
--- a/problems/rs/add-digits.rs
+++ b/problems/rs/add-digits.rs
--- a/problems/rs/best-time-to-buy-and-sell-stock-iv.rs
+++ b/problems/rs/best-time-to-buy-and-sell-stock-iv.rs
--- a/Show more
+++ b/Show more