Post by Nitesh kumar Jha
Ex-SDE intern @Travelthrust || MCA’27 NIT RAIPUR
🚀 Day 32/45 – #SDESheetChallenge Today's problems proved that small strings can hide surprisingly tricky logic. 🔤 Valid Anagram → Used frequency counting to verify whether both strings contain the same characters. 🔢 Count and Say → Built each sequence by reading the previous one, grouping consecutive characters and describing them. ⚖️ Compare Version Numbers → Split the version strings into revisions and compared them one by one, ignoring leading zeros. 🧠 Today's takeaway: Today's challenge wasn't about complex algorithms. It was about carefully handling details. A single extra character, a run of repeated digits, or a leading zero can completely change the result. Correctness often lives in the edge cases. ✅ Day 32/45 Complete A big thanks to takeUforward for another day of learning and helping us sharpen our problem-solving mindset. 🚀 #SDESheetChallenge #TakeUForward #DSA #Strings #StriverSDESheet #LeetCode #ProblemSolving #LearningInPublic