From 2351dfd0ee7ee7ea8a0e0f80effe6d102271b60b Mon Sep 17 00:00:00 2001 From: Matej Focko Date: Tue, 12 Dec 2023 14:36:00 +0100 Subject: [PATCH] chore: unwrap one layer Signed-off-by: Matej Focko --- .gitignore | 4 ++-- {problems/cpp => cpp}/boats-to-save-people.cpp | 0 {problems/cpp => cpp}/calculate-money-in-leetcode-bank.cpp | 0 {problems/cpp => cpp}/can-place-flowers.cpp | 0 {problems/cpp => cpp}/count-good-nodes-in-binary-tree.cpp | 0 .../cpp => cpp}/count-negative-numbers-in-a-sorted-matrix.cpp | 0 {problems/cpp => cpp}/count-ways-to-build-good-strings.cpp | 0 {problems/cpp => cpp}/design-parking-system.cpp | 0 {problems/cpp => cpp}/determine-if-two-strings-are-close.cpp | 0 .../cpp => cpp}/divide-a-string-into-groups-of-size-k.cpp | 0 .../cpp => cpp}/find-smallest-letter-greater-than-target.cpp | 0 {problems/cpp => cpp}/knight-dialer.cpp | 0 .../cpp => cpp}/kth-smallest-element-in-a-sorted-matrix.cpp | 0 {problems/cpp => cpp}/largest-odd-number-in-string.cpp | 0 {problems/cpp => cpp}/matrix-diagonal-sum.cpp | 0 .../cpp => cpp}/max-sum-of-rectangle-no-larger-than-k.cpp | 0 {problems/cpp => cpp}/maximum-running-time-of-n-computers.cpp | 0 .../maximum-value-at-a-given-index-in-a-bounded-array.cpp | 0 {problems/cpp => cpp}/merge-strings-alternately.cpp | 0 {problems/cpp => cpp}/middle-of-the-linked-list.cpp | 0 .../cpp => cpp}/minimum-flips-to-make-a-or-b-equal-to-c.cpp | 0 {problems/cpp => cpp}/minimum-moves-to-reach-target-score.cpp | 0 {problems/cpp => cpp}/mirror-reflection.cpp | 0 {problems/cpp => cpp}/my-calendar-i.cpp | 0 {problems/cpp => cpp}/n-ary-tree-level-order-traversal.cpp | 0 {problems/cpp => cpp}/n-ary-tree-preorder-traversal.cpp | 0 {problems/cpp => cpp}/number-of-matching-subsequences.cpp | 0 .../cpp => cpp}/numbers-with-same-consecutive-differences.cpp | 0 {problems/cpp => cpp}/out-of-boundary-paths.cpp | 0 {problems/cpp => cpp}/palindrome-linked-list.cpp | 0 {problems/cpp => cpp}/partition-list.cpp | 0 {problems/cpp => cpp}/pascals-triangle-ii.cpp | 0 {problems/cpp => cpp}/pascals-triangle.cpp | 0 {problems/cpp => cpp}/ransom-note.cpp | 0 {problems/cpp => cpp}/removing-stars-from-a-string.cpp | 0 {problems/cpp => cpp}/reordered-power-of-2.cpp | 0 {problems/cpp => cpp}/rotate-image.cpp | 0 {problems/cpp => cpp}/same-tree.cpp | 0 {problems/cpp => cpp}/snapshot-array.cpp | 0 {problems/cpp => cpp}/solving-questions-with-brainpower.cpp | 0 {problems/cpp => cpp}/sort-the-matrix-diagonally.cpp | 0 {problems/cpp => cpp}/spiral-matrix-ii.cpp | 0 {problems/cpp => cpp}/spiral-matrix.cpp | 0 .../sum-of-absolute-differences-in-a-sorted-array.cpp | 0 {problems/cpp => cpp}/unique-paths.cpp | 0 {problems/cpp => cpp}/utf-8-validation.cpp | 0 {problems/cpp => cpp}/valid-parentheses.cpp | 0 .../cpp => cpp}/vertical-order-traversal-of-a-binary-tree.cpp | 0 {problems/cs => cs}/average-of-levels-in-binary-tree.cs | 0 {problems/cs => cs}/binary-tree-pruning.cs | 0 {problems/cs => cs}/poor-pigs.cs | 0 {problems/java => java}/binary-search-tree-iterator.java | 0 .../check-if-two-string-arrays-are-equivalent.java | 0 {problems/java => java}/combination-sum-iv.java | 0 .../convert-sorted-array-to-binary-search-tree.java | 0 {problems/java => java}/equal-row-and-column-pairs.java | 0 .../find-words-that-can-be-formed-by-characters.java | 0 {problems/java => java}/flatten-nested-list-iterator.java | 0 {problems/java => java}/n-ary-tree-level-order-traversal.java | 0 {problems/java => java}/number-of-1-bits.java | 0 {problems/java => java}/peeking-iterator.java | 0 ...reduction-operations-to-make-the-array-elements-equal.java | 0 {problems/java => java}/rle-iterator.java | 0 {problems/js => js}/allow-one-function-call.js | 0 .../js => js}/apply-transform-over-each-element-in-array.js | 0 {problems/js => js}/array-of-objects-to-matrix.js | 0 {problems/js => js}/array-prototype-last.js | 0 {problems/js => js}/array-reduce-transformation.js | 0 {problems/js => js}/array-wrapper.js | 0 {problems/js => js}/cache-with-time-limit.js | 0 {problems/js => js}/call-function-with-custom-context.js | 0 {problems/js => js}/check-if-object-instance-of-class.js | 0 {problems/js => js}/chunk-array.js | 0 {problems/js => js}/convert-object-to-json-string.js | 0 {problems/js => js}/counter-ii.js | 0 {problems/js => js}/counter.js | 0 {problems/js => js}/create-hello-world-function.js | 0 {problems/js => js}/curry.js | 0 {problems/js => js}/debounce.js | 0 {problems/js => js}/differences-between-two-objects.js | 0 {problems/js => js}/event-emitter.js | 0 {problems/js => js}/filter-elements-from-array.js | 0 {problems/js => js}/flatten-deeply-nested-array.js | 0 {problems/js => js}/function-composition.js | 0 {problems/js => js}/generate-fibonacci-sequence.js | 0 {problems/js => js}/group-by.js | 0 {problems/js => js}/json-deep-equal.js | 0 {problems/js => js}/memoize.js | 0 {problems/js => js}/nested-array-generator.js | 0 {problems/js => js}/promise-pool.js | 0 {problems/js => js}/promise-time-limit.js | 0 {problems/js => js}/sleep.js | 0 {problems/js => js}/throttle.js | 0 {problems/kt => kt}/binary-tree-inorder-traversal.kt | 0 {problems/kt => kt}/binary-tree-level-order-traversal.kt | 0 .../check-if-every-row-and-column-contains-all-numbers.kt | 0 {problems/kt => kt}/construct-string-from-binary-tree.kt | 0 {problems/kt => kt}/first-unique-character-in-a-string.kt | 0 {problems/kt => kt}/iterator-for-combination.kt | 0 {problems/kt => kt}/largest-3-same-digit-number-in-string.kt | 0 .../lowest-common-ancestor-of-a-binary-search-tree.kt | 0 {problems/kt => kt}/max-area-of-island.kt | 0 {problems/kt => kt}/maximize-distance-to-closest-person.kt | 0 {problems/kt => kt}/maximum-units-on-a-truck.kt | 0 {problems/kt => kt}/minimum-number-of-refueling-stops.kt | 0 {problems/kt => kt}/minimum-time-visiting-all-points.kt | 0 {problems/kt => kt}/power-of-three.kt | 0 {problems/kt => kt}/richest-customer-wealth.kt | 0 {problems/kt => kt}/roman-to-integer.kt | 0 .../kt => kt}/split-array-into-consecutive-subsequences.kt | 0 .../kt => kt}/substring-with-concatenation-of-all-words.kt | 0 {problems/kt => kt}/unique-morse-code-words.kt | 0 {problems/kt => kt}/validate-binary-search-tree.kt | 0 {problems/kt => kt}/word-ladder-ii.kt | 0 {problems/rb => rb}/binary-search.rb | 0 {problems/rb => rb}/climbing-stairs.rb | 0 {problems/rb => rb}/contains-duplicate.rb | 0 {problems/rb => rb}/fibonacci-number.rb | 0 {problems/rb => rb}/first-bad-version.rb | 0 {problems/rb => rb}/insert-into-a-binary-search-tree.rb | 0 {problems/rb => rb}/linked-list-cycle-ii.rb | 0 {problems/rb => rb}/maximum-subarray.rb | 0 {problems/rb => rb}/merge-sorted-array.rb | 0 {problems/rb => rb}/min-cost-climbing-stairs.rb | 0 {problems/rb => rb}/rotate-array.rb | 0 {problems/rb => rb}/search-insert-position.rb | 0 {problems/rb => rb}/squares-of-a-sorted-array.rb | 0 {problems/rb => rb}/tribonacci.rb | 0 {problems/rb => rb}/two-sum.rb | 0 {problems/rb => rb}/word-pattern.rb | 0 {problems/rs => rs}/add-digits.rs | 0 {problems/rs => rs}/best-time-to-buy-and-sell-stock-iv.rs | 0 {problems/rs => rs}/binary-tree-inorder-traversal.rs | 0 {problems/rs => rs}/binary-trees-with-factors.rs | 0 .../can-make-arithmetic-progression-from-sequence.rs | 0 {problems/rs => rs}/check-if-it-is-a-straight-line.rs | 0 {problems/rs => rs}/complex-number-multiplication.rs | 0 {problems/rs => rs}/count-vowels-permutation.rs | 0 {problems/rs => rs}/detonate-the-maximum-bombs.rs | 0 {problems/rs => rs}/find-mode-in-binary-search-tree.rs | 0 {problems/rs => rs}/find-pivot-index.rs | 0 ...find-the-longest-valid-obstacle-course-at-each-position.rs | 0 {problems/rs => rs}/is-graph-bipartite.rs | 0 .../rs => rs}/kids-with-the-greatest-number-of-candies.rs | 0 {problems/rs => rs}/longest-increasing-subsequence.rs | 0 {problems/rs => rs}/longest-palindromic-subsequence.rs | 0 {problems/rs => rs}/maximum-level-sum-of-a-binary-tree.rs | 0 {problems/rs => rs}/maximum-number-of-coins-you-can-get.rs | 0 {problems/rs => rs}/maximum-running-time-of-n-computers.rs | 1 - {problems/rs => rs}/maximum-value-of-k-coins-from-piles.rs | 0 {problems/rs => rs}/minimum-absolute-difference-in-bst.rs | 0 .../minimum-number-of-vertices-to-reach-all-nodes.rs | 0 {problems/rs => rs}/number-of-islands.rs | 0 {problems/rs => rs}/number-of-provinces.rs | 0 {problems/rs => rs}/pacific-atlantic-water-flow.rs | 0 {problems/rs => rs}/power-of-four.rs | 0 {problems/rs => rs}/predict-the-winner.rs | 0 {problems/rs => rs}/range-sum-query-immutable.rs | 0 {problems/rs => rs}/reduce-array-size-to-the-half.rs | 0 {problems/rs => rs}/running-sum-of-1d-array.rs | 0 {problems/rs => rs}/shortest-path-in-binary-matrix.rs | 0 {problems/rs => rs}/simplify-path.rs | 0 {problems/rs => rs}/smallest-number-in-infinite-set.rs | 0 {problems/rs => rs}/solving-questions-with-brainpower.rs | 0 {problems/rs => rs}/sort-characters-by-frequency.rs | 0 {problems/rs => rs}/stamping-the-sequence.rs | 0 .../rs => rs}/the-number-of-weak-characters-in-the-game.rs | 0 {problems/rs => rs}/time-needed-to-inform-all-employees.rs | 0 {problems/rs => rs}/validate-stack-sequences.rs | 0 {problems/swift => swift}/binary-tree-inorder-traversal.swift | 0 .../swift => swift}/construct-string-from-binary-tree.swift | 0 {problems/swift => swift}/contains-duplicate.swift | 0 .../swift => swift}/count-of-matches-in-tournament.swift | 0 .../element-appearing-more-than-25-in-sorted-array.swift | 0 .../maximum-product-of-two-elements-in-an-array.swift | 0 {problems/swift => swift}/merge-k-sorted-lists.swift | 0 {problems/swift => swift}/number-complement.swift | 0 {problems/swift => swift}/transpose-matrix.swift | 0 {problems/swift => swift}/two-sum.swift | 0 {problems/swift => swift}/valid-parentheses.swift | 0 180 files changed, 2 insertions(+), 3 deletions(-) rename {problems/cpp => cpp}/boats-to-save-people.cpp (100%) rename {problems/cpp => cpp}/calculate-money-in-leetcode-bank.cpp (100%) rename {problems/cpp => cpp}/can-place-flowers.cpp (100%) rename {problems/cpp => cpp}/count-good-nodes-in-binary-tree.cpp (100%) rename {problems/cpp => cpp}/count-negative-numbers-in-a-sorted-matrix.cpp (100%) rename {problems/cpp => cpp}/count-ways-to-build-good-strings.cpp (100%) rename {problems/cpp => cpp}/design-parking-system.cpp (100%) rename {problems/cpp => cpp}/determine-if-two-strings-are-close.cpp (100%) rename {problems/cpp => cpp}/divide-a-string-into-groups-of-size-k.cpp (100%) rename {problems/cpp => cpp}/find-smallest-letter-greater-than-target.cpp (100%) rename {problems/cpp => cpp}/knight-dialer.cpp (100%) rename {problems/cpp => cpp}/kth-smallest-element-in-a-sorted-matrix.cpp (100%) rename {problems/cpp => cpp}/largest-odd-number-in-string.cpp (100%) rename {problems/cpp => cpp}/matrix-diagonal-sum.cpp (100%) rename {problems/cpp => cpp}/max-sum-of-rectangle-no-larger-than-k.cpp (100%) rename {problems/cpp => cpp}/maximum-running-time-of-n-computers.cpp (100%) rename {problems/cpp => cpp}/maximum-value-at-a-given-index-in-a-bounded-array.cpp (100%) rename {problems/cpp => cpp}/merge-strings-alternately.cpp (100%) rename {problems/cpp => cpp}/middle-of-the-linked-list.cpp (100%) rename {problems/cpp => cpp}/minimum-flips-to-make-a-or-b-equal-to-c.cpp (100%) rename {problems/cpp => cpp}/minimum-moves-to-reach-target-score.cpp (100%) rename {problems/cpp => cpp}/mirror-reflection.cpp (100%) rename {problems/cpp => cpp}/my-calendar-i.cpp (100%) rename {problems/cpp => cpp}/n-ary-tree-level-order-traversal.cpp (100%) rename {problems/cpp => cpp}/n-ary-tree-preorder-traversal.cpp (100%) rename {problems/cpp => cpp}/number-of-matching-subsequences.cpp (100%) rename {problems/cpp => cpp}/numbers-with-same-consecutive-differences.cpp (100%) rename {problems/cpp => cpp}/out-of-boundary-paths.cpp (100%) rename {problems/cpp => cpp}/palindrome-linked-list.cpp (100%) rename {problems/cpp => cpp}/partition-list.cpp (100%) rename {problems/cpp => cpp}/pascals-triangle-ii.cpp (100%) rename {problems/cpp => cpp}/pascals-triangle.cpp (100%) rename {problems/cpp => cpp}/ransom-note.cpp (100%) rename {problems/cpp => cpp}/removing-stars-from-a-string.cpp (100%) rename {problems/cpp => cpp}/reordered-power-of-2.cpp (100%) rename {problems/cpp => cpp}/rotate-image.cpp (100%) rename {problems/cpp => cpp}/same-tree.cpp (100%) rename {problems/cpp => cpp}/snapshot-array.cpp (100%) rename {problems/cpp => cpp}/solving-questions-with-brainpower.cpp (100%) rename {problems/cpp => cpp}/sort-the-matrix-diagonally.cpp (100%) rename {problems/cpp => cpp}/spiral-matrix-ii.cpp (100%) rename {problems/cpp => cpp}/spiral-matrix.cpp (100%) rename {problems/cpp => cpp}/sum-of-absolute-differences-in-a-sorted-array.cpp (100%) rename {problems/cpp => cpp}/unique-paths.cpp (100%) rename {problems/cpp => cpp}/utf-8-validation.cpp (100%) rename {problems/cpp => cpp}/valid-parentheses.cpp (100%) rename {problems/cpp => cpp}/vertical-order-traversal-of-a-binary-tree.cpp (100%) rename {problems/cs => cs}/average-of-levels-in-binary-tree.cs (100%) rename {problems/cs => cs}/binary-tree-pruning.cs (100%) rename {problems/cs => cs}/poor-pigs.cs (100%) rename {problems/java => java}/binary-search-tree-iterator.java (100%) rename {problems/java => java}/check-if-two-string-arrays-are-equivalent.java (100%) rename {problems/java => java}/combination-sum-iv.java (100%) rename {problems/java => java}/convert-sorted-array-to-binary-search-tree.java (100%) rename {problems/java => java}/equal-row-and-column-pairs.java (100%) rename {problems/java => java}/find-words-that-can-be-formed-by-characters.java (100%) rename {problems/java => java}/flatten-nested-list-iterator.java (100%) rename {problems/java => java}/n-ary-tree-level-order-traversal.java (100%) rename {problems/java => java}/number-of-1-bits.java (100%) rename {problems/java => java}/peeking-iterator.java (100%) rename {problems/java => java}/reduction-operations-to-make-the-array-elements-equal.java (100%) rename {problems/java => java}/rle-iterator.java (100%) rename {problems/js => js}/allow-one-function-call.js (100%) rename {problems/js => js}/apply-transform-over-each-element-in-array.js (100%) rename {problems/js => js}/array-of-objects-to-matrix.js (100%) rename {problems/js => js}/array-prototype-last.js (100%) rename {problems/js => js}/array-reduce-transformation.js (100%) rename {problems/js => js}/array-wrapper.js (100%) rename {problems/js => js}/cache-with-time-limit.js (100%) rename {problems/js => js}/call-function-with-custom-context.js (100%) rename {problems/js => js}/check-if-object-instance-of-class.js (100%) rename {problems/js => js}/chunk-array.js (100%) rename {problems/js => js}/convert-object-to-json-string.js (100%) rename {problems/js => js}/counter-ii.js (100%) rename {problems/js => js}/counter.js (100%) rename {problems/js => js}/create-hello-world-function.js (100%) rename {problems/js => js}/curry.js (100%) rename {problems/js => js}/debounce.js (100%) rename {problems/js => js}/differences-between-two-objects.js (100%) rename {problems/js => js}/event-emitter.js (100%) rename {problems/js => js}/filter-elements-from-array.js (100%) rename {problems/js => js}/flatten-deeply-nested-array.js (100%) rename {problems/js => js}/function-composition.js (100%) rename {problems/js => js}/generate-fibonacci-sequence.js (100%) rename {problems/js => js}/group-by.js (100%) rename {problems/js => js}/json-deep-equal.js (100%) rename {problems/js => js}/memoize.js (100%) rename {problems/js => js}/nested-array-generator.js (100%) rename {problems/js => js}/promise-pool.js (100%) rename {problems/js => js}/promise-time-limit.js (100%) rename {problems/js => js}/sleep.js (100%) rename {problems/js => js}/throttle.js (100%) rename {problems/kt => kt}/binary-tree-inorder-traversal.kt (100%) rename {problems/kt => kt}/binary-tree-level-order-traversal.kt (100%) rename {problems/kt => kt}/check-if-every-row-and-column-contains-all-numbers.kt (100%) rename {problems/kt => kt}/construct-string-from-binary-tree.kt (100%) rename {problems/kt => kt}/first-unique-character-in-a-string.kt (100%) rename {problems/kt => kt}/iterator-for-combination.kt (100%) rename {problems/kt => kt}/largest-3-same-digit-number-in-string.kt (100%) rename {problems/kt => kt}/lowest-common-ancestor-of-a-binary-search-tree.kt (100%) rename {problems/kt => kt}/max-area-of-island.kt (100%) rename {problems/kt => kt}/maximize-distance-to-closest-person.kt (100%) rename {problems/kt => kt}/maximum-units-on-a-truck.kt (100%) rename {problems/kt => kt}/minimum-number-of-refueling-stops.kt (100%) rename {problems/kt => kt}/minimum-time-visiting-all-points.kt (100%) rename {problems/kt => kt}/power-of-three.kt (100%) rename {problems/kt => kt}/richest-customer-wealth.kt (100%) rename {problems/kt => kt}/roman-to-integer.kt (100%) rename {problems/kt => kt}/split-array-into-consecutive-subsequences.kt (100%) rename {problems/kt => kt}/substring-with-concatenation-of-all-words.kt (100%) rename {problems/kt => kt}/unique-morse-code-words.kt (100%) rename {problems/kt => kt}/validate-binary-search-tree.kt (100%) rename {problems/kt => kt}/word-ladder-ii.kt (100%) rename {problems/rb => rb}/binary-search.rb (100%) rename {problems/rb => rb}/climbing-stairs.rb (100%) rename {problems/rb => rb}/contains-duplicate.rb (100%) rename {problems/rb => rb}/fibonacci-number.rb (100%) rename {problems/rb => rb}/first-bad-version.rb (100%) rename {problems/rb => rb}/insert-into-a-binary-search-tree.rb (100%) rename {problems/rb => rb}/linked-list-cycle-ii.rb (100%) rename {problems/rb => rb}/maximum-subarray.rb (100%) rename {problems/rb => rb}/merge-sorted-array.rb (100%) rename {problems/rb => rb}/min-cost-climbing-stairs.rb (100%) rename {problems/rb => rb}/rotate-array.rb (100%) rename {problems/rb => rb}/search-insert-position.rb (100%) rename {problems/rb => rb}/squares-of-a-sorted-array.rb (100%) rename {problems/rb => rb}/tribonacci.rb (100%) rename {problems/rb => rb}/two-sum.rb (100%) rename {problems/rb => rb}/word-pattern.rb (100%) rename {problems/rs => rs}/add-digits.rs (100%) rename {problems/rs => rs}/best-time-to-buy-and-sell-stock-iv.rs (100%) rename {problems/rs => rs}/binary-tree-inorder-traversal.rs (100%) rename {problems/rs => rs}/binary-trees-with-factors.rs (100%) rename {problems/rs => rs}/can-make-arithmetic-progression-from-sequence.rs (100%) rename {problems/rs => rs}/check-if-it-is-a-straight-line.rs (100%) rename {problems/rs => rs}/complex-number-multiplication.rs (100%) rename {problems/rs => rs}/count-vowels-permutation.rs (100%) rename {problems/rs => rs}/detonate-the-maximum-bombs.rs (100%) rename {problems/rs => rs}/find-mode-in-binary-search-tree.rs (100%) rename {problems/rs => rs}/find-pivot-index.rs (100%) rename {problems/rs => rs}/find-the-longest-valid-obstacle-course-at-each-position.rs (100%) rename {problems/rs => rs}/is-graph-bipartite.rs (100%) rename {problems/rs => rs}/kids-with-the-greatest-number-of-candies.rs (100%) rename {problems/rs => rs}/longest-increasing-subsequence.rs (100%) rename {problems/rs => rs}/longest-palindromic-subsequence.rs (100%) rename {problems/rs => rs}/maximum-level-sum-of-a-binary-tree.rs (100%) rename {problems/rs => rs}/maximum-number-of-coins-you-can-get.rs (100%) rename {problems/rs => rs}/maximum-running-time-of-n-computers.rs (99%) rename {problems/rs => rs}/maximum-value-of-k-coins-from-piles.rs (100%) rename {problems/rs => rs}/minimum-absolute-difference-in-bst.rs (100%) rename {problems/rs => rs}/minimum-number-of-vertices-to-reach-all-nodes.rs (100%) rename {problems/rs => rs}/number-of-islands.rs (100%) rename {problems/rs => rs}/number-of-provinces.rs (100%) rename {problems/rs => rs}/pacific-atlantic-water-flow.rs (100%) rename {problems/rs => rs}/power-of-four.rs (100%) rename {problems/rs => rs}/predict-the-winner.rs (100%) rename {problems/rs => rs}/range-sum-query-immutable.rs (100%) rename {problems/rs => rs}/reduce-array-size-to-the-half.rs (100%) rename {problems/rs => rs}/running-sum-of-1d-array.rs (100%) rename {problems/rs => rs}/shortest-path-in-binary-matrix.rs (100%) rename {problems/rs => rs}/simplify-path.rs (100%) rename {problems/rs => rs}/smallest-number-in-infinite-set.rs (100%) rename {problems/rs => rs}/solving-questions-with-brainpower.rs (100%) rename {problems/rs => rs}/sort-characters-by-frequency.rs (100%) rename {problems/rs => rs}/stamping-the-sequence.rs (100%) rename {problems/rs => rs}/the-number-of-weak-characters-in-the-game.rs (100%) rename {problems/rs => rs}/time-needed-to-inform-all-employees.rs (100%) rename {problems/rs => rs}/validate-stack-sequences.rs (100%) rename {problems/swift => swift}/binary-tree-inorder-traversal.swift (100%) rename {problems/swift => swift}/construct-string-from-binary-tree.swift (100%) rename {problems/swift => swift}/contains-duplicate.swift (100%) rename {problems/swift => swift}/count-of-matches-in-tournament.swift (100%) rename {problems/swift => swift}/element-appearing-more-than-25-in-sorted-array.swift (100%) rename {problems/swift => swift}/maximum-product-of-two-elements-in-an-array.swift (100%) rename {problems/swift => swift}/merge-k-sorted-lists.swift (100%) rename {problems/swift => swift}/number-complement.swift (100%) rename {problems/swift => swift}/transpose-matrix.swift (100%) rename {problems/swift => swift}/two-sum.swift (100%) rename {problems/swift => swift}/valid-parentheses.swift (100%) diff --git a/.gitignore b/.gitignore index 8aa8e78..23a03d3 100644 --- a/.gitignore +++ b/.gitignore @@ -1,4 +1,4 @@ -problems/playground +playground # ignore compiled files -problems/**/a.out +**/a.out diff --git a/problems/cpp/boats-to-save-people.cpp b/cpp/boats-to-save-people.cpp similarity index 100% rename from problems/cpp/boats-to-save-people.cpp rename to cpp/boats-to-save-people.cpp diff --git a/problems/cpp/calculate-money-in-leetcode-bank.cpp b/cpp/calculate-money-in-leetcode-bank.cpp similarity index 100% rename from problems/cpp/calculate-money-in-leetcode-bank.cpp rename to cpp/calculate-money-in-leetcode-bank.cpp diff --git a/problems/cpp/can-place-flowers.cpp b/cpp/can-place-flowers.cpp similarity index 100% rename from problems/cpp/can-place-flowers.cpp rename to cpp/can-place-flowers.cpp diff --git a/problems/cpp/count-good-nodes-in-binary-tree.cpp b/cpp/count-good-nodes-in-binary-tree.cpp similarity index 100% rename from problems/cpp/count-good-nodes-in-binary-tree.cpp rename to cpp/count-good-nodes-in-binary-tree.cpp diff --git a/problems/cpp/count-negative-numbers-in-a-sorted-matrix.cpp b/cpp/count-negative-numbers-in-a-sorted-matrix.cpp similarity index 100% rename from problems/cpp/count-negative-numbers-in-a-sorted-matrix.cpp rename to cpp/count-negative-numbers-in-a-sorted-matrix.cpp diff --git a/problems/cpp/count-ways-to-build-good-strings.cpp b/cpp/count-ways-to-build-good-strings.cpp similarity index 100% rename from problems/cpp/count-ways-to-build-good-strings.cpp rename to cpp/count-ways-to-build-good-strings.cpp diff --git a/problems/cpp/design-parking-system.cpp b/cpp/design-parking-system.cpp similarity index 100% rename from problems/cpp/design-parking-system.cpp rename to cpp/design-parking-system.cpp diff --git a/problems/cpp/determine-if-two-strings-are-close.cpp b/cpp/determine-if-two-strings-are-close.cpp similarity index 100% rename from problems/cpp/determine-if-two-strings-are-close.cpp rename to cpp/determine-if-two-strings-are-close.cpp diff --git a/problems/cpp/divide-a-string-into-groups-of-size-k.cpp b/cpp/divide-a-string-into-groups-of-size-k.cpp similarity index 100% rename from problems/cpp/divide-a-string-into-groups-of-size-k.cpp rename to cpp/divide-a-string-into-groups-of-size-k.cpp diff --git a/problems/cpp/find-smallest-letter-greater-than-target.cpp b/cpp/find-smallest-letter-greater-than-target.cpp similarity index 100% rename from problems/cpp/find-smallest-letter-greater-than-target.cpp rename to cpp/find-smallest-letter-greater-than-target.cpp diff --git a/problems/cpp/knight-dialer.cpp b/cpp/knight-dialer.cpp similarity index 100% rename from problems/cpp/knight-dialer.cpp rename to cpp/knight-dialer.cpp diff --git a/problems/cpp/kth-smallest-element-in-a-sorted-matrix.cpp b/cpp/kth-smallest-element-in-a-sorted-matrix.cpp similarity index 100% rename from problems/cpp/kth-smallest-element-in-a-sorted-matrix.cpp rename to cpp/kth-smallest-element-in-a-sorted-matrix.cpp diff --git a/problems/cpp/largest-odd-number-in-string.cpp b/cpp/largest-odd-number-in-string.cpp similarity index 100% rename from problems/cpp/largest-odd-number-in-string.cpp rename to cpp/largest-odd-number-in-string.cpp diff --git a/problems/cpp/matrix-diagonal-sum.cpp b/cpp/matrix-diagonal-sum.cpp similarity index 100% rename from problems/cpp/matrix-diagonal-sum.cpp rename to cpp/matrix-diagonal-sum.cpp diff --git a/problems/cpp/max-sum-of-rectangle-no-larger-than-k.cpp b/cpp/max-sum-of-rectangle-no-larger-than-k.cpp similarity index 100% rename from problems/cpp/max-sum-of-rectangle-no-larger-than-k.cpp rename to cpp/max-sum-of-rectangle-no-larger-than-k.cpp diff --git a/problems/cpp/maximum-running-time-of-n-computers.cpp b/cpp/maximum-running-time-of-n-computers.cpp similarity index 100% rename from problems/cpp/maximum-running-time-of-n-computers.cpp rename to cpp/maximum-running-time-of-n-computers.cpp diff --git a/problems/cpp/maximum-value-at-a-given-index-in-a-bounded-array.cpp b/cpp/maximum-value-at-a-given-index-in-a-bounded-array.cpp similarity index 100% rename from problems/cpp/maximum-value-at-a-given-index-in-a-bounded-array.cpp rename to cpp/maximum-value-at-a-given-index-in-a-bounded-array.cpp diff --git a/problems/cpp/merge-strings-alternately.cpp b/cpp/merge-strings-alternately.cpp similarity index 100% rename from problems/cpp/merge-strings-alternately.cpp rename to cpp/merge-strings-alternately.cpp diff --git a/problems/cpp/middle-of-the-linked-list.cpp b/cpp/middle-of-the-linked-list.cpp similarity index 100% rename from problems/cpp/middle-of-the-linked-list.cpp rename to cpp/middle-of-the-linked-list.cpp diff --git a/problems/cpp/minimum-flips-to-make-a-or-b-equal-to-c.cpp b/cpp/minimum-flips-to-make-a-or-b-equal-to-c.cpp similarity index 100% rename from problems/cpp/minimum-flips-to-make-a-or-b-equal-to-c.cpp rename to cpp/minimum-flips-to-make-a-or-b-equal-to-c.cpp diff --git a/problems/cpp/minimum-moves-to-reach-target-score.cpp b/cpp/minimum-moves-to-reach-target-score.cpp similarity index 100% rename from problems/cpp/minimum-moves-to-reach-target-score.cpp rename to cpp/minimum-moves-to-reach-target-score.cpp diff --git a/problems/cpp/mirror-reflection.cpp b/cpp/mirror-reflection.cpp similarity index 100% rename from problems/cpp/mirror-reflection.cpp rename to cpp/mirror-reflection.cpp diff --git a/problems/cpp/my-calendar-i.cpp b/cpp/my-calendar-i.cpp similarity index 100% rename from problems/cpp/my-calendar-i.cpp rename to cpp/my-calendar-i.cpp diff --git a/problems/cpp/n-ary-tree-level-order-traversal.cpp b/cpp/n-ary-tree-level-order-traversal.cpp similarity index 100% rename from problems/cpp/n-ary-tree-level-order-traversal.cpp rename to cpp/n-ary-tree-level-order-traversal.cpp diff --git a/problems/cpp/n-ary-tree-preorder-traversal.cpp b/cpp/n-ary-tree-preorder-traversal.cpp similarity index 100% rename from problems/cpp/n-ary-tree-preorder-traversal.cpp rename to cpp/n-ary-tree-preorder-traversal.cpp diff --git a/problems/cpp/number-of-matching-subsequences.cpp b/cpp/number-of-matching-subsequences.cpp similarity index 100% rename from problems/cpp/number-of-matching-subsequences.cpp rename to cpp/number-of-matching-subsequences.cpp diff --git a/problems/cpp/numbers-with-same-consecutive-differences.cpp b/cpp/numbers-with-same-consecutive-differences.cpp similarity index 100% rename from problems/cpp/numbers-with-same-consecutive-differences.cpp rename to cpp/numbers-with-same-consecutive-differences.cpp diff --git a/problems/cpp/out-of-boundary-paths.cpp b/cpp/out-of-boundary-paths.cpp similarity index 100% rename from problems/cpp/out-of-boundary-paths.cpp rename to cpp/out-of-boundary-paths.cpp diff --git a/problems/cpp/palindrome-linked-list.cpp b/cpp/palindrome-linked-list.cpp similarity index 100% rename from problems/cpp/palindrome-linked-list.cpp rename to cpp/palindrome-linked-list.cpp diff --git a/problems/cpp/partition-list.cpp b/cpp/partition-list.cpp similarity index 100% rename from problems/cpp/partition-list.cpp rename to cpp/partition-list.cpp diff --git a/problems/cpp/pascals-triangle-ii.cpp b/cpp/pascals-triangle-ii.cpp similarity index 100% rename from problems/cpp/pascals-triangle-ii.cpp rename to cpp/pascals-triangle-ii.cpp diff --git a/problems/cpp/pascals-triangle.cpp b/cpp/pascals-triangle.cpp similarity index 100% rename from problems/cpp/pascals-triangle.cpp rename to cpp/pascals-triangle.cpp diff --git a/problems/cpp/ransom-note.cpp b/cpp/ransom-note.cpp similarity index 100% rename from problems/cpp/ransom-note.cpp rename to cpp/ransom-note.cpp diff --git a/problems/cpp/removing-stars-from-a-string.cpp b/cpp/removing-stars-from-a-string.cpp similarity index 100% rename from problems/cpp/removing-stars-from-a-string.cpp rename to cpp/removing-stars-from-a-string.cpp diff --git a/problems/cpp/reordered-power-of-2.cpp b/cpp/reordered-power-of-2.cpp similarity index 100% rename from problems/cpp/reordered-power-of-2.cpp rename to cpp/reordered-power-of-2.cpp diff --git a/problems/cpp/rotate-image.cpp b/cpp/rotate-image.cpp similarity index 100% rename from problems/cpp/rotate-image.cpp rename to cpp/rotate-image.cpp diff --git a/problems/cpp/same-tree.cpp b/cpp/same-tree.cpp similarity index 100% rename from problems/cpp/same-tree.cpp rename to cpp/same-tree.cpp diff --git a/problems/cpp/snapshot-array.cpp b/cpp/snapshot-array.cpp similarity index 100% rename from problems/cpp/snapshot-array.cpp rename to cpp/snapshot-array.cpp diff --git a/problems/cpp/solving-questions-with-brainpower.cpp b/cpp/solving-questions-with-brainpower.cpp similarity index 100% rename from problems/cpp/solving-questions-with-brainpower.cpp rename to cpp/solving-questions-with-brainpower.cpp diff --git a/problems/cpp/sort-the-matrix-diagonally.cpp b/cpp/sort-the-matrix-diagonally.cpp similarity index 100% rename from problems/cpp/sort-the-matrix-diagonally.cpp rename to cpp/sort-the-matrix-diagonally.cpp diff --git a/problems/cpp/spiral-matrix-ii.cpp b/cpp/spiral-matrix-ii.cpp similarity index 100% rename from problems/cpp/spiral-matrix-ii.cpp rename to cpp/spiral-matrix-ii.cpp diff --git a/problems/cpp/spiral-matrix.cpp b/cpp/spiral-matrix.cpp similarity index 100% rename from problems/cpp/spiral-matrix.cpp rename to cpp/spiral-matrix.cpp diff --git a/problems/cpp/sum-of-absolute-differences-in-a-sorted-array.cpp b/cpp/sum-of-absolute-differences-in-a-sorted-array.cpp similarity index 100% rename from problems/cpp/sum-of-absolute-differences-in-a-sorted-array.cpp rename to cpp/sum-of-absolute-differences-in-a-sorted-array.cpp diff --git a/problems/cpp/unique-paths.cpp b/cpp/unique-paths.cpp similarity index 100% rename from problems/cpp/unique-paths.cpp rename to cpp/unique-paths.cpp diff --git a/problems/cpp/utf-8-validation.cpp b/cpp/utf-8-validation.cpp similarity index 100% rename from problems/cpp/utf-8-validation.cpp rename to cpp/utf-8-validation.cpp diff --git a/problems/cpp/valid-parentheses.cpp b/cpp/valid-parentheses.cpp similarity index 100% rename from problems/cpp/valid-parentheses.cpp rename to cpp/valid-parentheses.cpp diff --git a/problems/cpp/vertical-order-traversal-of-a-binary-tree.cpp b/cpp/vertical-order-traversal-of-a-binary-tree.cpp similarity index 100% rename from problems/cpp/vertical-order-traversal-of-a-binary-tree.cpp rename to cpp/vertical-order-traversal-of-a-binary-tree.cpp diff --git a/problems/cs/average-of-levels-in-binary-tree.cs b/cs/average-of-levels-in-binary-tree.cs similarity index 100% rename from problems/cs/average-of-levels-in-binary-tree.cs rename to cs/average-of-levels-in-binary-tree.cs diff --git a/problems/cs/binary-tree-pruning.cs b/cs/binary-tree-pruning.cs similarity index 100% rename from problems/cs/binary-tree-pruning.cs rename to cs/binary-tree-pruning.cs diff --git a/problems/cs/poor-pigs.cs b/cs/poor-pigs.cs similarity index 100% rename from problems/cs/poor-pigs.cs rename to cs/poor-pigs.cs diff --git a/problems/java/binary-search-tree-iterator.java b/java/binary-search-tree-iterator.java similarity index 100% rename from problems/java/binary-search-tree-iterator.java rename to java/binary-search-tree-iterator.java diff --git a/problems/java/check-if-two-string-arrays-are-equivalent.java b/java/check-if-two-string-arrays-are-equivalent.java similarity index 100% rename from problems/java/check-if-two-string-arrays-are-equivalent.java rename to java/check-if-two-string-arrays-are-equivalent.java diff --git a/problems/java/combination-sum-iv.java b/java/combination-sum-iv.java similarity index 100% rename from problems/java/combination-sum-iv.java rename to java/combination-sum-iv.java diff --git a/problems/java/convert-sorted-array-to-binary-search-tree.java b/java/convert-sorted-array-to-binary-search-tree.java similarity index 100% rename from problems/java/convert-sorted-array-to-binary-search-tree.java rename to java/convert-sorted-array-to-binary-search-tree.java diff --git a/problems/java/equal-row-and-column-pairs.java b/java/equal-row-and-column-pairs.java similarity index 100% rename from problems/java/equal-row-and-column-pairs.java rename to java/equal-row-and-column-pairs.java diff --git a/problems/java/find-words-that-can-be-formed-by-characters.java b/java/find-words-that-can-be-formed-by-characters.java similarity index 100% rename from problems/java/find-words-that-can-be-formed-by-characters.java rename to java/find-words-that-can-be-formed-by-characters.java diff --git a/problems/java/flatten-nested-list-iterator.java b/java/flatten-nested-list-iterator.java similarity index 100% rename from problems/java/flatten-nested-list-iterator.java rename to java/flatten-nested-list-iterator.java diff --git a/problems/java/n-ary-tree-level-order-traversal.java b/java/n-ary-tree-level-order-traversal.java similarity index 100% rename from problems/java/n-ary-tree-level-order-traversal.java rename to java/n-ary-tree-level-order-traversal.java diff --git a/problems/java/number-of-1-bits.java b/java/number-of-1-bits.java similarity index 100% rename from problems/java/number-of-1-bits.java rename to java/number-of-1-bits.java diff --git a/problems/java/peeking-iterator.java b/java/peeking-iterator.java similarity index 100% rename from problems/java/peeking-iterator.java rename to java/peeking-iterator.java diff --git a/problems/java/reduction-operations-to-make-the-array-elements-equal.java b/java/reduction-operations-to-make-the-array-elements-equal.java similarity index 100% rename from problems/java/reduction-operations-to-make-the-array-elements-equal.java rename to java/reduction-operations-to-make-the-array-elements-equal.java diff --git a/problems/java/rle-iterator.java b/java/rle-iterator.java similarity index 100% rename from problems/java/rle-iterator.java rename to java/rle-iterator.java diff --git a/problems/js/allow-one-function-call.js b/js/allow-one-function-call.js similarity index 100% rename from problems/js/allow-one-function-call.js rename to js/allow-one-function-call.js diff --git a/problems/js/apply-transform-over-each-element-in-array.js b/js/apply-transform-over-each-element-in-array.js similarity index 100% rename from problems/js/apply-transform-over-each-element-in-array.js rename to js/apply-transform-over-each-element-in-array.js diff --git a/problems/js/array-of-objects-to-matrix.js b/js/array-of-objects-to-matrix.js similarity index 100% rename from problems/js/array-of-objects-to-matrix.js rename to js/array-of-objects-to-matrix.js diff --git a/problems/js/array-prototype-last.js b/js/array-prototype-last.js similarity index 100% rename from problems/js/array-prototype-last.js rename to js/array-prototype-last.js diff --git a/problems/js/array-reduce-transformation.js b/js/array-reduce-transformation.js similarity index 100% rename from problems/js/array-reduce-transformation.js rename to js/array-reduce-transformation.js diff --git a/problems/js/array-wrapper.js b/js/array-wrapper.js similarity index 100% rename from problems/js/array-wrapper.js rename to js/array-wrapper.js diff --git a/problems/js/cache-with-time-limit.js b/js/cache-with-time-limit.js similarity index 100% rename from problems/js/cache-with-time-limit.js rename to js/cache-with-time-limit.js diff --git a/problems/js/call-function-with-custom-context.js b/js/call-function-with-custom-context.js similarity index 100% rename from problems/js/call-function-with-custom-context.js rename to js/call-function-with-custom-context.js diff --git a/problems/js/check-if-object-instance-of-class.js b/js/check-if-object-instance-of-class.js similarity index 100% rename from problems/js/check-if-object-instance-of-class.js rename to js/check-if-object-instance-of-class.js diff --git a/problems/js/chunk-array.js b/js/chunk-array.js similarity index 100% rename from problems/js/chunk-array.js rename to js/chunk-array.js diff --git a/problems/js/convert-object-to-json-string.js b/js/convert-object-to-json-string.js similarity index 100% rename from problems/js/convert-object-to-json-string.js rename to js/convert-object-to-json-string.js diff --git a/problems/js/counter-ii.js b/js/counter-ii.js similarity index 100% rename from problems/js/counter-ii.js rename to js/counter-ii.js diff --git a/problems/js/counter.js b/js/counter.js similarity index 100% rename from problems/js/counter.js rename to js/counter.js diff --git a/problems/js/create-hello-world-function.js b/js/create-hello-world-function.js similarity index 100% rename from problems/js/create-hello-world-function.js rename to js/create-hello-world-function.js diff --git a/problems/js/curry.js b/js/curry.js similarity index 100% rename from problems/js/curry.js rename to js/curry.js diff --git a/problems/js/debounce.js b/js/debounce.js similarity index 100% rename from problems/js/debounce.js rename to js/debounce.js diff --git a/problems/js/differences-between-two-objects.js b/js/differences-between-two-objects.js similarity index 100% rename from problems/js/differences-between-two-objects.js rename to js/differences-between-two-objects.js diff --git a/problems/js/event-emitter.js b/js/event-emitter.js similarity index 100% rename from problems/js/event-emitter.js rename to js/event-emitter.js diff --git a/problems/js/filter-elements-from-array.js b/js/filter-elements-from-array.js similarity index 100% rename from problems/js/filter-elements-from-array.js rename to js/filter-elements-from-array.js diff --git a/problems/js/flatten-deeply-nested-array.js b/js/flatten-deeply-nested-array.js similarity index 100% rename from problems/js/flatten-deeply-nested-array.js rename to js/flatten-deeply-nested-array.js diff --git a/problems/js/function-composition.js b/js/function-composition.js similarity index 100% rename from problems/js/function-composition.js rename to js/function-composition.js diff --git a/problems/js/generate-fibonacci-sequence.js b/js/generate-fibonacci-sequence.js similarity index 100% rename from problems/js/generate-fibonacci-sequence.js rename to js/generate-fibonacci-sequence.js diff --git a/problems/js/group-by.js b/js/group-by.js similarity index 100% rename from problems/js/group-by.js rename to js/group-by.js diff --git a/problems/js/json-deep-equal.js b/js/json-deep-equal.js similarity index 100% rename from problems/js/json-deep-equal.js rename to js/json-deep-equal.js diff --git a/problems/js/memoize.js b/js/memoize.js similarity index 100% rename from problems/js/memoize.js rename to js/memoize.js diff --git a/problems/js/nested-array-generator.js b/js/nested-array-generator.js similarity index 100% rename from problems/js/nested-array-generator.js rename to js/nested-array-generator.js diff --git a/problems/js/promise-pool.js b/js/promise-pool.js similarity index 100% rename from problems/js/promise-pool.js rename to js/promise-pool.js diff --git a/problems/js/promise-time-limit.js b/js/promise-time-limit.js similarity index 100% rename from problems/js/promise-time-limit.js rename to js/promise-time-limit.js diff --git a/problems/js/sleep.js b/js/sleep.js similarity index 100% rename from problems/js/sleep.js rename to js/sleep.js diff --git a/problems/js/throttle.js b/js/throttle.js similarity index 100% rename from problems/js/throttle.js rename to js/throttle.js diff --git a/problems/kt/binary-tree-inorder-traversal.kt b/kt/binary-tree-inorder-traversal.kt similarity index 100% rename from problems/kt/binary-tree-inorder-traversal.kt rename to kt/binary-tree-inorder-traversal.kt diff --git a/problems/kt/binary-tree-level-order-traversal.kt b/kt/binary-tree-level-order-traversal.kt similarity index 100% rename from problems/kt/binary-tree-level-order-traversal.kt rename to kt/binary-tree-level-order-traversal.kt diff --git a/problems/kt/check-if-every-row-and-column-contains-all-numbers.kt b/kt/check-if-every-row-and-column-contains-all-numbers.kt similarity index 100% rename from problems/kt/check-if-every-row-and-column-contains-all-numbers.kt rename to kt/check-if-every-row-and-column-contains-all-numbers.kt diff --git a/problems/kt/construct-string-from-binary-tree.kt b/kt/construct-string-from-binary-tree.kt similarity index 100% rename from problems/kt/construct-string-from-binary-tree.kt rename to kt/construct-string-from-binary-tree.kt diff --git a/problems/kt/first-unique-character-in-a-string.kt b/kt/first-unique-character-in-a-string.kt similarity index 100% rename from problems/kt/first-unique-character-in-a-string.kt rename to kt/first-unique-character-in-a-string.kt diff --git a/problems/kt/iterator-for-combination.kt b/kt/iterator-for-combination.kt similarity index 100% rename from problems/kt/iterator-for-combination.kt rename to kt/iterator-for-combination.kt diff --git a/problems/kt/largest-3-same-digit-number-in-string.kt b/kt/largest-3-same-digit-number-in-string.kt similarity index 100% rename from problems/kt/largest-3-same-digit-number-in-string.kt rename to kt/largest-3-same-digit-number-in-string.kt diff --git a/problems/kt/lowest-common-ancestor-of-a-binary-search-tree.kt b/kt/lowest-common-ancestor-of-a-binary-search-tree.kt similarity index 100% rename from problems/kt/lowest-common-ancestor-of-a-binary-search-tree.kt rename to kt/lowest-common-ancestor-of-a-binary-search-tree.kt diff --git a/problems/kt/max-area-of-island.kt b/kt/max-area-of-island.kt similarity index 100% rename from problems/kt/max-area-of-island.kt rename to kt/max-area-of-island.kt diff --git a/problems/kt/maximize-distance-to-closest-person.kt b/kt/maximize-distance-to-closest-person.kt similarity index 100% rename from problems/kt/maximize-distance-to-closest-person.kt rename to kt/maximize-distance-to-closest-person.kt diff --git a/problems/kt/maximum-units-on-a-truck.kt b/kt/maximum-units-on-a-truck.kt similarity index 100% rename from problems/kt/maximum-units-on-a-truck.kt rename to kt/maximum-units-on-a-truck.kt diff --git a/problems/kt/minimum-number-of-refueling-stops.kt b/kt/minimum-number-of-refueling-stops.kt similarity index 100% rename from problems/kt/minimum-number-of-refueling-stops.kt rename to kt/minimum-number-of-refueling-stops.kt diff --git a/problems/kt/minimum-time-visiting-all-points.kt b/kt/minimum-time-visiting-all-points.kt similarity index 100% rename from problems/kt/minimum-time-visiting-all-points.kt rename to kt/minimum-time-visiting-all-points.kt diff --git a/problems/kt/power-of-three.kt b/kt/power-of-three.kt similarity index 100% rename from problems/kt/power-of-three.kt rename to kt/power-of-three.kt diff --git a/problems/kt/richest-customer-wealth.kt b/kt/richest-customer-wealth.kt similarity index 100% rename from problems/kt/richest-customer-wealth.kt rename to kt/richest-customer-wealth.kt diff --git a/problems/kt/roman-to-integer.kt b/kt/roman-to-integer.kt similarity index 100% rename from problems/kt/roman-to-integer.kt rename to kt/roman-to-integer.kt diff --git a/problems/kt/split-array-into-consecutive-subsequences.kt b/kt/split-array-into-consecutive-subsequences.kt similarity index 100% rename from problems/kt/split-array-into-consecutive-subsequences.kt rename to kt/split-array-into-consecutive-subsequences.kt diff --git a/problems/kt/substring-with-concatenation-of-all-words.kt b/kt/substring-with-concatenation-of-all-words.kt similarity index 100% rename from problems/kt/substring-with-concatenation-of-all-words.kt rename to kt/substring-with-concatenation-of-all-words.kt diff --git a/problems/kt/unique-morse-code-words.kt b/kt/unique-morse-code-words.kt similarity index 100% rename from problems/kt/unique-morse-code-words.kt rename to kt/unique-morse-code-words.kt diff --git a/problems/kt/validate-binary-search-tree.kt b/kt/validate-binary-search-tree.kt similarity index 100% rename from problems/kt/validate-binary-search-tree.kt rename to kt/validate-binary-search-tree.kt diff --git a/problems/kt/word-ladder-ii.kt b/kt/word-ladder-ii.kt similarity index 100% rename from problems/kt/word-ladder-ii.kt rename to kt/word-ladder-ii.kt diff --git a/problems/rb/binary-search.rb b/rb/binary-search.rb similarity index 100% rename from problems/rb/binary-search.rb rename to rb/binary-search.rb diff --git a/problems/rb/climbing-stairs.rb b/rb/climbing-stairs.rb similarity index 100% rename from problems/rb/climbing-stairs.rb rename to rb/climbing-stairs.rb diff --git a/problems/rb/contains-duplicate.rb b/rb/contains-duplicate.rb similarity index 100% rename from problems/rb/contains-duplicate.rb rename to rb/contains-duplicate.rb diff --git a/problems/rb/fibonacci-number.rb b/rb/fibonacci-number.rb similarity index 100% rename from problems/rb/fibonacci-number.rb rename to rb/fibonacci-number.rb diff --git a/problems/rb/first-bad-version.rb b/rb/first-bad-version.rb similarity index 100% rename from problems/rb/first-bad-version.rb rename to rb/first-bad-version.rb diff --git a/problems/rb/insert-into-a-binary-search-tree.rb b/rb/insert-into-a-binary-search-tree.rb similarity index 100% rename from problems/rb/insert-into-a-binary-search-tree.rb rename to rb/insert-into-a-binary-search-tree.rb diff --git a/problems/rb/linked-list-cycle-ii.rb b/rb/linked-list-cycle-ii.rb similarity index 100% rename from problems/rb/linked-list-cycle-ii.rb rename to rb/linked-list-cycle-ii.rb diff --git a/problems/rb/maximum-subarray.rb b/rb/maximum-subarray.rb similarity index 100% rename from problems/rb/maximum-subarray.rb rename to rb/maximum-subarray.rb diff --git a/problems/rb/merge-sorted-array.rb b/rb/merge-sorted-array.rb similarity index 100% rename from problems/rb/merge-sorted-array.rb rename to rb/merge-sorted-array.rb diff --git a/problems/rb/min-cost-climbing-stairs.rb b/rb/min-cost-climbing-stairs.rb similarity index 100% rename from problems/rb/min-cost-climbing-stairs.rb rename to rb/min-cost-climbing-stairs.rb diff --git a/problems/rb/rotate-array.rb b/rb/rotate-array.rb similarity index 100% rename from problems/rb/rotate-array.rb rename to rb/rotate-array.rb diff --git a/problems/rb/search-insert-position.rb b/rb/search-insert-position.rb similarity index 100% rename from problems/rb/search-insert-position.rb rename to rb/search-insert-position.rb diff --git a/problems/rb/squares-of-a-sorted-array.rb b/rb/squares-of-a-sorted-array.rb similarity index 100% rename from problems/rb/squares-of-a-sorted-array.rb rename to rb/squares-of-a-sorted-array.rb diff --git a/problems/rb/tribonacci.rb b/rb/tribonacci.rb similarity index 100% rename from problems/rb/tribonacci.rb rename to rb/tribonacci.rb diff --git a/problems/rb/two-sum.rb b/rb/two-sum.rb similarity index 100% rename from problems/rb/two-sum.rb rename to rb/two-sum.rb diff --git a/problems/rb/word-pattern.rb b/rb/word-pattern.rb similarity index 100% rename from problems/rb/word-pattern.rb rename to rb/word-pattern.rb diff --git a/problems/rs/add-digits.rs b/rs/add-digits.rs similarity index 100% rename from problems/rs/add-digits.rs rename to rs/add-digits.rs diff --git a/problems/rs/best-time-to-buy-and-sell-stock-iv.rs b/rs/best-time-to-buy-and-sell-stock-iv.rs similarity index 100% rename from problems/rs/best-time-to-buy-and-sell-stock-iv.rs rename to rs/best-time-to-buy-and-sell-stock-iv.rs diff --git a/problems/rs/binary-tree-inorder-traversal.rs b/rs/binary-tree-inorder-traversal.rs similarity index 100% rename from problems/rs/binary-tree-inorder-traversal.rs rename to rs/binary-tree-inorder-traversal.rs diff --git a/problems/rs/binary-trees-with-factors.rs b/rs/binary-trees-with-factors.rs similarity index 100% rename from problems/rs/binary-trees-with-factors.rs rename to rs/binary-trees-with-factors.rs diff --git a/problems/rs/can-make-arithmetic-progression-from-sequence.rs b/rs/can-make-arithmetic-progression-from-sequence.rs similarity index 100% rename from problems/rs/can-make-arithmetic-progression-from-sequence.rs rename to rs/can-make-arithmetic-progression-from-sequence.rs diff --git a/problems/rs/check-if-it-is-a-straight-line.rs b/rs/check-if-it-is-a-straight-line.rs similarity index 100% rename from problems/rs/check-if-it-is-a-straight-line.rs rename to rs/check-if-it-is-a-straight-line.rs diff --git a/problems/rs/complex-number-multiplication.rs b/rs/complex-number-multiplication.rs similarity index 100% rename from problems/rs/complex-number-multiplication.rs rename to rs/complex-number-multiplication.rs diff --git a/problems/rs/count-vowels-permutation.rs b/rs/count-vowels-permutation.rs similarity index 100% rename from problems/rs/count-vowels-permutation.rs rename to rs/count-vowels-permutation.rs diff --git a/problems/rs/detonate-the-maximum-bombs.rs b/rs/detonate-the-maximum-bombs.rs similarity index 100% rename from problems/rs/detonate-the-maximum-bombs.rs rename to rs/detonate-the-maximum-bombs.rs diff --git a/problems/rs/find-mode-in-binary-search-tree.rs b/rs/find-mode-in-binary-search-tree.rs similarity index 100% rename from problems/rs/find-mode-in-binary-search-tree.rs rename to rs/find-mode-in-binary-search-tree.rs diff --git a/problems/rs/find-pivot-index.rs b/rs/find-pivot-index.rs similarity index 100% rename from problems/rs/find-pivot-index.rs rename to rs/find-pivot-index.rs diff --git a/problems/rs/find-the-longest-valid-obstacle-course-at-each-position.rs b/rs/find-the-longest-valid-obstacle-course-at-each-position.rs similarity index 100% rename from problems/rs/find-the-longest-valid-obstacle-course-at-each-position.rs rename to rs/find-the-longest-valid-obstacle-course-at-each-position.rs diff --git a/problems/rs/is-graph-bipartite.rs b/rs/is-graph-bipartite.rs similarity index 100% rename from problems/rs/is-graph-bipartite.rs rename to rs/is-graph-bipartite.rs diff --git a/problems/rs/kids-with-the-greatest-number-of-candies.rs b/rs/kids-with-the-greatest-number-of-candies.rs similarity index 100% rename from problems/rs/kids-with-the-greatest-number-of-candies.rs rename to rs/kids-with-the-greatest-number-of-candies.rs diff --git a/problems/rs/longest-increasing-subsequence.rs b/rs/longest-increasing-subsequence.rs similarity index 100% rename from problems/rs/longest-increasing-subsequence.rs rename to rs/longest-increasing-subsequence.rs diff --git a/problems/rs/longest-palindromic-subsequence.rs b/rs/longest-palindromic-subsequence.rs similarity index 100% rename from problems/rs/longest-palindromic-subsequence.rs rename to rs/longest-palindromic-subsequence.rs diff --git a/problems/rs/maximum-level-sum-of-a-binary-tree.rs b/rs/maximum-level-sum-of-a-binary-tree.rs similarity index 100% rename from problems/rs/maximum-level-sum-of-a-binary-tree.rs rename to rs/maximum-level-sum-of-a-binary-tree.rs diff --git a/problems/rs/maximum-number-of-coins-you-can-get.rs b/rs/maximum-number-of-coins-you-can-get.rs similarity index 100% rename from problems/rs/maximum-number-of-coins-you-can-get.rs rename to rs/maximum-number-of-coins-you-can-get.rs diff --git a/problems/rs/maximum-running-time-of-n-computers.rs b/rs/maximum-running-time-of-n-computers.rs similarity index 99% rename from problems/rs/maximum-running-time-of-n-computers.rs rename to rs/maximum-running-time-of-n-computers.rs index 84c9971..3d689d7 100644 --- a/problems/rs/maximum-running-time-of-n-computers.rs +++ b/rs/maximum-running-time-of-n-computers.rs @@ -15,4 +15,3 @@ impl Solution { (total / (n as u64 - k)) as i64 } } - diff --git a/problems/rs/maximum-value-of-k-coins-from-piles.rs b/rs/maximum-value-of-k-coins-from-piles.rs similarity index 100% rename from problems/rs/maximum-value-of-k-coins-from-piles.rs rename to rs/maximum-value-of-k-coins-from-piles.rs diff --git a/problems/rs/minimum-absolute-difference-in-bst.rs b/rs/minimum-absolute-difference-in-bst.rs similarity index 100% rename from problems/rs/minimum-absolute-difference-in-bst.rs rename to rs/minimum-absolute-difference-in-bst.rs diff --git a/problems/rs/minimum-number-of-vertices-to-reach-all-nodes.rs b/rs/minimum-number-of-vertices-to-reach-all-nodes.rs similarity index 100% rename from problems/rs/minimum-number-of-vertices-to-reach-all-nodes.rs rename to rs/minimum-number-of-vertices-to-reach-all-nodes.rs diff --git a/problems/rs/number-of-islands.rs b/rs/number-of-islands.rs similarity index 100% rename from problems/rs/number-of-islands.rs rename to rs/number-of-islands.rs diff --git a/problems/rs/number-of-provinces.rs b/rs/number-of-provinces.rs similarity index 100% rename from problems/rs/number-of-provinces.rs rename to rs/number-of-provinces.rs diff --git a/problems/rs/pacific-atlantic-water-flow.rs b/rs/pacific-atlantic-water-flow.rs similarity index 100% rename from problems/rs/pacific-atlantic-water-flow.rs rename to rs/pacific-atlantic-water-flow.rs diff --git a/problems/rs/power-of-four.rs b/rs/power-of-four.rs similarity index 100% rename from problems/rs/power-of-four.rs rename to rs/power-of-four.rs diff --git a/problems/rs/predict-the-winner.rs b/rs/predict-the-winner.rs similarity index 100% rename from problems/rs/predict-the-winner.rs rename to rs/predict-the-winner.rs diff --git a/problems/rs/range-sum-query-immutable.rs b/rs/range-sum-query-immutable.rs similarity index 100% rename from problems/rs/range-sum-query-immutable.rs rename to rs/range-sum-query-immutable.rs diff --git a/problems/rs/reduce-array-size-to-the-half.rs b/rs/reduce-array-size-to-the-half.rs similarity index 100% rename from problems/rs/reduce-array-size-to-the-half.rs rename to rs/reduce-array-size-to-the-half.rs diff --git a/problems/rs/running-sum-of-1d-array.rs b/rs/running-sum-of-1d-array.rs similarity index 100% rename from problems/rs/running-sum-of-1d-array.rs rename to rs/running-sum-of-1d-array.rs diff --git a/problems/rs/shortest-path-in-binary-matrix.rs b/rs/shortest-path-in-binary-matrix.rs similarity index 100% rename from problems/rs/shortest-path-in-binary-matrix.rs rename to rs/shortest-path-in-binary-matrix.rs diff --git a/problems/rs/simplify-path.rs b/rs/simplify-path.rs similarity index 100% rename from problems/rs/simplify-path.rs rename to rs/simplify-path.rs diff --git a/problems/rs/smallest-number-in-infinite-set.rs b/rs/smallest-number-in-infinite-set.rs similarity index 100% rename from problems/rs/smallest-number-in-infinite-set.rs rename to rs/smallest-number-in-infinite-set.rs diff --git a/problems/rs/solving-questions-with-brainpower.rs b/rs/solving-questions-with-brainpower.rs similarity index 100% rename from problems/rs/solving-questions-with-brainpower.rs rename to rs/solving-questions-with-brainpower.rs diff --git a/problems/rs/sort-characters-by-frequency.rs b/rs/sort-characters-by-frequency.rs similarity index 100% rename from problems/rs/sort-characters-by-frequency.rs rename to rs/sort-characters-by-frequency.rs diff --git a/problems/rs/stamping-the-sequence.rs b/rs/stamping-the-sequence.rs similarity index 100% rename from problems/rs/stamping-the-sequence.rs rename to rs/stamping-the-sequence.rs diff --git a/problems/rs/the-number-of-weak-characters-in-the-game.rs b/rs/the-number-of-weak-characters-in-the-game.rs similarity index 100% rename from problems/rs/the-number-of-weak-characters-in-the-game.rs rename to rs/the-number-of-weak-characters-in-the-game.rs diff --git a/problems/rs/time-needed-to-inform-all-employees.rs b/rs/time-needed-to-inform-all-employees.rs similarity index 100% rename from problems/rs/time-needed-to-inform-all-employees.rs rename to rs/time-needed-to-inform-all-employees.rs diff --git a/problems/rs/validate-stack-sequences.rs b/rs/validate-stack-sequences.rs similarity index 100% rename from problems/rs/validate-stack-sequences.rs rename to rs/validate-stack-sequences.rs diff --git a/problems/swift/binary-tree-inorder-traversal.swift b/swift/binary-tree-inorder-traversal.swift similarity index 100% rename from problems/swift/binary-tree-inorder-traversal.swift rename to swift/binary-tree-inorder-traversal.swift diff --git a/problems/swift/construct-string-from-binary-tree.swift b/swift/construct-string-from-binary-tree.swift similarity index 100% rename from problems/swift/construct-string-from-binary-tree.swift rename to swift/construct-string-from-binary-tree.swift diff --git a/problems/swift/contains-duplicate.swift b/swift/contains-duplicate.swift similarity index 100% rename from problems/swift/contains-duplicate.swift rename to swift/contains-duplicate.swift diff --git a/problems/swift/count-of-matches-in-tournament.swift b/swift/count-of-matches-in-tournament.swift similarity index 100% rename from problems/swift/count-of-matches-in-tournament.swift rename to swift/count-of-matches-in-tournament.swift diff --git a/problems/swift/element-appearing-more-than-25-in-sorted-array.swift b/swift/element-appearing-more-than-25-in-sorted-array.swift similarity index 100% rename from problems/swift/element-appearing-more-than-25-in-sorted-array.swift rename to swift/element-appearing-more-than-25-in-sorted-array.swift diff --git a/problems/swift/maximum-product-of-two-elements-in-an-array.swift b/swift/maximum-product-of-two-elements-in-an-array.swift similarity index 100% rename from problems/swift/maximum-product-of-two-elements-in-an-array.swift rename to swift/maximum-product-of-two-elements-in-an-array.swift diff --git a/problems/swift/merge-k-sorted-lists.swift b/swift/merge-k-sorted-lists.swift similarity index 100% rename from problems/swift/merge-k-sorted-lists.swift rename to swift/merge-k-sorted-lists.swift diff --git a/problems/swift/number-complement.swift b/swift/number-complement.swift similarity index 100% rename from problems/swift/number-complement.swift rename to swift/number-complement.swift diff --git a/problems/swift/transpose-matrix.swift b/swift/transpose-matrix.swift similarity index 100% rename from problems/swift/transpose-matrix.swift rename to swift/transpose-matrix.swift diff --git a/problems/swift/two-sum.swift b/swift/two-sum.swift similarity index 100% rename from problems/swift/two-sum.swift rename to swift/two-sum.swift diff --git a/problems/swift/valid-parentheses.swift b/swift/valid-parentheses.swift similarity index 100% rename from problems/swift/valid-parentheses.swift rename to swift/valid-parentheses.swift