Skip to content

Instantly share code, notes, and snippets.

@jeb2239
Created December 16, 2020 14:23
Show Gist options
  • Save jeb2239/b267b7dd91d4ae887e048b361ec13192 to your computer and use it in GitHub Desktop.
Save jeb2239/b267b7dd91d4ae887e048b361ec13192 to your computer and use it in GitHub Desktop.
a problem
//
// Given a very large array that is composed by
//
// n elements in descending order, followed by
// m elements in ascending order,
//
// find the position where the order gets reversed.
//
// Example:
// INPUT: [9,8,6,5,4,6,8,10,34,56]
// ^
// |
// OUTPUT: 5
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment