본문 바로가기

Amazon

Amazon principle (reference : https://www.linkedin.com/in/kisangpak/) Amazon 본사 면접후기: 리더십에 관한 질문들은 어떻게 대답을 해야하나?아마존의 개발자 면접과정은 다른 대기업 테크회사들과 마찬가지로 리크루터와 간단하게 전화통화후 기술전화면접으로 시작하였다. 그동안 접했던 기술전화면접들에 비해 코딩문제가 조금 어려운 편이었으나 그래도 주어진 시간내에 면접관의 힌트와 함께 문제를 끝마칠수 있었다. 그후 몇주 뒤 (2017년 8월) 시애틀로 최종면접을 가게 되었다.아마존 최종면접의 특징은 개발자면접이라고 해도 아마존이 직원들에게 늘 강조하는 Leadership Principles 에 대해 모든 면접관들이 질문을 하는 것으로 유명하다. Attitude, Behavior 등에 관한 질문들인데 예를들어 (다음의 질문들이 꼭 아마존에서 물어본 질문들은 아니고 일반적으로) -“.. 더보기
100 top job interview questions—be prepared for the interview Basic interview questions:Tell me about yourself.What are your strengths?What are your weaknesses?Why do you want this job?Where would you like to be in your career five years from now?What's your ideal company?What attracted you to this company?Why should we hire you?What did you like least about your last job?When were you most satisfied in your job?What can you do for us that other candidates.. 더보기
200. Number of Islands Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water. Example 1: Input: 11110 11010 11000 00000 Output: 1 Example 2: Input: 11000 11000 00100 00011 Output: 3 class Solution { public int numIsland.. 더보기
17. Letter Combinations of a Phone Number Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters. Example: Input: "23" Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]. Note: Although the above answer is in lexicographical order, yo.. 더보기
238. Product of Array Except Self Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i]. Example: Input: [1,2,3,4] Output: [24,12,8,6] Note: Please solve it without division and in O(n). Follow up: Could you solve it with constant space complexity? (The output array does not count as extra space for the purpose of space complex.. 더보기
141. Linked List Cycle Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? /** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */ public class Solution { public boolean hasCycle(ListNode head) { if(head == null || head.next == null) return false; ListNode slow = head; Lis.. 더보기
155. Min Stack Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack. pop() -- Removes the element on top of the stack. top() -- Get the top element. getMin() -- Retrieve the minimum element in the stack. Example: MinStack minStack = new MinStack(); minStack.push(-2); minStack.push(0); minStack.push(-3); minStack.getMin(); --> Ret.. 더보기
819. Most Common Word Given a paragraph and a list of banned words, return the most frequent word that is not in the list of banned words. It is guaranteed there is at least one word that isn't banned, and that the answer is unique. Words in the list of banned words are given in lowercase, and free of punctuation. Words in the paragraph are not case sensitive. The answer is in lowercase. Example: Input: paragraph = ".. 더보기

티스토리툴바