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

Related Articles

  1. Daily Interview Problem: Validate Binary Search Tree
  2. Print a tree level-by-level, with line-breaks
  3. Daily Interview Puzzle: Ways to Traverse a Grid
  4. Daily Interview Problem: Trapping Rainwater
  5. Daily Interview Puzzle: Intersection of Linked Lists
  6. Detect Linked List Cycle
  7. Patterns for breaking down questions you haven
  8. Skip the readings, focus on problems. And use all the hints!
  9. Algorithm Interview: Convert Roman Numerals to Decimal
  10. A trick for getting good at coding interviews FASTER

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