amazon interview
First, you should absolutely know your basics as a few others have already stated. But, the advantage to using these sites is that some of them, like HackerRank, could very well be the platform that's used during your interview since they are a HackerRank customer. If you're familiar with the platform and have a rough idea of the question formats, it could give you an edge over people who've not practiced on that platform before.
GeeksforGeeks is enough. Recently I cleared AMAZON interview (SDE-1) and all the questions are from Geeksforgeeks. and some CS fundamentals (OS,DS,DBMS,Networks).
Practice geeksforgeeks and write clear code on paper. you can practice on leetcode also for handling edge cases and various types of questions.
Topics you should focus -
- Tree traversals and other tree questions.
- simple linked list and array questions.
- BFS,DFS.
- some questions based on graph.
- Dynamic Programming.
- work on your coding skills, Try to write clear and simple codes which are syntactically correct and don't forget to handle all edge cases.
- Time complexity and space complexity of each algorithm, and they can ask proof of that algorithm.
- You have to give optimal solution and code for that.
- If you are applying off campus then there may be a design round so practice some basic design.
If you want to practice coding questions, the best site I've seen for this is InterviewBit. After that, you can read people's interview experiences on GeeksforGeeks.org and see questions recently asked at companies on Glassdoor.com or CareerCup.com.
Best resources that come to my mind are
Page on geeksforgeeks.org
Programming Interview Questions | CareerCup
Interview Guide - Amazon [E-Book]
I would give my honest answer - None of them.
Amazon would be having an algorithmic interview. The best way to prepare for that would be to open GeeksforGeeks and CareerCup. Open up the interview corner, you would find plethora of interview experiences for Amazon. Practice those question hard. GeeksforGeeks would be the best place to prepare for it. Go for it in a structured way, e.g. lets say do all array then link lists then trees. Be prepared to devote each and every single amount of your time to this one purpose. I would wish you All the Best. Cheers!!. :)
P.S. I don't want to say that sites you mentioned are useless but these sites are more of a competitive programming practice platform, hence would help out less effective way for Amazon in 3 months of time.
Just start doing these sets:
Amazon Archives - GeeksforGeeks
I have done that and cleared the Internship Interview of Amazon.
http://oj.Leetcode.com
It has exactly the type of questions that Amazon asks.
Its not about the website you should follow but the types of questions you should do.
Every Online judge is somewhat similar to each other. Practice data structures questions from geeksforgeeks and career cup , use spoj and codechef for practice of AdHoc problems and give as much time as you can , you'll succeed definitely . :)
Sites that go over basic computer science algorithms and data structures. I interviewed with them and it was mostly data structures and algorithm type questions. Know about hashmaps and binary trees and traversing through trees, and graphs, and other stuff related to a grad level course on said topic.
Participate in this coding challenge & stand a chance.
Amazon Developer Hiring Challenge | Developer jobs in April, 2016 on HackerEarth
None of the above.
Forums likes of geeksforgeeks, careercup, glassdoor and few more would be better suited for interviews.
amazon interview的更多相关文章
- Amazon Interview | Set 27
Amazon Interview | Set 27 Hi, I was recently interviewed for SDE1 position for Amazon and got select ...
- Amazon Interview Question: Design an OO parking lot
Design an OO parking lot. What classes and functions will it have. It should say, full, empty and al ...
- Amazon behavior question
Amazon onsite behavior question[一亩三分地论坛面经版] - Powered by Discuz! http://www.1point3acres.com/bbs/thr ...
- Top 25 Most Frequently Asked Interview Core Java Interview Questions And Answers
We are sharing 25 java interview questions , these questions are frequently asked by the recruiters. ...
- Find longest contiguous sub array
It's still an Amazon interview question. Given an array containing only stars '*' and hashes '#' . F ...
- Select the best path in a matrix
Amazon interview question: Given a 2-dimensional array with arbitrary sizes and contains random posi ...
- 面试题： generate an equation, by inserting operator add ("+") and minus ("-") among the array to make equationExpression == 0
package com.Amazon.interview; /** * @Author: weblee * @Email: likaiweb@163.com * @Blog: http://www.c ...
- Google Interview University - 坚持完成这套学习手册，你就可以去 Google 面试了
作者:Glowin链接:https://zhuanlan.zhihu.com/p/22881223来源:知乎著作权归作者所有.商业转载请联系作者获得授权,非商业转载请注明出处. 原文地址:Google ...
- interview material
Articles Recommended: Steve Yegge – Get That Job at Google [web] Carlos Bueno – Get That Job at Face ...
随机推荐
- C#中通过Lambda表达式为委托传入更多的参数
如: DispatcherTimer dispatcherTimer = new DispatcherTimer(); dispatcherTimer.Tick += (o, e) => { d ...
- Oracle数据库之PL/SQL程序基础设计
一.PL/SQL块结构 前边我们已经介绍了PL/SQL块的结构,再来回顾一下: DECLARE /* * 声明部分——定义常量.变量.复杂数据类型.游标.用户自定义异常 */ BEGIN /* * 执 ...
- 使用update_attribute和validation
在使用update_attribute方法时,不走validation 走validation的方法: create create! save save! update update_attribut ...
- Redis高可用升级
前言: 缓存对应实时性要求比较高的业务需求可谓十分重要,但缓存中的实时数据一旦丢失,将直接影响整个业务功能.考虑到各场景的业务需求,redis推出了高可用的方案,即:主从+哨兵的HA机制. 准备 &q ...
- Winfrom 基于TCP的Socket服务端 多线程（进阶版）
using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; usin ...
- 【模板】埃拉托色尼筛法 && 欧拉筛法 && 积性函数
埃拉托色尼筛法 朴素算法 1 vis[1]=1; 2 for (int i=2;i<=n;i++) 3 if (!vis[i]) 4 { 5 pri[++tot]=i; 6 for (int j ...
- hdu 1226
超级密码 Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Subm ...
- cookie函数封装
var cookieUtil = { setCookie :function (cname, cvalue, exdays) { var exdate = new Date(); exdate.set ...
- 修复IE7浮动元素自动换行的bug
bug重现以及修复后的表现 2. HTML源码 <!doctype html> <html> <head> <meta charset="utf-8 ...
- cf121C. Lucky Permutation(康托展开)
题意 题目链接 Sol 由于阶乘的数量增长非常迅速,而\(k\)又非常小,那么显然最后的序列只有最后几位会发生改变. 前面的位置都是\(i = a[i]\).那么前面的可以直接数位dp/爆搜,后面的部 ...