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 | 448 Views, 20622 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 | 448 Views, 20622 Search Bots | 60 Words Subscribe to Feed Burner

Related Articles

  1. Skip the readings, focus on problems. And use all the hints!
  2. Find Pythagorean Triplets
  3. Find Missing Numbers in an Array
  4. Daily Interview Problem: Running Median
  5. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  6. Reverse a Linked List
  7. [Daily Problem] Longest Palindromic Substring
  8. Print a tree level-by-level, with line-breaks
  9. Daily Interview Question: Find Cycles in a Graph
  10. Algorithm Interview: Subarray With Target Sum

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