I was asked to implement a cache for storing visited webpages, including some sort of deletion algorithm if the maximum sized was achieved.
Software Development Interview Questions
37,026 software development interview questions shared by candidates
A question about chess, which is similar to the "number of islands" in leetcode.
normal algorithm and data structures problem.
Write a function that receives a huge string and a dictionary, return if it is conformed by existing dictionary words.
Related to solving 2-D matrix problems related to time/space complexity, DFS,BFS
Questions included: array where indexes correspond to the tree node number of a parent node, and values correspond to current tree node number., root having number -1 Write code to recreate a tree (binary tree, bnon-BST). Another question was: given an array of numbers including negative, print the highest sum of the continuous sequence you can find. Another one: difference between hashtable and hashmap, etc. Detailed performance test questions: load, stress, etc tests. Given than these definitions differ from company to company (I attest, as my parent heads performance engineering in large US defense company and this was discussed over and over)...why write down and question every detail from you response and pick on coefficients such as 1.5 versus 2, etc: this is quite nonsensical.
Abstract class vs interface in Java
The phone interview began with a general discussion about the position, the company (Amazon), and my background. This was followed with a test question, asking what would I do if you was in charge of a web-based e-commerce company selling shoes online. In this hypothetical scenario, the marketing dept ran an ad for a few products offering 2-for-1. The website had slowed to a crawl, but overnight had returned to normal. What would I do?
First: 1) Find out if there's a loop in a linked list 2) Reverse all words(not characters in each word) in a string 3) Design a parking lot Second: 1) Given a node, find its successor node in a BST(follow ups: in place, with or without root node, parent node) 2) Given str1 and str2, find if they are rotated strings of each other
The third and final question was the follow: Write an efficient function that returns the n’th Fibonacci number (There are many ways to solve this problem. Please write the most efficient method possible). Each Fibonacci number is the sum of the last two. The first 10 are: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55
Viewing 3111 - 3120 interview questions
See Interview Questions for Similar Jobs
C DeveloperPython DeveloperJava DeveloperSystems DeveloperSoftware Applications EngineerAtg DeveloperSoftware ProgrammerApplications Support EngineerComputer ScientistMobile EngineerSoftware Test EngineerHadoop DeveloperDevops EngineerSoftware Qa EngineerSoftware EngineerMobile DeveloperSenior DeveloperIt DeveloperTechnical Program Manager