anikajb92
Full-Stack Software Engineer | Environmental Scientist | Kayak and crochet enthusiast | Lover of dogs, puns, and vegan ice cream.
@FlatironSchoolDenver, CO
Pinned Repositories
2do4u
a-problem
We have a list [8,6,7,7,3,4,5,6,6,7,2,3,4,5,3,6,6,5,6,7,7,8,9,1]. Using iteration, find specific sequences 1 by 1, comparing their length at the same time, overwriting shorter ones with longer ones. The sequences we are searching for follow a pattern: starting with a flat(or a single element), then dropping, then growing (e.g. 6 6 3 3 4 5 5 6) After doing all of the operations, return the first longest sequence. In the given list, that would be [7,7,3,4,5,6,6,7] This is what I was able to come up with: <code> The code should print out [7,7,3,4,5,6,6,7], but it prints out [ ]. Any way how I can make this work? Rewrite my code, if it won't do.
brew-tiful
computer-science
:mortar_board: Path to a free self-taught education in Computer Science!
Fetch
Hackstreet {boiz} as four-legged pups
happiness-tracker
Springtime
task-rocket-app
task_rocket_api
brew-tiful
anikajb92's Repositories
anikajb92/active_record_boiler_plate
anikajb92/ruby-methods-readme
readme about methods in ruby
anikajb92/hayk-component-hierarchies
anikajb92/object-ball
anikajb92/react-challenge
Cuttlesoft react.js coding challenge.