Mobile sales associate Interview Questions | Glassdoor

# Mobile sales associate Interview Questions

1,423

mobile sales associate interview questions shared by candidates

## Top Interview Questions

Sort: RelevancePopular Date

Aug 22, 2014
 If you don't know anything about the cell phone, tablet (ect) the customer is talking about what do you do?1 Answer"You could try and persuade them over to a product that you do know something about, read along and point to the information on the box or display, so you both know what the product is about."

May 11, 2016

### Mobile Software Engineer at Uber was asked...

Sep 15, 2015
 Implement a Sudoko puzzle validator - given a 9x9 matrix of numbers (1-9) and "." for empty spaces, return true for a valid puzzle matrix and false if it would not be a valid sudoku puzzle.4 AnswersI basically just checked for duplicate numbers in each row, column, and then each 3x3 inner matrix. each iteration, i reset a dictionary of "seen" numbers. "." characters wouldn't matter, if i saw a number 1-9 i would check if it was already in the dictionary, if it was return false. return true at the very end if never encountered repeat numbers in rows, columns, or inner squares. when I explained this approach to the interviewer and he seemed satisfied with it although it was not easy to tell what the hell he was thinking or saying. i was working in a shared text file (i think it was codepen?), and even though the interviewer could have typed too, he didn't (even when i had to ask him repeatedly to spell a word i couldn't make out)..Each iteration? You need just an iteration. Complexity o(n).my solution was still O(n) - 3n to be exact. i "iterate" over the entire matrix 3 times - once to check for duplicates in the rows, once to check for duplicates in the columns, and once to check for duplicates within sub matrices. During each of those iterations I visit each element of the matrix exactly once and just check whether it's already in a dictionary of seen numbers which would be a constant time operation, so this is in total would be O(n). I can't think of how to check all those in just one iteration , if that's what you were saying you could do. (at least without using O(n) extra space.. mine only uses constant extra space) i would appreciate if you could elaborateShow More ResponsesO(n) == O(n)-3n It's still the same big-oh complexity.

Nov 17, 2010
 Do you know what "Peak Oil" is? Yes? good. You are the product manager of Peak Oil for Google. What do you do?4 AnswersWhat?!!! No, just kidding. No hints.Leave it up to them to put up a premise that is utterly ridiculous. Peak oil , by definition, is not controlled by anyone. It is the notion that there is a finite timeframe where the oil is no longer. How can a product manager manage "peak oil" when they can't own all of it... I thought all Googlers were smart.peak oil means the oil production reaches the maximum and after which the rate of product enters terminal decline. i guess for this question they are asking how you keep it maximum as long as possible and when it enters terminal decline, what do you do about it.Show More ResponsesSend search parties out to find new oil repositories. :-)

### Mobile Phlebotomist at Schryver Medical was asked...

Jun 29, 2016
 What is the order of draw?3 AnswersRed blue purple gold grayHow I was taught was Sterile Yellow, Light Blue, Red/Gold, light Green, Dark Green Lavender, Black/GrayCultures, red, blue, green, sst, lab.

### Mobile Software Engineer at Nest was asked...

Feb 5, 2016
 Algorithms question was probably the trickiest thing. Given an array of integers of length N from 1 to N-1, how would you detect a single duplicate in the array?3 AnswersThe first solution basically was to add up all the numbers in the array and the for N = 3 and in an array of 1 1 2, which totals to 4, total - N = 1. The duplicate is 1 He then turned up the difficulty to no additional memory space and to do it in big-O N time.a xor a = 0 0 xor a = a so if we xor all elements 1 x 1 x 2 with all possible elements 1x2x3 = 0x3 = 3 still extra memory used but at least no overflow possibility. was it allowed to change the original input ?1) Subtract each number from summation formula = N * (N+1) / 2 2) Hash table , zero out all entries when insert number -> 1 after all insert look for 0 entry 3) XOR all elems -> X XOR all # 1 to N -> Y XOR of X and Y -> missing # 15 ^ 12 ^ 15 = 12

### Mobile Software Engineer at ESPN was asked...

Jan 24, 2013
 What's the angle between the hands of a clock if the time is 3:15.3 AnswersOooooh, this was a sneaky trick question and I'm sorry I fell for it. Under the pressure of an interview, you might accidentally think the angle between the small and the large hands of a clock will pointing at the number "3" and therefore the angle would be zero. If you can keep a clear head, you're likely to realize really quickly that the small (hour) hand is going to be *beyond* the 3 by some relatively small angle. To be more precise, it'll be 1/4th of the distance between the hour numbers "3" and "4".The answer should be a right angle.With 360 degrees in a circle and 12 hours throughout each cycle the distance between each number is 30 degrees. If the minute hand is pointing at the 3 and is fifteen minutes, fifteen minutes is 1/4 of the total amount of minutes on the clock, this puts the hour hand 30/4 degrees passed the 3 at 7.25 degrees. They'll enjoy you thinking analytically.

### Senior Mobile Software Engineer for AWS at Amazon was asked...

May 19, 2013
 Hardest Q was: Here's a binary tree: find the longest path within it. So, find a path between any two leaf nodes, where the path is the longest. 3 AnswersIndians at all companies always ask tree questions, it makes them giggle inside. I know, because I'm half indian and have interviewed people... tee hee heeclass Solution{ int ans[] = new int[1]; //O(n) public int efficientDia(TreeNode root) { if(root == null) return 0; int left = efficientDia(root.left); int right = efficientDia(root.right); ans[0] = Math.max(ans[0], 1 + left+ right); return 1+ Math.max(left, right); } //O(n^2) public int getDiameter(TreeNode root) { if(root == null) return 0; int leftHeight = getHeight(root.left); int rightHeight = getHeight(root.right); if(ans[0] < 1 + leftHeight + rightHeight) { ans[0] = 1 + leftHeight + rightHeight; } return Math.max(getDiameter(root.left), getDiameter(root.right)); }int ans[] = new int[1]; //O(n) public int efficientDia(TreeNode root) { if(root == null) return 0; int left = efficientDia(root.left); int right = efficientDia(root.right); ans[0] = Math.max(ans[0], 1 + left+ right); return 1+ Math.max(left, right); } //O(n^2) public int getDiameter(TreeNode root) { if(root == null) return 0; int leftHeight = getHeight(root.left); int rightHeight = getHeight(root.right); if(ans[0] < 1 + leftHeight + rightHeight) { ans[0] = 1 + leftHeight + rightHeight; } return Math.max(getDiameter(root.left), getDiameter(root.right)); } private int getHeight(TreeNode root) { // TODO Auto-generated method stub if(root == null) return 0; return Math.max(getHeight(root.left), getHeight(root.right))+1; }

### Mobile Phlebotomist at Aculabs was asked...

Dec 28, 2015
 Are you ok with the patients having an attitude at times.2 AnswersYes, I understand the time in which im going into the patients room so I will have compassion.Yes

### Mobile Software Engineer at Envoy was asked...

Nov 17, 2016
 dispatch queues … what are they and how do they work?2 Answersdispatch queues manage the tasks you provide to GCD and execute those tasks in FIFO order. Types of dispatch queues include serial, concurrent and the main dispatch queue (where the UI happens).In these sorts of interviews you really need to drill down and understand what the interviewer is looking for. A good way to simulate a real interview experience is to do a mock with one of the Envoy Mobile Software Engineer experts on Prepfully, rated super strongly on TrustPilot... prepfully.com/practice-interviews
110 of 1,423 Interview Questions