GitHub - redouane-nouri/leetcode: My LeetCode solutions

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 429 Commits
1-bit-and-2-bit-characters.cpp		1-bit-and-2-bit-characters.cpp
24-game.cpp		24-game.cpp
3sum-closest.cpp		3sum-closest.cpp
3sum.cpp		3sum.cpp
4sum.cpp		4sum.cpp
add-binary.cpp		add-binary.cpp
add-digits.cpp		add-digits.cpp
add-strings.cpp		add-strings.cpp
add-two-numbers.cpp		add-two-numbers.cpp
adjacent-increasing-subarrays-detection-i.cpp		adjacent-increasing-subarrays-detection-i.cpp
adjacent-increasing-subarrays-detection-ii.cpp		adjacent-increasing-subarrays-detection-ii.cpp
alice-and-bob-playing-flower-game.cpp		alice-and-bob-playing-flower-game.cpp
apple-redistribution-into-boxes.cpp		apple-redistribution-into-boxes.cpp
arranging-coins.cpp		arranging-coins.cpp
assign-cookies.cpp		assign-cookies.cpp
avoid-flood-in-the-city.cpp		avoid-flood-in-the-city.cpp
balance-a-binary-search-tree.cpp		balance-a-binary-search-tree.cpp
balanced-binary-tree.cpp		balanced-binary-tree.cpp
best-reachable-tower.cpp		best-reachable-tower.cpp
best-time-to-buy-and-sell-stock-ii.cpp		best-time-to-buy-and-sell-stock-ii.cpp
best-time-to-buy-and-sell-stock-using-strategy.cpp		best-time-to-buy-and-sell-stock-using-strategy.cpp
best-time-to-buy-and-sell-stock-v.cpp		best-time-to-buy-and-sell-stock-v.cpp
best-time-to-buy-and-sell-stock.cpp		best-time-to-buy-and-sell-stock.cpp
binary-gap.cpp		binary-gap.cpp
binary-number-with-alternating-bits.cpp		binary-number-with-alternating-bits.cpp
binary-prefix-divisible-by-5.cpp		binary-prefix-divisible-by-5.cpp
binary-tree-inorder-traversal.cpp		binary-tree-inorder-traversal.cpp
binary-tree-level-order-traversal-ii.cpp		binary-tree-level-order-traversal-ii.cpp
binary-tree-level-order-traversal.cpp		binary-tree-level-order-traversal.cpp
binary-tree-paths.cpp		binary-tree-paths.cpp
binary-tree-postorder-traversal.cpp		binary-tree-postorder-traversal.cpp
binary-tree-preorder-traversal.cpp		binary-tree-preorder-traversal.cpp
binary-tree-zigzag-level-order-traversal.cpp		binary-tree-zigzag-level-order-traversal.cpp
binary-watch.cpp		binary-watch.cpp
calculate-money-in-leetcode-bank.cpp		calculate-money-in-leetcode-bank.cpp
champagne-tower.cpp		champagne-tower.cpp
check-if-a-string-contains-all-binary-codes-of-size-k.cpp		check-if-a-string-contains-all-binary-codes-of-size-k.cpp
check-if-all-1s-are-at-least-length-k-places-away.cpp		check-if-all-1s-are-at-least-length-k-places-away.cpp
check-if-binary-string-has-at-most-one-segment-of-ones.cpp		check-if-binary-string-has-at-most-one-segment-of-ones.cpp
check-if-digits-are-equal-in-string-after-operations-i.cpp		check-if-digits-are-equal-in-string-after-operations-i.cpp
climbing-stairs.cpp		climbing-stairs.cpp
clone-graph.cpp		clone-graph.cpp
combination-sum-ii.cpp		combination-sum-ii.cpp
combination-sum.cpp		combination-sum.cpp
combinations.cpp		combinations.cpp
combine-two-tables.sql		combine-two-tables.sql
compare-version-numbers.cpp		compare-version-numbers.cpp
complement-of-base-10-integer.cpp		complement-of-base-10-integer.cpp
concatenation-of-consecutive-binary-numbers.cpp		concatenation-of-consecutive-binary-numbers.cpp
construct-binary-tree-from-inorder-and-postorder-traversal.cpp		construct-binary-tree-from-inorder-and-postorder-traversal.cpp
construct-binary-tree-from-preorder-and-inorder-traversal.cpp		construct-binary-tree-from-preorder-and-inorder-traversal.cpp
construct-the-minimum-bitwise-array-i.cpp		construct-the-minimum-bitwise-array-i.cpp
construct-the-minimum-bitwise-array-ii.cpp		construct-the-minimum-bitwise-array-ii.cpp
container-with-most-water.cpp		container-with-most-water.cpp
contains-duplicate-ii.cpp		contains-duplicate-ii.cpp
contains-duplicate.cpp		contains-duplicate.cpp
convert-a-number-to-hexadecimal.cpp		convert-a-number-to-hexadecimal.cpp
convert-integer-to-the-sum-of-two-no-zero-integers.cpp		convert-integer-to-the-sum-of-two-no-zero-integers.cpp
convert-sorted-array-to-binary-search-tree.cpp		convert-sorted-array-to-binary-search-tree.cpp
convert-sorted-list-to-binary-search-tree.cpp		convert-sorted-list-to-binary-search-tree.cpp
copy-list-with-random-pointer.cpp		copy-list-with-random-pointer.cpp
count-and-say.cpp		count-and-say.cpp
count-binary-substrings.cpp		count-binary-substrings.cpp
count-collisions-on-a-road.cpp		count-collisions-on-a-road.cpp
count-complete-tree-nodes.cpp		count-complete-tree-nodes.cpp
count-covered-buildings.cpp		count-covered-buildings.cpp
count-elements-with-maximum-frequency.cpp		count-elements-with-maximum-frequency.cpp
count-mentions-per-user.cpp		count-mentions-per-user.cpp
count-negative-numbers-in-a-sorted-matrix.cpp		count-negative-numbers-in-a-sorted-matrix.cpp
count-number-of-trapezoids-i.cpp		count-number-of-trapezoids-i.cpp
count-number-of-trapezoids-ii.cpp		count-number-of-trapezoids-ii.cpp
count-odd-numbers-in-an-interval-range.cpp		count-odd-numbers-in-an-interval-range.cpp
count-operations-to-obtain-zero.cpp		count-operations-to-obtain-zero.cpp
count-partitions-with-even-sum-difference.cpp		count-partitions-with-even-sum-difference.cpp
count-partitions-with-max-min-difference-at-most-k.cpp		count-partitions-with-max-min-difference-at-most-k.cpp
count-special-triplets.cpp		count-special-triplets.cpp
count-square-submatrices-with-all-ones.cpp		count-square-submatrices-with-all-ones.cpp
count-square-sum-triples.cpp		count-square-sum-triples.cpp
count-subarrays-of-length-three-with-a-condition.ts		count-subarrays-of-length-three-with-a-condition.ts
count-submatrices-with-all-ones.cpp		count-submatrices-with-all-ones.cpp
count-the-number-of-computer-unlocking-permutations.cpp		count-the-number-of-computer-unlocking-permutations.cpp
count-the-number-of-substrings-with-dominant-ones.cpp		count-the-number-of-substrings-with-dominant-ones.cpp
count-unguarded-cells-in-the-grid.cpp		count-unguarded-cells-in-the-grid.cpp
counting-bits.cpp		counting-bits.cpp
coupon-code-validator.cpp		coupon-code-validator.cpp
customers-who-never-order.sql		customers-who-never-order.sql
decode-ways.cpp		decode-ways.cpp
delete-columns-to-make-sorted-ii.cpp		delete-columns-to-make-sorted-ii.cpp
delete-columns-to-make-sorted-iii.cpp		delete-columns-to-make-sorted-iii.cpp
delete-columns-to-make-sorted.cpp		delete-columns-to-make-sorted.cpp
delete-duplicate-emails.sql		delete-duplicate-emails.sql
delete-nodes-from-linked-list-present-in-array.cpp		delete-nodes-from-linked-list-present-in-array.cpp
design-a-food-rating-system.cpp		design-a-food-rating-system.cpp
design-movie-rental-system.cpp		design-movie-rental-system.cpp
design-spreadsheet.cpp		design-spreadsheet.cpp
design-task-manager.cpp		design-task-manager.cpp
divide-an-array-into-subarrays-with-minimum-cost-i.cpp		divide-an-array-into-subarrays-with-minimum-cost-i.cpp
divide-an-array-into-subarrays-with-minimum-cost-ii.cpp		divide-an-array-into-subarrays-with-minimum-cost-ii.cpp
divide-two-integers.cpp		divide-two-integers.cpp
duplicate-emails.sql		duplicate-emails.sql

Repository files navigation

#include <algorithm>
#include <string>

class Solution {
public:
  std::string licenseKeyFormatting(std::string s, int k) {
    std::string upperChars, ans;
    int count = 0;

    for (char &c : s)
      if (c != '-')
        upperChars += toupper(c);

    for (int i = upperChars.size() - 1; i >= 0; --i) {
      if (count == k) {
        ans += '-';
        count = 0;
      }

      ans += upperChars[i];
      ++count;
    }

    std::reverse(ans.begin(), ans.end());
    return ans;
  }
};