🔁 Day 60 of #100DaysOfCode
✅ Covered:
• Reverse Words in a String
• Remove All Occurrences of a Substring
• String Compression
Gave it another shot — things are starting to make more sense now.
#DSA#StringProblems#100DaysChallenge
LeetCode 557 – Reverse Words in a String III
Solved: Reverse each word in the string, keep word order
Split → reverse each → join
Clean string + array manipulation in Python!
Great practice for string traversal & logic!
#LeetCode#PythonDSA#StringProblems
✅ Solved some easy string problems on LeetCode today:
🔤 58. Length of Last Word
🔍 2942. Find Words Containing Character
Quick and simple problems that help strengthen string handling skills.
#DSA#StringProblems@ChaiCodeHQ@PrateekJain027@Hiteshdotcom
LeetCode 125 – Valid Palindrome
Solved: Check if a string is a valid palindrome (ignore cases & non-alphanumerics)
Cleaned string using regex + .lower()
Two-pointer check from both ends
Classic string + pointer logic!
#LeetCode#PythonDSA#StringProblems#DSA
Day 76: Substrings with K Distinct 🔤
Today’s challenge: Count all substrings with exactly K distinct characters in a given string.
📌 Used sliding window + hash map for efficient tracking of character frequency.
#GFG160#StringProblems#SlidingWindow
Day 57: Same Start, Same End 🔁
Today’s challenge: Count all substrings where the first and last characters match.
✅ Used character frequency to calculate the count efficiently!
#GFG160#StringProblems#Substrings#GeekStreak2025
🔁 String Formation Check
Given string S and permutation P, find the minimum days to replace characters so no two adjacent ones are the same.
Input:
N = 4, S = "aabb", P = {2, 1, 3, 0}
Output: 2
#StringProblems#DSA#TechTips
🕵️♂️ Day 17 of @geeksforgeeks 160 – First Non-Repeating Character ✅
Today’s challenge was to find the first non-repeating character in a string – a classic mix of frequency counting and order tracking! 🔍🧠
#geekstreak2025#gfg160#StringProblems#DSA#Coding