Senior mobile engineer Interview Questions

258

Senior Mobile Engineer interview questions shared by candidates

Top Interview Questions

Sort: Relevance|Popular|Date
Amazon
Senior Mobile Software Engineer for AWS was asked...19 May 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 Answers

class 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)); } Less

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; } Less

Indians 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 hee Less

Gaana

Programming Question: Jay has N friends, there are M different type of tickets. Jay & his friend, each have some tickets ticket[i]. ticket[N] is the number of tickets Jay has. WAP to return the number of friends who's number of tickets are different from jay's ticket count with 'k'. input: 1. N - number of Jay's friends 2. M - different type of tickets 3. k - difference required 4. Array of tickets

2 Answers

Yes, Partial test case passed.

Answer in JS- Trying to remove the duplicate tickets for each person then compare the tickets to get the desired number k. And then get the number of such friends. Not comparing Jay's own tickets. const getFriendsCount = (N, M, k, ticketsArr) => { const uniqueTktsArr = ticketsArr.map(tktsArr => Array.from(new Set(tktsArr))) let friendsNum = 0 const jaysTickets = uniqueTktsArr[N] uniqueTktsArr.forEach((tktsArr, i) => { if (i === N) { return true } let match = 0 tktsArr.every(tkt => { if (jaysTickets.includes(tkt)) { if (++match === k) { friendsNum++ return false } } return true }) }) return friendsNum } Less

PLS Financial Services

How do you deal with sensitive financial data of a user on your device?

2 Answers

The device keychain. There were many questions, where even if you answered that you did not have experience in this avenue, what or how would you go about it? Less

Hi.Could you please tell the questions that are asked for you for this role.I have an interview this friday and it would be a great help.Thanks alot Less

Normal Process with Basic and according to JD & Requirement, Question with flexible and free mind and process will finish within week.

1 Answers

Na

Occidental Petroleum

Do you develop with Xamarin Forms?

1 Answers

Yes I have developed several projects with Forms.

Midas IT Services

Why do you want to leave your current company? You should not leave your current company. If we hire you we will won't give you more then 20k to your annual salary.

1 Answers

I was speechless as I don't know how to react after I have done their telephone & face to face rounds successfully. Less

Aspen Institute

How did you deal with people you didn't get along with at your previous jobs?

1 Answers

Tried to be helpful whenever I could, but otherwise we avoided each other.

i-exceed technology solutions

About past work experience.

1 Answers

I explained .

Deem

Write code to ignore duplicates in a string of characters. The interviewer was very specific with the language i was supposed to use(Java)

1 Answers

private String removeDups(String in) { if (in == null) return null; char[] inAr = in.toCharArray(); Set outSet = new HashSet(); List outList = new ArrayList(); for (char ch : inAr) { if (outSet.add((int) ch)) outList.add((int)ch); } char[] outAr = new char[outList.size()]; Iterator it = outList.iterator(); for (int i = 0; it.hasNext(); i++) { int outInt = it.next(); outAr[i] = (char)outInt; } return String.copyValueOf(outAr); } Less

Gaana

WAP to find duplicate char in string

1 Answers

Roughly this type of quote. Map dict=new HashMap(); for(int i=0;i0){ System.out.println(c); } } Less

Viewing 1 - 10 of 258 Interview Questions