页面顶部 Top
文件:  root - text - article - 2019 - 11 - find-the-k-th-largest-element-in-a-list.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 233 次阅读, 28413 次搜索 | 66 个单词

定阅此目录的博客 | 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Facebook:

By the way, check out our NEW project AlgoPro (http://algopro.com) for over 60+ video coding sessions with ex-Google/ex-Facebook engineers.

Given a list, find the k-th largest element in the list.
Input: list = [3, 5, 2, 4, 6, 8], k = 3
Output: 5
Here is a starting point:



def findKthLargest(nums, k):

  # Fill this in.



print findKthLargest([3, 5, 2, 4, 6, 8], 3)

# 5
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 233 次阅读, 28413 次搜索 | 66 个单词 定阅此目录的博客

猜您喜欢...

  1. Most Frequent Subtree Sum
  2. Windows Scripting
  3. Detect Linked List Cycle
  4. Batch Programming in XP
  5. Number of Ways to Climb Stairs
  6. Algorithm Interview: Subarray With Target Sum
  7. Daily Interview Problem: Merge K Sorted Linked Lists
  8. Find Missing Numbers in an Array
  9. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  10. A trick for getting good at coding interviews FASTER

评论 (0)

读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />