LeetCode 2000 | Reverse Prefix of Word | Two Pointer & STL Explained | C++

LeetCode 2000 — Reverse Prefix of Word. Given a string and a
character, reverse the portion of the string from index 0 up to
the first occurrence of that character. A clean, beginner-friendly
string manipulation problem solved elegantly in C++.

━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━

🔗 IMPORTANT LINKS

💻 GitHub (Solutions Repo) → https://github.com/hanumanraj07/LeetCode
🌐 Portfolio → https://hanumanrajpurohit.vercel.app
💼 LinkedIn → https://linkedin.com/in/hanumanraj07
🧩 Problem Link → https://leetcode.com/problems/reverse-prefix-of-word/

━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━

📌 WHAT IS THIS PROBLEM?

Given a 0-indexed string word and a character ch, reverse the
segment starting at index 0 up to and including the first
occurrence of ch.

word = "abcdefd", ch = "d"
Output → "dcbaefd"

If ch does not exist in the string, return the string unchanged.

━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━

🛠️ APPROACH COVERED

Method → find() + reverse() using STL
Language → C++
Time → O(n)
Space → O(1)

━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━

🎯 WHAT YOU WILL LEARN

→ How to use string::find() in C++
→ How std::reverse() works on a substring range
→ Handling the edge case where character is absent
→ Clean one-function C++ solution with dry run
→ Why this pattern appears in real interview problems

━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━

📬 CONNECT WITH ME

💼 LinkedIn → https://linkedin.com/in/hanumanraj07
🌐 Portfolio → https://hanumanrajpurohit.vercel.app
💻 GitHub → https://github.com/hanumanraj07

━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━

#LeetCode #LeetCode2000 #ReversePrefixOfWord #Strings #CPlusPlus
#DSA #DataStructures #Algorithms #CodingInterview #TechInterview
#FAANG #PlacementPrep #CPP #ProblemSolving #IndianDeveloper
#TechIndia #100DaysOfCode #DSASheet #LeetCodeDaily #STL
#CodingChallenge #LearnToCode #StringManipulation #TwoPointer

Видео LeetCode 2000 | Reverse Prefix of Word | Two Pointer & STL Explained | C++ канала Hanuman Singh Rajpurohit