To the Top
File:  root - text - article - 2020 - 01 - find-the-single-element-in-an-array-of-duplicates.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 195 Views, 30185 Search Bots | 68 Words

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

Given an array of integers, arr, where all numbers occur twice except one number which occurs once, find the number. Your solution should ideally be O(n) time and use constant extra space.
Example:
Input: arr = [7, 3, 5, 5, 4, 3, 4, 8, 8]
Output: 7


class Solution(object):
def findSingle(self, nums):
# Fill this in.

nums = [1, 1, 3, 4, 4, 5, 6, 5, 6]
print(Solution().findSingle(nums))
# 3
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 195 Views, 30185 Search Bots | 68 Words Subscribe to Feed Burner

Related Articles

  1. Algorithm Interview Question: Symmetric k-ary Tree
  2. Algorithm Interview: Permutations of numbers
  3. Daily Interview Puzzle: Minimum Size Subarray Sum
  4. Algorithm Interview: Level Order Traversal of Binary Tree
  5. Generate All IP Addresses
  6. Daily Interview Problem: Product of Array Except Self
  7. Daily Interview Problem: Count Number of Unival Subtrees
  8. Maximum In A Stack
  9. Daily Interview Puzzle: Intersection of Linked Lists
  10. [Daily Problem] Witness of The Tall People

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