gaurav.gupta@mq.edu.au arrays > longestAscendingRun
prev  |  next  |  chance

Define a function that when passed an array, returns the longest subsequence that is in ascending order in the array. In case of a tie, return the sequence occurring first. longestAscendingRun([]) → [] longestAscendingRun([10, 60, 71, 120, 80, 100]) → [10, 60, 71, 120] longestAscendingRun([1, 7, 3, 9]) → [1, 7] Go...Save, Compile, Run (ctrl-enter) int[] longestAscendingRun(int[] data) { } Go Editor font size %:75100125150 Shorter output

Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

• Java Example Solution Code
• Java String Introduction (video)
• Java Substring v2 (video)
• Java String Equals and Loops
• Java String indexOf and Parsing
• Java If and Boolean Logic
•   If Boolean Logic Example Solution Code 1 (video)
•   If Boolean Logic Example Solution Code 2 (video)
• Java For and While Loops
• Java Arrays and Loops
• Java Map Introduction
• Java Map WordCount
• Java Functional Mapping
• Java Functional Filtering

Misc Code Practice

• Code Badges
• Introduction to Mod (video)
• MakeBricks problem and solution (video x 2)
• FizzBuzz the famous code interview question (video)

Difficulty: 5 Post-solution available

Copyright Nick Parlante 2017 - privacy