GitHub - Arnabhit/CodeHUB

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 895 Commits
1-two-sum		1-two-sum
10-regular-expression-matching		10-regular-expression-matching
100-same-tree		100-same-tree
1004-max-consecutive-ones-iii		1004-max-consecutive-ones-iii
101-symmetric-tree		101-symmetric-tree
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
11-container-with-most-water		11-container-with-most-water
110-balanced-binary-tree		110-balanced-binary-tree
112-path-sum		112-path-sum
113-path-sum-ii		113-path-sum-ii
1137-n-th-tribonacci-number		1137-n-th-tribonacci-number
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
115-distinct-subsequences		115-distinct-subsequences
1155-number-of-dice-rolls-with-target-sum		1155-number-of-dice-rolls-with-target-sum
118-pascals-triangle		118-pascals-triangle
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
120-triangle		120-triangle
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
1220-count-vowels-permutation		1220-count-vowels-permutation
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
125-valid-palindrome		125-valid-palindrome
126-word-ladder-ii		126-word-ladder-ii
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
13-roman-to-integer		13-roman-to-integer
130-surrounded-regions		130-surrounded-regions
1306-jump-game-iii		1306-jump-game-iii
131-palindrome-partitioning		131-palindrome-partitioning
132-palindrome-partitioning-ii		132-palindrome-partitioning-ii
1329-sort-the-matrix-diagonally		1329-sort-the-matrix-diagonally
133-clone-graph		133-clone-graph
1347-minimum-number-of-steps-to-make-two-strings-anagram		1347-minimum-number-of-steps-to-make-two-strings-anagram
135-candy		135-candy
1351-count-negative-numbers-in-a-sorted-matrix		1351-count-negative-numbers-in-a-sorted-matrix
1376-time-needed-to-inform-all-employees		1376-time-needed-to-inform-all-employees
1377. Frog Position After T Seconds		1377. Frog Position After T Seconds
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1383-maximum-performance-of-a-team		1383-maximum-performance-of-a-team
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
148-sort-list		148-sort-list
1481-least-number-of-unique-integers-after-k-removals		1481-least-number-of-unique-integers-after-k-removals
15-3sum		15-3sum
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
1523-count-odd-numbers-in-an-interval-range		1523-count-odd-numbers-in-an-interval-range
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
154-find-minimum-in-rotated-sorted-array-ii		154-find-minimum-in-rotated-sorted-array-ii
1547-minimum-cost-to-cut-a-stick		1547-minimum-cost-to-cut-a-stick
155-min-stack		155-min-stack
1578-minimum-time-to-make-rope-colorful		1578-minimum-time-to-make-rope-colorful
16-3sum-closest		16-3sum-closest
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
1680-concatenation-of-consecutive-binary-numbers		1680-concatenation-of-consecutive-binary-numbers
1691-maximum-height-by-stacking-cuboids		1691-maximum-height-by-stacking-cuboids
17-letter-combinations-of-a-phone-number		17-letter-combinations-of-a-phone-number
1701-average-waiting-time		1701-average-waiting-time
1770-maximum-score-from-performing-multiplication-operations		1770-maximum-score-from-performing-multiplication-operations
1780-check-if-number-is-a-sum-of-powers-of-three		1780-check-if-number-is-a-sum-of-powers-of-three
188-best-time-to-buy-and-sell-stock-iv		188-best-time-to-buy-and-sell-stock-iv
1886-determine-whether-matrix-can-be-obtained-by-rotation		1886-determine-whether-matrix-can-be-obtained-by-rotation
189-rotate-array		189-rotate-array
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
1909-remove-one-element-to-make-the-array-strictly-increasing		1909-remove-one-element-to-make-the-array-strictly-increasing
191-number-of-1-bits		191-number-of-1-bits
1964_Largest-Number-After-Mutating-Substring		1964_Largest-Number-After-Mutating-Substring
198-house-robber		198-house-robber
1984-minimum-difference-between-highest-and-lowest-of-k-scores		1984-minimum-difference-between-highest-and-lowest-of-k-scores
199-binary-tree-right-side-view		199-binary-tree-right-side-view
1996-the-number-of-weak-characters-in-the-game		1996-the-number-of-weak-characters-in-the-game
20-valid-parentheses		20-valid-parentheses
200-number-of-islands		200-number-of-islands
2007-find-original-array-from-doubled-array		2007-find-original-array-from-doubled-array
2016-maximum-difference-between-increasing-elements		2016-maximum-difference-between-increasing-elements
207-course-schedule		207-course-schedule
2078-two-furthest-houses-with-different-colors		2078-two-furthest-houses-with-different-colors
208-implement-trie-prefix-tree		208-implement-trie-prefix-tree
209-minimum-size-subarray-sum		209-minimum-size-subarray-sum
2095-delete-the-middle-node-of-a-linked-list		2095-delete-the-middle-node-of-a-linked-list
2100-find-good-days-to-rob-the-bank		2100-find-good-days-to-rob-the-bank
213-house-robber-ii		213-house-robber-ii
2144-minimum-cost-of-buying-candies-with-discount		2144-minimum-cost-of-buying-candies-with-discount
217-contains-duplicate		217-contains-duplicate
22-generate-parentheses		22-generate-parentheses
2224-minimum-number-of-operations-to-convert-time		2224-minimum-number-of-operations-to-convert-time
226-invert-binary-tree		226-invert-binary-tree
2289-steps-to-make-array-non-decreasing		2289-steps-to-make-array-non-decreasing
23-Merge-k-Sorted-Lists		23-Merge-k-Sorted-Lists
230-kth-smallest-element-in-a-bst		230-kth-smallest-element-in-a-bst
231-Power-of-Two		231-Power-of-Two
231-power-of-two		231-power-of-two
234-palindrome-linked-list		234-palindrome-linked-list
235-lowest-common-ancestor-of-a-binary-search-tree		235-lowest-common-ancestor-of-a-binary-search-tree
2350-shortest-impossible-sequence-of-rolls		2350-shortest-impossible-sequence-of-rolls
2351-first-letter-to-appear-twice		2351-first-letter-to-appear-twice
236-lowest-common-ancestor-of-a-binary-tree		236-lowest-common-ancestor-of-a-binary-tree
2360. Longest Cycle in a Graph		2360. Longest Cycle in a Graph

Repository files navigation

Given an integer number n, return the difference between the product of its digits and the sum of its digits.

Example 1:

Input: n = 234 Output: 15 Explanation: Product of digits = 2 * 3 * 4 = 24 Sum of digits = 2 + 3 + 4 = 9 Result = 24 - 9 = 15

Example 2:

Input: n = 4421 Output: 21 Explanation: Product of digits = 4 * 4 * 2 * 1 = 32 Sum of digits = 4 + 4 + 2 + 1 = 11 Result = 32 - 11 = 21

Constraints:

1 <= n <= 10^5

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

About

Releases

Packages

Languages

License

Arnabhit/CodeHUB

Folders and files

Latest commit

History

Repository files navigation

About

Resources

License

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages