File: root - text - article - 2020 - 02 - kaprekar.txt.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 871 Views, 21039 Search Bots | 134 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 871 Views, 21039 Search Bots | 134 Words
| Browse | Archive
Hi, here's your problem today. This problem was recently asked by Facebook:
Kaprekar's Constant is the number 6174. This number is special because it has the property where for any 4-digit number that has 2 or more unique digits, if you repeatedly apply a certain function it always reaches the number 6174.
This certain function is as follows:
- Order the number in ascending form and descending form to create 2 numbers.
- Pad the descending number with zeros until it is 4 digits in length.
- Subtract the ascending number from the descending number.
- Repeat.
Given a number n, find the number of times the function needs to be applied to reach Kaprekar's constant. Here's some starter code:
KAPREKAR_CONSTANT = 6174
def num_kaprekar_iterations(n):
# Fill this in.
print num_kaprekar_iterations(123)
# 3
# Explanation:
# 3210 - 123 = 3087
# 8730 - 0378 = 8352
# 8532 - 2358 = 6174 (3 iterations)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 871 Views, 21039 Search Bots | 134 Words Kaprekar's Constant is the number 6174. This number is special because it has the property where for any 4-digit number that has 2 or more unique digits, if you repeatedly apply a certain function it always reaches the number 6174.
This certain function is as follows:
- Order the number in ascending form and descending form to create 2 numbers.
- Pad the descending number with zeros until it is 4 digits in length.
- Subtract the ascending number from the descending number.
- Repeat.
Given a number n, find the number of times the function needs to be applied to reach Kaprekar's constant. Here's some starter code:
KAPREKAR_CONSTANT = 6174
def num_kaprekar_iterations(n):
# Fill this in.
print num_kaprekar_iterations(123)
# 3
# Explanation:
# 3210 - 123 = 3087
# 8730 - 0378 = 8352
# 8532 - 2358 = 6174 (3 iterations)
Related Articles
- Daily Interview Problem: Find the k-th Largest Element in a List
- Spreadsheet Columns
- Daily Interview Problem: Word Ordering in a Different Alphabetical Order
- Daily Interview Problem: Queue Using Two Stacks
- Algorithm Interview: Permutations of numbers
- Daily Interview Puzzle: Intersection of Linked Lists
- Progess made
- Daily Interview Problem: Validate Binary Search Tree
- Algorithm Interview Question: Find the Single Element in an Array of Duplicates
- Sort a Partially Sorted List
©2006~2024 SteakOverCooked - 0.0123 Seconds(s) - 1614.587 KB/s - 17 Online Memory: 493.91 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !