To the Top
File:  root - text - article - 2020 - 02 - find-missing-numbers-in-an-array.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 157 Views, 18085 Search Bots | 84 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Twitter:

Given an array of integers of size n, where all elements are between 1 and n inclusive, find all of the elements of [1, n] that do not appear in the array. Some numbers may appear more than once.

Example:
Input: [4,5,2,6,8,2,1,5]
Output: [3,7]

class Solution(object):
def findDisappearedNumbers(self, nums):
# Fill this in.

nums = [4, 6, 2, 6, 7, 2, 1]
print(Solution().findDisappearedNumbers(nums))
# [3, 5]

For this problem, you can assume that you can mutate the input array.
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 157 Views, 18085 Search Bots | 84 Words Subscribe to Feed Burner

Related Articles

  1. Algorithm Interview Question: Max and Min with Limited Comparisons
  2. Spectrum Master
  3. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  4. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  5. [Daily Problem] Validate Balanced Parentheses
  6. Algorithm Interview: No Adjacent Repeating Characters
  7. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  8. Multitasking
  9. Daily Interview Problem: Tree Serialization
  10. Daily Interview Problem: Merge K Sorted Linked Lists

Comments (0)

    Be the first one to comment this page !


Page Edited: October 30 2020 14:21:09 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">