GitHub - SamirPaul1/Python-3: 🐍📚 This is a concise Python 3 programming tutorial for people who think that reading is boring. I try to show everything with simple code examples.

SamirPaul1 / Python-3 Public

forked from SamirPaulb/LeetCode

Notifications You must be signed in to change notification settings
Fork 0
Star 0

🐍📚 This is a concise Python 3 programming tutorial for people who think that reading is boring. I try to show everything with simple code examples.

samirpaul1.github.io/Python-3/

0 stars 38 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 4,814 Commits
Sorry, we had to truncate this directory to 1,000 files. 177 entries were omitted from the list.
.github/workflows		.github/workflows
0001-two-sum		0001-two-sum
0002-add-two-numbers		0002-add-two-numbers
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0004-median-of-two-sorted-arrays		0004-median-of-two-sorted-arrays
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0006-zigzag-conversion		0006-zigzag-conversion
0010-regular-expression-matching		0010-regular-expression-matching
0012-integer-to-roman		0012-integer-to-roman
0013-roman-to-integer		0013-roman-to-integer
0014-longest-common-prefix		0014-longest-common-prefix
0015-3sum		0015-3sum
0017-letter-combinations-of-a-phone-number		0017-letter-combinations-of-a-phone-number
0018-4sum		0018-4sum
0020-valid-parentheses		0020-valid-parentheses
0022-generate-parentheses		0022-generate-parentheses
0023-merge-k-sorted-lists		0023-merge-k-sorted-lists
0025-reverse-nodes-in-k-group		0025-reverse-nodes-in-k-group
0027-remove-element		0027-remove-element
0028-find-the-index-of-the-first-occurrence-in-a-string		0028-find-the-index-of-the-first-occurrence-in-a-string
0031-next-permutation		0031-next-permutation
0033-search-in-rotated-sorted-array		0033-search-in-rotated-sorted-array
0035-search-insert-position		0035-search-insert-position
0037-sudoku-solver		0037-sudoku-solver
0039-combination-sum		0039-combination-sum
0040-combination-sum-ii		0040-combination-sum-ii
0042-trapping-rain-water		0042-trapping-rain-water
0043-multiply-strings		0043-multiply-strings
0044-wildcard-matching		0044-wildcard-matching
0045-jump-game-ii		0045-jump-game-ii
0046-permutations		0046-permutations
0050-powx-n		0050-powx-n
0051-n-queens		0051-n-queens
0052-n-queens-ii		0052-n-queens-ii
0053-maximum-subarray		0053-maximum-subarray
0056-merge-intervals		0056-merge-intervals
0057-insert-interval		0057-insert-interval
0060-permutation-sequence		0060-permutation-sequence
0062-unique-paths		0062-unique-paths
0064-minimum-path-sum		0064-minimum-path-sum
0067-add-binary		0067-add-binary
0069-sqrtx		0069-sqrtx
0070-climbing-stairs		0070-climbing-stairs
0072-edit-distance		0072-edit-distance
0075-sort-colors		0075-sort-colors
0076-minimum-window-substring		0076-minimum-window-substring
0084-largest-rectangle-in-histogram		0084-largest-rectangle-in-histogram
0085-maximal-rectangle		0085-maximal-rectangle
0086-partition-list		0086-partition-list
0087-scramble-string		0087-scramble-string
0088-merge-sorted-array		0088-merge-sorted-array
0090-subsets-ii		0090-subsets-ii
0091-decode-ways		0091-decode-ways
0093-restore-ip-addresses		0093-restore-ip-addresses
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0096-unique-binary-search-trees		0096-unique-binary-search-trees
0098-validate-binary-search-tree		0098-validate-binary-search-tree
0100-same-tree		0100-same-tree
0101-symmetric-tree		0101-symmetric-tree
0102-binary-tree-level-order-traversal		0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal		0103-binary-tree-zigzag-level-order-traversal
0105-construct-binary-tree-from-preorder-and-inorder-traversal		0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal		0106-construct-binary-tree-from-inorder-and-postorder-traversal
0109-convert-sorted-list-to-binary-search-tree		0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree		0110-balanced-binary-tree
0114-flatten-binary-tree-to-linked-list		0114-flatten-binary-tree-to-linked-list
0115-distinct-subsequences		0115-distinct-subsequences
0117-populating-next-right-pointers-in-each-node-ii		0117-populating-next-right-pointers-in-each-node-ii
0118-pascals-triangle		0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii		0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii		0123-best-time-to-buy-and-sell-stock-iii
0124-binary-tree-maximum-path-sum		0124-binary-tree-maximum-path-sum
0127-word-ladder		0127-word-ladder
0129-sum-root-to-leaf-numbers		0129-sum-root-to-leaf-numbers
0130-surrounded-regions		0130-surrounded-regions
0133-clone-graph		0133-clone-graph
0134-gas-station		0134-gas-station
0135-candy		0135-candy
0136-single-number		0136-single-number
0137-single-number-ii		0137-single-number-ii
0138-copy-list-with-random-pointer		0138-copy-list-with-random-pointer
0139-word-break		0139-word-break
0140-word-break-ii		0140-word-break-ii
0141-linked-list-cycle		0141-linked-list-cycle
0142-linked-list-cycle-ii		0142-linked-list-cycle-ii
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0146-lru-cache		0146-lru-cache
0147-insertion-sort-list		0147-insertion-sort-list
0149-max-points-on-a-line		0149-max-points-on-a-line
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0154-find-minimum-in-rotated-sorted-array-ii		0154-find-minimum-in-rotated-sorted-array-ii
0155-min-stack		0155-min-stack
0160-intersection-of-two-linked-lists		0160-intersection-of-two-linked-lists
0165-compare-version-numbers		0165-compare-version-numbers
0166-fraction-to-recurring-decimal		0166-fraction-to-recurring-decimal
0169-majority-element		0169-majority-element
0171-excel-sheet-column-number		0171-excel-sheet-column-number
0174-dungeon-game		0174-dungeon-game

Repository files navigation

class Solution(object):
    def licenseKeyFormatting(self, S, K):
        """
        :type S: str
        :type K: int
        :rtype: str
        """
        # https://leetcode.com/problems/license-key-formatting/discuss/96497/Python-solution
        S = S.upper().replace('-', '')
        ls = len(S)
        if ls % K == 0:
            pos = K
        else:
            pos = ls % K
        res = S[:pos]
        while pos < ls:
            res += '-' + S[pos:pos + K]
            pos += K
        return res