GitHub - amitbansal7/leetcode: leetcode solutions

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 519 Commits
.gitignore		.gitignore
01-matrix.cpp		01-matrix.cpp
2-keys-keyboard.cpp		2-keys-keyboard.cpp
3sum.cpp		3sum.cpp
4sum-ii.cpp		4sum-ii.cpp
4sum.cpp		4sum.cpp
accounts-merge.cpp		accounts-merge.cpp
add-and-search-word-data-structure-design.cpp		add-and-search-word-data-structure-design.cpp
add-binary.cpp		add-binary.cpp
add-digits.cpp		add-digits.cpp
add-one-row-to-tree.cpp		add-one-row-to-tree.cpp
add-strings.cpp		add-strings.cpp
add-to-array-form-of-integer.cpp		add-to-array-form-of-integer.cpp
add-two-numbers-ii.cpp		add-two-numbers-ii.cpp
add-two-numbers.cpp		add-two-numbers.cpp
all-elements-in-two-binary-search-trees.cpp		all-elements-in-two-binary-search-trees.cpp
all-nodes-distance-k-in-binary-tree.cpp		all-nodes-distance-k-in-binary-tree.cpp
all-paths-from-source-to-target.cpp		all-paths-from-source-to-target.cpp
all-possible-full-binary-trees.cpp		all-possible-full-binary-trees.cpp
alphabet-board-path.cpp		alphabet-board-path.cpp
arithmetic-slices.cpp		arithmetic-slices.cpp
arranging-coins.cpp		arranging-coins.cpp
array-partition-i.cpp		array-partition-i.cpp
array-partition-i.scala		array-partition-i.scala
array-transformation.cpp		array-transformation.cpp
as-far-from-land-as-possible.py		as-far-from-land-as-possible.py
average-of-levels-in-binary-tree.cpp		average-of-levels-in-binary-tree.cpp
backspace-string-compare.cpp		backspace-string-compare.cpp
balanced-binary-tree.cpp		balanced-binary-tree.cpp
balanced-binary-tree.py		balanced-binary-tree.py
beautiful-arrangement.cpp		beautiful-arrangement.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.cpp		best-time-to-buy-and-sell-stock.cpp
binary-number-with-alternating-bits.cpp		binary-number-with-alternating-bits.cpp
binary-search-tree-iterator.cpp		binary-search-tree-iterator.cpp
binary-search-tree-to-greater-sum-tree.cpp		binary-search-tree-to-greater-sum-tree.cpp
binary-string-with-substrings-representing-1-to-n.cpp		binary-string-with-substrings-representing-1-to-n.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-level-order-traversal.py		binary-tree-level-order-traversal.py
binary-tree-maximum-path-sum.cpp		binary-tree-maximum-path-sum.cpp
binary-tree-paths.cpp		binary-tree-paths.cpp
binary-tree-paths.py		binary-tree-paths.py
binary-tree-postorder-traversal.cpp		binary-tree-postorder-traversal.cpp
binary-tree-preorder-traversal.cpp		binary-tree-preorder-traversal.cpp
binary-tree-pruning.cpp		binary-tree-pruning.cpp
binary-tree-right-side-view.cpp		binary-tree-right-side-view.cpp
binary-tree-tilt.cpp		binary-tree-tilt.cpp
binary-tree-tilt.py		binary-tree-tilt.py
binary-tree-zigzag-level-order-traversal.cpp		binary-tree-zigzag-level-order-traversal.cpp
brick-wall.cpp		brick-wall.cpp
buddy-strings.cpp		buddy-strings.cpp
bulb-switcher.cpp		bulb-switcher.cpp
burst-balloons.cpp		burst-balloons.cpp
bus-routes.cpp		bus-routes.cpp
camelcase-matching.cpp		camelcase-matching.cpp
can-i-win.cpp		can-i-win.cpp
cheapest-flights-within-k-stops.cpp		cheapest-flights-within-k-stops.cpp
check-completeness-of-a-binary-tree.cpp		check-completeness-of-a-binary-tree.cpp
check-if-it-is-a-straight-line.cpp		check-if-it-is-a-straight-line.cpp
check-if-n-and-its-double-exist.cpp		check-if-n-and-its-double-exist.cpp
check-if-word-is-valid-after-substitutions.cpp		check-if-word-is-valid-after-substitutions.cpp
climbing-stairs.cpp		climbing-stairs.cpp
clone-graph.cpp		clone-graph.cpp
closest-leaf-in-a-binary-tree.cpp		closest-leaf-in-a-binary-tree.cpp
coin-change-2.cpp		coin-change-2.cpp
coin-change.cpp		coin-change.cpp
combination-sum-ii.cpp		combination-sum-ii.cpp
combination-sum-iii.cpp		combination-sum-iii.cpp
combination-sum-iv.cpp		combination-sum-iv.cpp
combination-sum.cpp		combination-sum.cpp
combinations.cpp		combinations.cpp
combinations.py		combinations.py
compare-strings-by-frequency-of-the-smallest-character.cpp		compare-strings-by-frequency-of-the-smallest-character.cpp
compare-version-numbers.cpp		compare-version-numbers.cpp
complement-of-base-10-integer.cpp		complement-of-base-10-integer.cpp
construct-binary-search-tree-from-preorder-traversal.cpp		construct-binary-search-tree-from-preorder-traversal.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-string-from-binary-tree.cpp		construct-string-from-binary-tree.cpp
container-with-most-water.cpp		container-with-most-water.cpp
container-with-most-water.scala		container-with-most-water.scala
contains-duplicate-iii.cpp		contains-duplicate-iii.cpp
contains-duplicate.cpp		contains-duplicate.cpp
contiguous-array.cpp		contiguous-array.cpp
continuous-subarray-sum.cpp		continuous-subarray-sum.cpp
convert-bst-to-greater-tree.cpp		convert-bst-to-greater-tree.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-array-to-binary-search-tree.py		convert-sorted-array-to-binary-search-tree.py
convert-sorted-list-to-binary-search-tree.cpp		convert-sorted-list-to-binary-search-tree.cpp
count-complete-tree-nodes.cpp		count-complete-tree-nodes.cpp
count-negative-numbers-in-a-sorted-matrix.cpp		count-negative-numbers-in-a-sorted-matrix.cpp
count-primes.cpp		count-primes.cpp
count-servers-that-communicate.cpp		count-servers-that-communicate.cpp
counting-bits.cpp		counting-bits.cpp
course-schedule-ii.cpp		course-schedule-ii.cpp
course-schedule.cpp		course-schedule.cpp
cousins-in-binary-tree.cpp		cousins-in-binary-tree.cpp

Repository files navigation

//Runtime: 12 ms
class Solution {
public:
    string licenseKeyFormatting(string S, int K) {
        string s = "";
        for (char c : S) {
            if (c != '-') {
                s += toupper(c);
            }
        }

        if (s.size() == 0)
            return "";
        string res = s.substr(0, s.size() % K);
        s = s.substr(s.size() % K);

        for (int i = 0; i < s.size(); i++) {
            if (res.size() > 0 && i % K == 0) {
                res += '-';
            }
            res.push_back(s[i]);
        }
        return res;
    }
};

License

Licenses found

amitbansal7/leetcode

Folders and files

Latest commit

History