To the Top
File:  root - text - article - 2019 - 12 - given-two-arrays,-write-a-function-to-compute-their-intersection.txt.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 145 Views, 17997 Search Bots | 80 Words

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

Given two arrays, write a function to compute their intersection - the intersection means the numbers that are in both arrays.

Example 1:
Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2]
Example 2:
Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]
Note:
Each element in the result must be unique.
The result can be in any order.

Here's a starting point:


class Solution:
def intersection(self, nums1, nums2):
# Fill this in.

print Solution().intersection([4, 9, 5], [9, 4, 9, 8, 4])
# [9, 4]
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 145 Views, 17997 Search Bots | 80 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Tree Serialization
  2. Algorithm Interview: Make the Largest Number
  3. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  4. Algorithm Interview Question: Max and Min with Limited Comparisons
  5. Daily Interview Problem: Full Binary Tree
  6. Spreadsheet Columns
  7. Algorithm Interview: Level Order Traversal of Binary Tree
  8. Skip the readings, focus on problems. And use all the hints!
  9. Fibonacci coding
  10. Two Tricks of Delphi

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