/hackerrank-ctci

Koleksi solusi Cracking The Coding Interview di Hackerrank

Primary LanguageKotlin

Hackerrank - Cracking The Coding Interview

Koleksi solusi Cracking the Coding Interview Challenges di Hackkerrank (dengan komentar 💭)

Checkout my hackerrank profile!

🚧 Belum selesai 🚧

Coding Test

Kotlin

  • Binary Gap
    • Given a positive integer N, returns the length of its longest binary gap. The function should return 0 if N doesn't contain a binary gap. link
    • Solution
  • Earliest valid time
    • Given 6 digits of number (0..9), find the earliest valid time (HH:mm:ss), print "Not possible" if it is not possible.
    • Solution

Warm-up Challenges

Kotlin

Arrays

Kotlin


Old Hackerrank Category

Data Structures

Java ☕

Algorithms

Java ☕

Techniques / Concepts

Java ☕