Davron Karimov

Indie iOS Apps developer | Futures Trader

[Davron Karimov @Davron569]

@RohOnChain How to learn how to do this type of programming?

[Davron Karimov @Davron569]

@adamlyttleapps I created 5 apps but no downloads and subscriptions I don’t know what to do and I start thinking that I can’t earn money can you look what can I do? https://t.co/0wrvOumom4

[Davron Karimov @Davron569]

@lucaspatiri_ Ugc

[Davron Karimov @Davron569]

@t0mbfx Amazing Tom, wish I will reach the same soon

[Davron Karimov @Davron569]

@seraleev Solo with Claude 😅

[Davron Karimov @Davron569]

@seraleev Do you localise your app itself too, or only screen shots and metadata?

[Davron Karimov @Davron569]

@vatsal_sanghvi Nice, do you use adds?

[Davron Karimov @Davron569]

@Fun_Trades1 I shorted exactly where you buy, interesting how market is showing different scenarios for different people

[Davron Karimov @Davron569]

Nice Animations to use by @Shubham_iosdev . Great work!

[Shubham Singh @Shubham_iosdev]

Added another set of SwiftUI animations, components, and shaders to my open-source repo ✨

It’s a growing collection of loaders, prototypes, shaders, and components, all built with SwiftUI.

Feel free to star, fork, and share with other developers.

https://t.co/i60fWohzAL

[Davron Karimov @Davron569]

Day 2 of LeetCode:

Maybe (Maybe Not!) The most elegant way to find the GCD of two strings. 😂

I was recently diving into the "1071. Greatest Common Divisor of Strings" problem, and the solution in Swift is a "masterclass" in combining simple math with string logic.

The goal of the task is to find the largest string X such that both str1 and str2 are formed by repeating X.

The "Magic" Check: guard str1 + str2 == str2 + str1 Before doing any heavy lifting, this check confirms if a common divisor even exists. If they don't commute when concatenated, they don't share a base pattern. It’s a simple proof of a periodic property!

The Euclidean Twist: Once we know they share a pattern, the problem stops being a string problem and becomes a math problem. We just need the GCD of the two lengths.

By applying the Euclidean algorithm (which dates back to 300 BC!), we find the exact length of that repeating unit in O(logn) time. New Day New Knowledge.

What’s your favorite "simple" solution to a seemingly not complex LeetCode problem? Let's discuss in the comments! 👇

#Swift #Coding #Algorithms #LeetCode #SoftwareEngineering

[Davron Karimov @Davron569]

@isaacthequach Maybe yes or maybe no 😄

[Davron Karimov @Davron569]

@DanKulkov Worst Feeling

[Davron Karimov @Davron569]

@Anas_founder Air

[Davron Karimov @Davron569]

@bymarcoperez Awesome! Hopefully It will be 10000$ MRR

[Davron Karimov @Davron569]

@Fun_Trades1 Nice try

[Davron Karimov @Davron569]

@athcanft What if you don't have money for the adds?

[Davron Karimov @Davron569]

@Fun_Trades1 I hope my account will grow too

[Davron Karimov @Davron569]

Working On some Redesign of Shift Worker Calendar & Rota and What popped in my mind is that :
Being an indie dev means you are the:
-CEO
- Lead Engineer
- UI/UX Designer
- Marketing Lead
- Support Desk
- Janitor

It’s exhausting, overwhelming, and occasionally frustrating. But seeing that first "Active User" notification?

Will BE Worth every line of code!

Link to my app: https://t.co/Ecmw9K9Lj5

#IOSDev #IndieHackers #ShipIt #VibeCoding #iOSIndieDev

[Davron Karimov @Davron569]

@Fun_Trades1 Be careful