Karthik.S
Karthik.S @20KarthikS06 ·
Today : solved Kth missing positive number(using brute force approach) REVISITED : ✅ Single Number ✅ Max Consecutive ones ✅ Move zeros ✅ Rotate array ✅Remove duplicates from sorted array #Array #Binarysearch #DSA #Buildinpublic
73
omega34
omega34 @PierceZhang34 ·
Replying to @PierceZhang34
Key Takeaways: When range is small → HashSet + loop is clean & fast When range is huge → sorting + adjacent diff might be better Always use min/max given in problem (they exist!) What’s your favorite way to solve this? HashSet or sort? #Array #HashSet
18