Senior Android Mobile Engineer

Job Description

What you will do

• Build some of the most crucial infrastructure using web and Android technologies for both internal and external users
• Gather feedback from users for fast iteration of products
• Take ownership of features and products
• Grasp new technologies at extremely fast pace

About You

• Solid fundamentals in computer engineering/science
• Proficient in one or both of Android and web Javascript development
• Bonus: 1) React.js 2) UI/UX skills
• Relentless work ethic
• Strong moral fiber
• Exceptional cognitive abilities
• Proven and verifiable track record of excellence in fields other than just academics
• Embrace responsibility and leadership through accountability
• Good English speaker, reader and writer
• Winner

If you are interested, we have a little brain teaser. Send us a message introducing yourself and be sure to include your answer. Please note that the prospective applicant MUST provide your best answer to the questionnaire below in order to be considered for an interview. Look forward to your original answer.

Question 1:
There are two people, A and B. Each has an integer. Together, the two integers multiply to either 16 or 32.
A: "With the number I have, I do not know the number you have."
B: "I don’t know what you have either."
A: "With what you told me, I still do not know the number you have."
B: "I still don’t know what you have either."
A: "I know what you have now."
B: "Oh mate, I know what you have too."
What are the numbers that A and B could have?

Question 2:
Given an array of length A, we want to randomly select N elements while making sure we don’t select the same element twice (random selection without replacement).
Fisher-Yates is an algorithm for shuffling an entire array of length A in O(A) time. Modify the Fisher-Yates shuffling algorithm to achieve our goal in O(N) time.
https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle (see the modern algorithm for the linear time version)
Python or Javascript is preferred, but not required.
Hint: You should not shuffle the entire array unless N==A.

Question 3:
If given an opportunity at GoLorry, when is the earliest you can join? Are you open to working in Vijayawada or Hyderabad?