https://github.com/vycius/udacity-interview-dry-run

Android developer nanodegree: Project Interview Dry-Run
https://github.com/vycius/udacity-interview-dry-run

Last synced: 21 days ago
JSON representation

Android developer nanodegree: Project Interview Dry-Run

• Host: GitHub
• URL: https://github.com/vycius/udacity-interview-dry-run
• Owner: vycius
• License: apache-2.0
• Created: 2016-04-25T20:59:35.000Z (over 8 years ago)
• Default Branch: master
• Last Pushed: 2016-04-25T21:10:03.000Z (over 8 years ago)
• Last Synced: 2024-10-04T19:44:18.761Z (3 months ago)
• Language: Java
• Homepage: https://www.udacity.com/course/android-developer-nanodegree--nd801
• Size: 13.7 KB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Interview Dry-Run

Project Interview Dry-Run simulates an in-person interview. All six tasks has been completed in less than a hour. Although some additional time was taken to add few Unit and property based tests. 

Answers to all questions can be found in `src/com/vycius/interview`.

## Questions

> Question 1 - What’s your favorite tool or library for Android? Why is it so useful?

> Question 2 - You want to open a map app from an app that you’re building. The address, city, state, and ZIP code are provided by the user. What steps are involved in sending that data to a map app?

> Question 3 - Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2b1c5a3. If the "compressed" string would not become smaller than the original string, your method should return the original string. The method signature is: “public static String compress(String input)” You must write all code in proper Java, and please include import statements for any libraries you use.

> Question 4 - List and explain the differences between four different options you have for saving data while making an Android app. Pick one, and explain (without code) how you would implement it.

> Question 5 - Given a directed graph, design an algorithm to find out whether there is a route between two nodes. The method signature is: “public static < T > boolean findPath(GraphNode< T > start, GraphNode< T > end)”. Assume you have a “GraphNode” class that has a getChildren() method, which returns a List< GraphNode< T >> object. You must write all code in proper Java, and please include import statements for any libraries you use (no need to import GraphNode).

> Question 6 - What are your thoughts about Fragments? Do you like or hate them? Why?

## Android Developer Nanodegree

[![Udacity](https://cloud.githubusercontent.com/assets/3719141/14508774/c7f6cbce-01d1-11e6-9daf-02bcd10b6400.jpeg)](https://www.udacity.com/course/android-developer-nanodegree--nd801)

## License

Copyright 2016 Karolis Vycius

Licensed under the Apache License, Version 2.0 (the "License");

you may not use this file except in compliance with the License.

You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software

distributed under the License is distributed on an "AS IS" BASIS,

WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.

See the License for the specific language governing permissions and

limitations under the License.