Detect Capital LeetCode

🔹 Problem: Detect Capital (LeetCode) In this video, we solve a beginner-friendly string validation problem. The task is to determine whether the usage of capital letters in a word is correct. --- 🔹 Valid Cases: 1. All letters uppercase Example: USA 2. All letters lowercase Example: leetcode 3. Only first letter uppercase Example: Google --- 🔹 Brute Force Approach: One possible solution: - Check every possible pattern manually - Compare uppercase and lowercase letters This works but becomes lengthy. --- 🔹 Optimized Approach: We count uppercase letters. Steps: 1. Traverse the word 2. Count uppercase letters 3. Check: - all uppercase - all lowercase - only first letter uppercase --- 🔹 Key Idea: All valid patterns can be identified using uppercase count. --- 🔹 Dry Run Example: word = FlaG Uppercase letters: F and G Count = 2 Invalid pattern Answer = false --- 🔹 Time Complexity: O(n) 🔹 Space Complexity: O(1) --- 🔗 GitHub: https://github.com/DhruvOzha85 🔗 LeetCode Profile: https://leetcode.com/u/DhruvOzha/ 🔗 LinkedIn: https://www.linkedin.com/in/dhruv-ozha-bb378639b/ --- 📌 Notes: - Beginner-friendly string problem - Great for practicing character functions - Helps understand validation logic --- 🔥 Follow for more daily DSA problem solutions! #leetcode #detectcapital #strings #dsa #codinginterview #cplusplus #programming #algorithms #coding #leetcodeeasy #tech #softwareengineer #placements #codingpractice detect capital, string validation, uppercase lowercase problem, leetcode easy, dsa problems, coding interview questions, c++ dsa, beginner dsa, algorithms, programming, interview prep, coding practice