To the Top
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 | 339 Views, 22786 Search Bots | 41 Words

Subscribe to Feed Burner | 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

def largestNum(nums):
# Fill this in.

print largestNum([17, 7, 2, 45, 72])
# 77245217
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 339 Views, 22786 Search Bots | 41 Words Subscribe to Feed Burner

Related Articles

  1. Most Frequent Subtree Sum
  2. Daily Interview Puzzle: Minimum Size Subarray Sum
  3. Daily Interview Problem: Buddy Strings
  4. Non-decreasing Array with Single Modification
  5. Fibonacci coding
  6. Daily Interview Problem: Count Number of Unival Subtrees
  7. Staying on a Chess Board
  8. Daily Interview Problem: First Missing Positive Integer
  9. Daily Interview Problem: Validate Binary Search Tree
  10. Daily Interview Problem: Contiguous Subarray with Maximum Sum

Comments (0)

Your Email (Domain Part Not Exposed):

Your Comments:

Privately By Mail Colors More Smileys S x y @

Verification (Click Image 2 Refresh):

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />