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.
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
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.