2016q3 Homework1(面試題目)
===
>contributed by [name=汝敷][color=#a7a2e5]

#### ==++參考++==：課程資料[^課程資料]、題庫[^題庫]、ptt[^pttJob]、心得[^心得]、其他[^其他]
###### tags: `汝敷` `面試題目資料整理`
## 1.
公司名稱：模擬試題
職務說明：N/A
面試題目：

Find Out if a Linked List has a Cycle:
Without marking nodes, find out if a linked list has a cycle in it or not.

流程： N/A
出處：[TechInterview](http://www.techinterview.org/post/3233459676/function-that-multiples-2-integers/)

---
## 2.
公司名稱：模擬試題
職務說明：N/A
面試題目：

You are given two linked lists representing two non-negative numbers.
The digits are stored in reverse order and each of their nodes contain a 
single digit. 
Add the two numbers and return it as a linked list.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

流程： N/A
出處：[LeetCode--[Add Two Numbers]](https://leetcode.com/problems/add-two-numbers/)

---

## 3.
公司名稱：模擬試題
職務說明：N/A
面試題目：

Given an integer array of size n, 
find all elements that appear more than ⌊ n/3 ⌋ times. 
The algorithm should run in linear time and in O(1) space.

流程： N/A
出處：[LeetCode--[Majority Element II]](https://leetcode.com/problems/majority-element-ii/)

---

[^課程資料]:[資訊科技產業專案設計 (2016 Fall)](https://hackmd.io/s/rJjo0UMa)

[^題庫]:題庫：
[LeetCode](https://leetcode.com/)
[LintCode](http://www.lintcode.com/zh-cn/)
[Codility](https://codility.com/)
[HackerRank](https://www.hackerrank.com/)
[GeeksforGeeks](http://www.geeksforgeeks.org/) 有很多面試題目的答案分享
[CareerCup](https://www.careercup.com/) 可以找到最近別人po的面試題目

[^pttJob]:ptt job版：
[Tech job版](https://www.ptt.cc/man/Tech_Job/index.html)
[Soft job版](https://www.ptt.cc/bbs/Soft_Job/index.html)

[^心得]:別人的心得：
[新鮮人面試紀錄](https://blog.m157q.tw/posts/2016/02/12/first-job-interviews/)

[^其他]:[GlassDoor](https://www.glassdoor.com/index.htm) 查公司的年薪，還有面試經驗