Death is not the enemy. A wasted life is.
William Mulligan
Please open Telegram to view this post
VIEW IN TELEGRAM
❤5
Leetcode contest
ETH 5k what i said 🗿 owowow
This media is not supported in your browser
VIEW IN TELEGRAM
I’m not here to impress — I’m here to express what they wish they could say.
Eminem
Please open Telegram to view this post
VIEW IN TELEGRAM
😁2
Director Gore Verbinski says AI is attacking modern storytelling.
“Instead of trying to solve cancer or take us to Mars or these things that could solve some genuine issues, it’s going after storytelling, it’s going after illustrations, it’s gonna write your song for you. It’s like saying it’s gonna breathe for you, it’s gonna f*ck for you. It’s gonna take away.” @leetcode
“Instead of trying to solve cancer or take us to Mars or these things that could solve some genuine issues, it’s going after storytelling, it’s going after illustrations, it’s gonna write your song for you. It’s like saying it’s gonna breathe for you, it’s gonna f*ck for you. It’s gonna take away.” @leetcode
❤3
Leetcode contest
Today contest #leetcode
Weekly contest @leetcode3 lets pray for me for joining
Hello everyone, I’m back after a 3-week vacation. I’m ready to start running the channel again. Thanks to all the new members for joining! 🥂
Please open Telegram to view this post
VIEW IN TELEGRAM
http4k — a set of functional tools for HTTP applications
http4k is a lightweight yet fully functional toolkit for working with HTTP, written in pure Kotlin.
http4k allows you to write applications as simple Kotlin functions. For example, here is a simple echo server:
@KotlinSenior
http4k is a lightweight yet fully functional toolkit for working with HTTP, written in pure Kotlin.
http4k allows you to write applications as simple Kotlin functions. For example, here is a simple echo server:
val app: HttpHandler = { request: Request -> Response(OK).body(request.body) }
val server = app.asServer(SunHttp(8000)).start()@KotlinSenior
Leetcode contest
Q1. Minimum Number of Flips to Reverse Binary String
You are given a positive integer n. Let s be the binary representation of n without leading zeros. The reverse of a binary string s is obtained by writing the characters of s in the opposite order. You may flip any bit in s (change 0 → 1 or 1 → 0). Each flip affects exactly one bit. Return the minimum number of flips required to make s equal to the reverse of its original form