chore: unwrap one layer

Signed-off-by: Matej Focko <mfocko@redhat.com>
2024-09-07 20:16:57 +02:00 · 2023-12-12 14:36:00 +01:00 · 2023-12-12 14:36:00 +01:00 · 2351dfd0ee
commit 2351dfd0ee
parent 4fcc0c57fd
180 changed files with 2 additions and 3 deletions
--- a/.gitignore
+++ b/.gitignore
@ -1,4 +1,4 @@
-problems/playground
+playground

 # ignore compiled files
-problems/**/a.out
+**/a.out
--- a/problems/cpp/boats-to-save-people.cpp
+++ b/problems/cpp/boats-to-save-people.cpp
--- a/problems/cpp/calculate-money-in-leetcode-bank.cpp
+++ b/problems/cpp/calculate-money-in-leetcode-bank.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-negative-numbers-in-a-sorted-matrix.cpp
+++ b/problems/cpp/count-negative-numbers-in-a-sorted-matrix.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/find-smallest-letter-greater-than-target.cpp
+++ b/problems/cpp/find-smallest-letter-greater-than-target.cpp
--- a/problems/cpp/knight-dialer.cpp
+++ b/problems/cpp/knight-dialer.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/largest-odd-number-in-string.cpp
+++ b/problems/cpp/largest-odd-number-in-string.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/maximum-value-at-a-given-index-in-a-bounded-array.cpp
+++ b/problems/cpp/maximum-value-at-a-given-index-in-a-bounded-array.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-flips-to-make-a-or-b-equal-to-c.cpp
+++ b/problems/cpp/minimum-flips-to-make-a-or-b-equal-to-c.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
--- 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/snapshot-array.cpp
+++ b/problems/cpp/snapshot-array.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/sum-of-absolute-differences-in-a-sorted-array.cpp
+++ b/problems/cpp/sum-of-absolute-differences-in-a-sorted-array.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/check-if-two-string-arrays-are-equivalent.java
+++ b/problems/java/check-if-two-string-arrays-are-equivalent.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/equal-row-and-column-pairs.java
+++ b/problems/java/equal-row-and-column-pairs.java
--- a/problems/java/find-words-that-can-be-formed-by-characters.java
+++ b/problems/java/find-words-that-can-be-formed-by-characters.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/number-of-1-bits.java
+++ b/problems/java/number-of-1-bits.java
--- a/problems/java/peeking-iterator.java
+++ b/problems/java/peeking-iterator.java
--- a/problems/java/reduction-operations-to-make-the-array-elements-equal.java
+++ b/problems/java/reduction-operations-to-make-the-array-elements-equal.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-of-objects-to-matrix.js
+++ b/problems/js/array-of-objects-to-matrix.js
--- a/problems/js/array-prototype-last.js
+++ b/problems/js/array-prototype-last.js
--- a/problems/js/array-reduce-transformation.js
+++ b/problems/js/array-reduce-transformation.js
--- a/problems/js/array-wrapper.js
+++ b/problems/js/array-wrapper.js
--- a/problems/js/cache-with-time-limit.js
+++ b/problems/js/cache-with-time-limit.js
--- a/problems/js/call-function-with-custom-context.js
+++ b/problems/js/call-function-with-custom-context.js
--- a/problems/js/check-if-object-instance-of-class.js
+++ b/problems/js/check-if-object-instance-of-class.js
--- a/problems/js/chunk-array.js
+++ b/problems/js/chunk-array.js
--- a/problems/js/convert-object-to-json-string.js
+++ b/problems/js/convert-object-to-json-string.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/differences-between-two-objects.js
+++ b/problems/js/differences-between-two-objects.js
--- a/problems/js/event-emitter.js
+++ b/problems/js/event-emitter.js
--- a/problems/js/filter-elements-from-array.js
+++ b/problems/js/filter-elements-from-array.js
--- a/problems/js/flatten-deeply-nested-array.js
+++ b/problems/js/flatten-deeply-nested-array.js
--- a/problems/js/function-composition.js
+++ b/problems/js/function-composition.js
--- a/problems/js/generate-fibonacci-sequence.js
+++ b/problems/js/generate-fibonacci-sequence.js
--- a/problems/js/group-by.js
+++ b/problems/js/group-by.js
--- a/problems/js/json-deep-equal.js
+++ b/problems/js/json-deep-equal.js
--- a/problems/js/memoize.js
+++ b/problems/js/memoize.js
--- a/problems/js/nested-array-generator.js
+++ b/problems/js/nested-array-generator.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
--- 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/largest-3-same-digit-number-in-string.kt
+++ b/problems/kt/largest-3-same-digit-number-in-string.kt
--- a/Show more
+++ b/Show more