<img height="1" width="1" style="display:none;" alt="" src="https://dc.ads.linkedin.com/collect/?pid=12616&amp;fmt=gif">
Titanium is One of our Hardest Challenges in 2016

Titanium is One of our Hardest Challenges in 2016

Titanium is so far our hardest challenge of 2016 with only 59 coders being able to solve the coding challenge! Try it for free now and see if you can beat it!


Our Titanium Challenge has finally been conquored! 59 times to be exact. 

The goal is to find the longest slice (contiguous substring) of S that forms a valid bracket sequence using at most K bracket rotations. You are given a sequence of brackets S and you are allowed to rotate some of them. 3,800 coders attempted this one, but only 59 could get a perfect score. First place went to Tadeusz Sznuk who solved Titanium in 5 hours and 40 minutes (over 3 hours faster than the rest) and who also came 2nd in our April Scandium Challenge! Santosh Kalwar came in next with a perfect score, followed by Abhimanyu Rawat. A massive congratulations from our team to the three of you and to all the golden award winners - this was a tough one! 

Titanium is still open, so if you haven't tried it yet, take a shot! 

Happy Coding Everyone! 



Tackle some of our other coding challenges in our Programmers' Home

Keep Reading

Big-O Notation Explained for Not-So-Technical People (Part 2)

You may recall that I recently shared a simplified explanation of what the Big-O notation is, and […]

Big-O Notation Explained: Definition & Examples (Part 1)

The Big-O notation is the way programmers think about how fast their programs are, or how much […]

Z-Index Explained: Styled Components & CSS Z-Indexing

CSS is ok-ish now CSS is known for some quirks that have been driving people mad since they started […]