# 281

Sollicitatievragen voor een Senior Mobile Engineer gedeeld door sollicitanten

## Meest gestelde sollicitatievragen

Sorteren: Relevantie|Populair|Datum
Er werd een Senior Mobile Software Engineer for AWS gevraagd...19 mei 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 antwoorden

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] &lt; 1 + leftHeight + rightHeight) { ans[0] = 1 + leftHeight + rightHeight; } return Math.max(getDiameter(root.left), getDiameter(root.right)); } Minder

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] &lt; 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; } Minder

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 Minder

### 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 antwoorden

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) =&gt; { const uniqueTktsArr = ticketsArr.map(tktsArr =&gt; Array.from(new Set(tktsArr))) let friendsNum = 0 const jaysTickets = uniqueTktsArr[N] uniqueTktsArr.forEach((tktsArr, i) =&gt; { if (i === N) { return true } let match = 0 tktsArr.every(tkt =&gt; { if (jaysTickets.includes(tkt)) { if (++match === k) { friendsNum++ return false } } return true }) }) return friendsNum } Minder

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

2 antwoorden

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? Minder

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 Minder

### 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 antwoorden

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

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

1 antwoorden

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

### 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 antwoorden

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); } Minder

1 antwoorden

Na

1 antwoorden

Almost all

### During the technical interview I was given a laptop and I was asked to build a simple React.js application starting from some boilerplate code. During the first hour of the technical interview we focused more on building the frontend of the application, while during the second we worked on the backend to make it persistent and a little more complete. In general I thought it was a great interview question since it basically turned into a pair programming session where we didn't just talk about React, but the entire application stack and web technologies more in general. Everybody was genuinely nice all along the process, trying to make me feel comfortable at all times, and in general also open to discuss different solutions to the problems we were discussing.

1 antwoorden

I built a good part of the app but I didn't finish it, although we designed the missing part without implementing because we ran out of time. Minder

### Do you develop with Xamarin Forms?

1 antwoorden

Yes I have developed several projects with Forms.

Weergave: 1 - 10 van 281 Sollicitatievragen