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

Related Articles

  1. Daily Interview Problem: Deepest Node in a Binary Tree
  2. Daily Interview Problem: Longest Substring With K Distinct Characters
  3. How to Play WAV music under DOS?
  4. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  5. Skip the readings, focus on problems. And use all the hints!
  6. Daily Interview Problem: Room scheduling
  7. Daily Interview Puzzle: Minimum Size Subarray Sum
  8. Algorithm Interview: Determine If Linked List is Palindrome
  9. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  10. Two Tricks of Delphi

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="noindex, follow" />