I never removed anyone from my life,
but they all died in the accident of
trust.
—Anonymous
━━━━━━━━━━━
Okhttp or HTTPClient : Which offers better functionality and more efficiency?
Programmer Jokes
Photo
While also sleeping 🗿
Please open Telegram to view this post
VIEW IN TELEGRAM
Discipline is doing what needs to be done, even if you don't want to do it.
—Anonymous
❤2
Forwarded from CodeCamp
This media is not supported in your browser
VIEW IN TELEGRAM
Последний рабочий день ☕️
Please open Telegram to view this post
VIEW IN TELEGRAM
Forwarded from Sozo App
Sozo-NewYear.pdf
63.5 MB
Sozo TV 👀 ✨ — Every anime, right in your hands!
Enjoy thousands of anime episodes and movies🎞
in the highest quality — anytime, anywhere🌍 .
Every episode, every season, every story —
all in your hands💫
🚀 What’s New:
✅ AniList Login — quick and secure login via QR Code
🌐 New sources added for more anime content
💬 Subtitles support for a better viewing experience
⚡️ Improved performance & faster streaming
🎉 Updated for the New Year 2026!
Start the year with unlimited anime on Sozo TV✨
Enjoy thousands of anime episodes and movies
in the highest quality — anytime, anywhere
Every episode, every season, every story —
all in your hands
Start the year with unlimited anime on Sozo TV
Please open Telegram to view this post
VIEW IN TELEGRAM
Tomorrow contest Biweekly Contest 173
@contest @leetcode #contest #leetcode7 @leetcode #leetcode @leetcode7
@contest @leetcode #contest #leetcode7 @leetcode #leetcode @leetcode7
Title: Q1. Count Residue Prefixes
Status: Easy
Code: Kotlin
Idle: JetBrains
#leetcode #leetcodeContest #contest @contest
Status: Easy
Code: Kotlin
Idle: JetBrains
#leetcode #leetcodeContest #contest @contest
Leetcode contest
Title: Q1. Count Residue Prefixes Status: Easy Code: Kotlin Idle: JetBrains #leetcode #leetcodeContest #contest @contest
Q1: Count Residue Prefixes
Code: Kotlin
Status: Easy
Code: Kotlin
Status: Easy
class Solution {
fun residuePrefixes(s: String): Int {
val seen = BooleanArray(26)
var distinct = 0
var ans = 0
for (i in s.indices) {
val idx = s[i] - 'a'
if (!seen[idx]) {
seen[idx] = true
distinct++
}
val len = i + 1
if (distinct == (len % 3)) {
ans++
}
}
return ans
}
}