Your browser (Unknown 0) is no longer supported. Some parts of the website may not work correctly. Please update your browser.
UPCOMING CHALLENGES:
CURRENT CHALLENGES:
Pi Code Challenge
PAST CHALLENGES
Year of the Rabbit
Carol of the Code
Game of Codes
National Coding Week 2022
Jurassic Code
Fury Road
Bug Wars: The Last Hope
Muad'Dib's
Year of the Tiger
Pair a Coder
Code Alone
Gamer's
Spooktober
National Coding Week
The Coder of Rivia
Fast & Curious
The Fellowship of the Code
May the 4th
The Great Code Off 2021
The Doge 2021
The Matrix 2021
The OLX Group challenge
Silver 2020
Palladium 2020
Rhodium 2019
Ruthenium 2019
Technetium 2019
Molybdenum 2019
Niobium 2019
Zirconium 2019
Yttrium 2019
Strontium 2019
Rubidium 2018
Arsenicum 2018
Krypton 2018
Bromum 2018
Future Mobility
Grand Challenge
Digital Gold
Selenium 2018
Germanium 2018
Gallium 2018
Zinc 2018
Cuprum 2018
Cutting Complexity
Nickel 2018
Cobaltum 2018
Ferrum 2018
Manganum 2017
Chromium 2017
Vanadium 2016
Titanium 2016
Scandium 2016
Calcium 2015
Kalium 2015
Argon 2015
Chlorum 2014
Sulphur 2014
Phosphorus 2014
Silicium 2014
Aluminium 2014
Magnesium 2014
Natrium 2014
Neon 2014
Fluorum 2014
Oxygenium 2014
Nitrogenium 2013
Carbo 2013
Boron 2013
Beryllium 2013
Lithium 2013
Helium 2013
Hydrogenium 2013
Omega 2013
Psi 2012
Chi 2012
Phi 2012
Upsilon 2012
Tau 2012
Sigma 2012
Rho 2012
Pi 2012
Omicron 2012
Xi 2012
Nu 2011
Mu 2011
Lambda 2011
Kappa 2011
Iota 2011
Theta 2011
Eta 2011
Zeta 2011
Epsilon 2011
Delta 2011
Gamma 2011
Beta 2010
Alpha 2010
Given a sequence S of integers, find a number of increasing sequences I such that every two consecutive elements in I appear in S, but on the opposite sides of the first element of I.
Stats:
5832 started
0 silver awards
29 golden awards
Hall of fame:
1
Time: 18 hours, 35 minutes
2
Time: 20 hours, 28 minutes
3
Time: 1 day, 23 hours
