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 | 227 Views, 20444 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 | 227 Views, 20444 Search Bots | 84 Words Subscribe to Feed Burner

Related Articles

  1. Algorithm Interview Question: H-Index
  2. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  3. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  4. Fibonacci coding
  5. Daily Interview Problem: Find the Number of Islands
  6. Daily Interview Problem: Min Stack
  7. [Daily Problem] Add two numbers as a linked list
  8. Longest Substring Without Repeating Characters
  9. Detect Linked List Cycle
  10. Skip the readings, focus on problems. And use all the hints!

Comments (0)

    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" />