Skip to contentSkip to footer

Technical Support Analyst Iii Interview Questions

Salaries
Interviews

5,704 technical support analyst iii interview questions shared by candidates

In Person with 4 people (~45min each): 1. Check if binary tree A is contained in binary tree B. Write code on paper. 2. Derive a formula for calculating the angle between the hour hand and minute hand in a clock. 3. Design a parking lot. Discuss what data structures to use.
avatar

Software Development Engineer III

Interviewed at Amazon

3.5★
Jul 18, 2012

In Person with 4 people (~45min each): 1. Check if binary tree A is contained in binary tree B. Write code on paper. 2. Derive a formula for calculating the angle between the hour hand and minute hand in a clock. 3. Design a parking lot. Discuss what data structures to use.

Amazon needs a simple service to create, read, update and delete customer addresses. 1. Write the interface for this service. What methods are needed? What parameters would each method require and what data would each method return? 2. Using the following assumptions, describe how you would design your system: You need to store 10 TB of addresses. Your service must support 10,000 transactions per second. Each of your databases can only handle 1TB of data. Each of your application servers can only handle 1,000 TPS Question 1: 1. What is the runtime complexity for the code below? 2. What is the space complexity for the code below? Queue<TreeNode> queue = new LinkedList<BinaryTree.TreeNode>() ; public void myMethod(TreeNode root) { if (root == null) return; queue.clear(); queue.add(root); while(!queue.isEmpty()){ TreeNode node = queue.remove(); if(node.left != null) queue.add(node.left); if(node.right != null) queue.add(node.right); Question 2: 1. What is the runtime complexity for the code below? // Precondition: array[] is sorted int search(int array[], int numberToFind, int min, int max) { while (max >= min) { int index = midpoint(min, max); if(array[index] == numberToFind) return index; else if (array[index] < numberToFind) min = index + 1; else max = index - 1; } // numberToFind was not found System.out.println("Not Found"); }
avatar

Software Development Engineer III

Interviewed at Amazon

3.5★
Jan 13, 2015

Amazon needs a simple service to create, read, update and delete customer addresses. 1. Write the interface for this service. What methods are needed? What parameters would each method require and what data would each method return? 2. Using the following assumptions, describe how you would design your system: You need to store 10 TB of addresses. Your service must support 10,000 transactions per second. Each of your databases can only handle 1TB of data. Each of your application servers can only handle 1,000 TPS Question 1: 1. What is the runtime complexity for the code below? 2. What is the space complexity for the code below? Queue<TreeNode> queue = new LinkedList<BinaryTree.TreeNode>() ; public void myMethod(TreeNode root) { if (root == null) return; queue.clear(); queue.add(root); while(!queue.isEmpty()){ TreeNode node = queue.remove(); if(node.left != null) queue.add(node.left); if(node.right != null) queue.add(node.right); Question 2: 1. What is the runtime complexity for the code below? // Precondition: array[] is sorted int search(int array[], int numberToFind, int min, int max) { while (max >= min) { int index = midpoint(min, max); if(array[index] == numberToFind) return index; else if (array[index] < numberToFind) min = index + 1; else max = index - 1; } // numberToFind was not found System.out.println("Not Found"); }

Viewing 1121 - 1130 interview questions

Glassdoor has 5,704 interview questions and reports from Technical support analyst iii interviews. Prepare for your interview. Get hired. Love your job.