Kittieee

[Kittieee @____kittykat_]

@KingTunde_SZN 67

[Kittieee @____kittykat_]

@Isxhhaaa Carrot

[Kittieee @____kittykat_]

@rohit_negi9 Ohh wow it's interesting

[Kittieee @____kittykat_]

@CoderArmy What will be the price?

[Kittieee @____kittykat_]

@XMonetization_ Hello

[Kittieee @____kittykat_]

@CoderArmy 🤣🤣

[Kittieee @____kittykat_]

@Wisdom_HQ 19

[Kittieee @____kittykat_]

@Elonstarmiz 8960

[Kittieee @____kittykat_]

@RuksanaAnsar 58

[Kittieee @____kittykat_]

@AdiKnightDev @striver_79 @rohit_negi9 Keep going brother🙌

[Kittieee @____kittykat_]

@elonmuskPBG 52

[Kittieee @____kittykat_]

@elonmuskPBG 39

[Kittieee @____kittykat_]

@elonmuskPBG 30

[Kittieee @____kittykat_]

@skk123sk7725 @rohit_negi9 Thanks bro! Continuous growth is the goal — wishing you success as well.🙌

[Kittieee @____kittykat_]

10/01/26 @rohit_negi9 ❤️
Lecture 11
In this session, sir explained HNSW.
It is a fast algorithm used to search similar items (vectors) in very large datasets.
Brute-force checking everything is too slow. HNSW makes this very fast .
And done 1 question of dsa.

[Kittieee @____kittykat_]

9/01/26
I've these 2 questions but allocate minimum no. Of pages is not optimized yet.

[Kittieee @____kittykat_]

@ElonMusk_LordX 409

[Kittieee @____kittykat_]

@fundedxofficial 47

[Kittieee @____kittykat_]

1. Remove duplicates from sorted array
2. Two sum ll
3. Search in a rotated sorted array with duplicates
4. Find the fine
Today I have done these 4 easy and medium questions of DSA

[Kittieee @____kittykat_]

Consistency hasn’t been my strongest point on social media, but I’m working on it by showing up here daily. This is my progress so far. From now on, I’ll be posting daily updates here about the questions I’m solving and what I’m learning along the way.