Amanda Roos

Java code on GitHub:  https://github.com/amandafarrell/VolumeButtonCounterFree Available on Google Play:  https://play.google.com/store/apps/details?id=com.amandafarrell.www.volumebuttoncounterfree -Use volume buttons to count up and down -Can reset to any number you choose -Available in 100 languages

Java code available on GitHub:  https://github.com/amandafarrell/ChangeCalculator Available on Google Play:  https://play.google.com/store/apps/details?id=com.amandfarrell.www.changecalculator -Quick number entry -Shows amount of bills and coins -Available in 100 languages

I receive a lot of reviews of scorekeeper asking for the ability to edit the names of players, which is a feature already available through long-pressing on the player name. Apparently, long-pressing is not something intuitive to try for some people, so they are left without the ability to change the player name. I hope this video preview helps make it easier for users to understand how the app works and how to get to additional features already available to them.

I released Scorekeeper, my first app, on the Google Play Store three years ago. It recently reached 50,000 downloads! I'm excited something I made could be useful to so many people and hope I can keep making more and better apps going forward.

Let's say we have some magical rabbits. These rabbits never die. A pair of rabbits has 3 more pairs of rabbits in every litter, and they start producing litters after one generation. If you start with one pair of rabbits, how many rabbits will you have in 5 generations? This was the premise of a problem I was working on this week in Python (check out the full problem here:  http://rosalind.info/problems/fib/ ). I had to draw it out on my white board to wrap my head around it: The idea behind this problem is that finding the number of rabbits in a given generation is similar to calculating a given number in the Fibonacci sequence and that it can be solved recursively, so that's how I did it. Recursive rabbit solution: It doesn't really have to be done recursively, though. I was talking through it with Steven, and we realized that the manual approach I had used on the whiteboard was also fairly efficient. Turns out it can be implemented in fewer lines of cod...

I've been taking the Data Structures & Algorithms in Python class on Udacity.com. Lately, I've been working on implementing an in-place Quicksort two different ways.  The first way follows the way they explained it in the class video . This version involves moving the pivot after each comparison: The second way is based on a visualization they linked to from the lecture and this tutorial . It moves the pivot after all comparisons for each partition have been made, eliminates the need for the "j" variable that I have in the first version, and is a few lines shorter than the first version, but it is harder for me understand intrinsically:

-Music made in FL Studio -Screen recording with OBS -Code on GitHub (I include a button because I needed to be able to start recording my screen before the animations started):

This is my first published app built with Kotlin! :) Features: Use volume buttons to keep score for two teams Can reset to any scores you choose Available in 100 languages Code on GitHub .

The code from this video is on GitHub if you want to copy and paste: https://github.com/amandafarrell/LatLong This video is based on the android dev page for getting last location: https://developer.android.com/training/location/retrieve-current

This app got 25 downloads and a five-star review in its first week on the Google Play Store! Code on GitHub

You can make a game. Start by downloading Unity: https://store.unity.com/download Links to the code I use in the video: https://github.com/amandafarrell/YangGameTutorial/tree/master/YangGame6/Assets/Scripts I got started with this tutorial from Android Authority: https://www.youtube.com/watch?v=4BD3y0NYNqk www.Yang2020.com for more about Andrew Yang.