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.

a-react-app-example

active-record-costume-store-lab

active-record-intro-to-rake

active_record_boiler_plate

anikajb92

aspire-catalog-feed

basic-hooks

bethechange

bloodoath_boiler

Boiler plate for Blood Oath 3.0

brew-tiful

cardsbnb

a build and burn to practice react with a deck of cards api

cat-a-log

coffee-shop

computer-science

:mortar_board: Path to a free self-taught education in Computer Science!

css-essentials-css-issue-bot-9000

donut_validations

fetch

Hackstreet {boiz} as four-legged pups

full-auth-practice-be

full-auth-practice-fre

fun-with-disney

git-basics-lab-phase-0

github-profile-trophy

🏆 Add dynamically generated GitHub Stat Trophies on your readme

happiness-tracker

happy-backend

happy-frontend

hayk-component-hierarchies

hello-world

My first repository

heroes_rails_react_build_and_burn

Practice with Rails and React.