File: root - text - article - 2020 - 01 - make-the-largest-number.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 343 Views, 23405 Search Bots | 41 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 343 Views, 23405 Search Bots | 41 Words
| Browse | Archive
Hi, here's your problem today. This problem was recently asked by Uber:
Given a number of integers, combine them so it would create the largest number.
Example:
Input: [17, 7, 2, 45, 72]
Output: 77245217
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 343 Views, 23405 Search Bots | 41 Words Given a number of integers, combine them so it would create the largest number.
Example:
Input: [17, 7, 2, 45, 72]
Output: 77245217
def largestNum(nums):
# Fill this in.
print largestNum([17, 7, 2, 45, 72])
# 77245217
Related Articles
- Daily Interview Problem: Reverse Words in a String
- CVE-2015-8874 - cPanel EasyApache Vulnerabilities
- ImageMagick Vulnerabilities - CVE-2016–3714
- A trick for getting good at coding interviews FASTER
- Find Pythagorean Triplets
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
- Daily Interview Problem: Full Binary Tree
- [Daily Problem] Course Prerequisites
- Reverse a Directed Graph
- Progess made
©2006~2024 SteakOverCooked - 0.01437 Seconds(s) - 3755.691 KB/s - 24 Online Memory: 515.84 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="noindex, 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 !