To the Top
File:  root - text - article - 2019 - 10 - find-the-non-duplicate-number.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 257 Views, 17208 Search Bots | 60 Words

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

Given a list of numbers, where every number shows up twice except for one number, find that one number.

Example:
Input: [4, 3, 2, 4, 1, 3, 2]
Output: 1
Here's the function signature:


def singleNumber(nums):
# Fill this in.

print singleNumber([4, 3, 2, 4, 1, 3, 2])
# 1


Challenge: Find a way to do this using O(1) memory.
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Cateogry: Computing | 257 Views, 17208 Search Bots | 60 Words Subscribe to Feed Burner

Related Articles

  1. Algorithm Interview Question: Symmetric k-ary Tree
  2. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  3. Daily Interview Problem: Trapping Rainwater
  4. First and Last Indices of an Element in a Sorted Array
  5. Daily Interview Problem: 3 Sum
  6. Kaprekar
  7. Staying on a Chess Board
  8. Algorithm Interview: Longest Consecutive Sequence
  9. Daily Interview Problem: Validate Binary Search Tree
  10. Daily Interview Problem: First Missing Positive Integer

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