Mobile Applications Developer Interview Questions

341

Mobile Applications Developer interview questions shared by candidates

Top Interview Questions

Sort: Relevance|Popular|Date
Google
Software Engineer, Mobile Applications, YouTube was asked...April 24, 2013

Involved copying a linked list. The tricky part though was the objects in the list could refer to one another.

2 Answers

I don't think I understand the difference between what OP is saying and dealing with a normal linked list copy. I mean, of course the objects in the list refer to one another; it's a linked list, so they have to. Less

My take was the list had multiple pointers so more like a graph. One pointer to the next element and perhaps another to some non ordinal node. I can see doing one pass where you create the linked list node by node and keep the random pointer null. As you create your copy nodes, you hash the old object to point to the new one. Then you traverse the old list again, you can then do a get on the hash to populate the random pointer destination. I'm using hashCode() here but you could decorate your own Id. import java.util.HashMap; import java.util.Map; class Node { int value; Node next; Node random; public Node(int value) { this.value = value; } public Node(int value, Node next, Node random) { this.value = value; this.next = next; this.random = random; } public String toString() { return "Val: " + this.value + " next: " + ((this.next == null) ? "null" : this.next.value) + " random: " + ((this.random == null) ? "null" : this.random.value); } } public class CopyList { public static Node copyList(Node list) { if (list==null) { return null; } Node previous = null; Node head = null; Map oldToNew = new HashMap(); Node oldNode = list; while (oldNode != null) { Node current = new Node(oldNode.value); oldToNew.put(oldNode.hashCode(), current); if (previous == null) { head = current; } else { previous.next = current; } previous = current; oldNode = oldNode.next; } oldNode = list; // reset to head // Reset Random Pointers while (oldNode != null) { Node random = oldNode.random; if (random != null) { Node newNode = oldToNew.get(oldNode.hashCode()); newNode.random = oldToNew.get(random.hashCode()); } oldNode = oldNode.next; } return head; } /** * @param args */ public static void main(String[] args) { Node six = new Node(6, null, null); Node five = new Node(5, six, null); Node four = new Node(4, five, null); Node three = new Node(3, four, six); Node two = new Node(2, three, five); Node one = new Node(1, two, six); six.random = five; four.random = one; Node newHead = copyList(one); System.out.println("Old List: "); while(one != null) { System.out.println(one); one = one.next; } System.out.println(); System.out.println("New List: "); while(newHead != null) { System.out.println(newHead); newHead = newHead.next; } } } Less

QuickMobile

How would you design a calculator for a blind person

2 Answers

using html attributes?

Using accessibility

ZealousWeb

technical questions - c/c++, objective c

2 Answers

Source files to the xcode

Source files to the xcode project

J.B. Hunt Transport

Based of many Hacker Rank tests. alternate contents of two strings

2 Answers

Too long for this section, but used previous knowledge and split into char arrays and for loops to alternate string contents into a new string Less

public static void main(String as[]){ String s1= "America"; String s2= "India"; System.out.println(merge(s1,s2)); } public static String merge(String s1, String s2){ StringBuilder sb = new StringBuilder(); int i=0; int j=0; while(i Less

Prepare well all the concepts before giving interview

1 Answers

Concepts of Thread

Zaptas Technologies

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

1 Answers

Na

i-exceed technology solutions

About past work experience.

1 Answers

I explained .

AugRay

How many languages do you know?

1 Answers

Have you developed any mobile app before?

Allstate

Objected Oriented Programming Questions

1 Answers

Inheritance, Polymorphism, etc...

Alarm.com

Do you need coffee?

1 Answers

No, I don't drink coffee.

Viewing 1 - 10 of 341 interview questions

See Interview Questions for Similar Jobs

mobile architectios applications developermobile developerandroid developeriphone developersoftware engineerios developerweb application developersoftware developer

Glassdoor has 341 interview questions and reports from Mobile applications developer interviews. Prepare for your interview. Get hired. Love your job.