Master Vim with e/E Command for Word Editing

Daily Vim tip: Use f{char} / F{char} to move the cursor at a specific character on the current line. f jumps forward to it; F hunts backward. After the first jump, ; repeats in the same direction and , reverses — so you can skip through multiple matches without retyping. Learn more: run `vimtutor` in your terminal, or use `:help f{char}` inside Vim. #vim #vimtip #coding

Solved Add Two Numbers using linked lists. At first, the pointer-based structure was confusing, but breaking it down into simple steps made it manageable. Approach: Traverse both linked lists Add digits one by one Maintain carry (just like normal addition) Build a new linked list for the result #DSA #LinkedList #CPP #Coding

#Day42 Of #100DaysOfCode: #DSA: solve leetcode problem - Search a 2D Matrix II simple approach: - start from matrix[last_row][first_col] - check if matrix[row][col] > target then go up means row--; - else if matrix[row][col] < target then go right means col++; - else means matrix[row][col] == target -> return true; - int the last return false it will only run when the loop does't return Time: O(m + n) space: O(1) #DSA #Coding #Daily #Leetcode #CodingJourney #Learning

Daily Vim Tip: From any bracket, brace, or parenthesis, % teleports you to its matching partner. In files with the matchit plugin loaded, it also hops between if/else/end blocks and HTML tags. Learn more: run `vimtutor` in your terminal, or use `:help %` inside Vim. #vim #vimtip #coding #ostechnix

Day 47 on LeetCode — Partition Labels ✂️✅ Today’s problem was a great example of greedy strategy with smart indexing. 🔹 Approach Used in My Solution The goal was to split the string into maximum number of partitions such that each character appears in only one part. Key idea in the solution: • First, store the last occurrence of each character in an array • Traverse the string while maintaining a current partition range • Continuously update the end of the partition using the last index of characters encountered • When the current index reaches end, it means the partition is complete • Store the partition size and start a new one This greedy approach ensures each partition is as small as possible while still valid. ⚡ Complexity: • Time Complexity: O(n) • Space Complexity: O(1) 💡 Key Takeaways: • Learned how preprocessing (last occurrence tracking) simplifies problems • Practiced greedy partitioning techniques • Strengthened understanding of interval expansion logic #LeetCode #DSA #Algorithms #DataStructures #GreedyAlgorithm #Strings #ProblemSolving #Coding #Programming #Cpp #STL #SoftwareEngineering #ComputerScience #CodingPractice #DeveloperLife #TechJourney #CodingDaily #100DaysOfCode #BuildInPublic #AlgorithmPractice #CodingSkills #Developers #TechCommunity #SoftwareDeveloper #EngineeringJourney

Today I worked on leetcode problem no. 1415 The k-th Lexicographical Happy String of Length n.” First, let's understand the concept. A happy string is a string that: Uses only the characters 'a', 'b', 'c' Does not allow two adjacent characters to be the same Concepts practiced: Backtracking Lexicographical ordering Recursion Start with an empty string Try adding 'a', 'b', 'c' Skip a character if it is the same as the previous one When the string length becomes n, we found one valid happy string Since we generate them in lexicographical order, the moment we reach the k-th string, that is our answer. #leetcode #leetcode1415 #dsa #datastructures #algorithms #backtracking #recursion #coding #programming #problemSolving #codingpractice #softwareengineering #developer #codinglife #computerscience #codingjourney #learncoding #codingcommunity #buildinpublic #100daysofcode #competitiveprogramming #cpp #techskills

New video is up! 🎬 Here is a quick walkthrough of how I built Readme Genie. It's completely open-source with a working live demo. Dive into the codebase and let's build together! 🚀💻 🔗 github.com/zainali50p #OpenSourceProject #DevCommunity #Coding

🚀 Day 181 of #200DaysOfCoding Today I solved “Minimum Changes To Make Alternating Binary String” on LeetCode. 🔹 Problem: We are given a binary string consisting of 0 and 1. In one operation, we can flip any character (0 → 1 or 1 → 0). The goal is to make the string alternating, meaning no two adjacent characters are the same. Example of alternating strings: 0101, 1010 🔹 Key Insight: An alternating binary string can only have two possible patterns: 1️⃣ 010101... 2️⃣ 101010... So the idea is simple: Count how many changes are needed to convert the string to pattern 1. Count how many changes are needed to convert it to pattern 2. The minimum of the two will be the answer. ⏱ Time Complexity: O(n) 📦 Space Complexity: O(1) Consistent practice is helping me improve my problem-solving and pattern recognition skills every day. #leetcode #coding #programming #cpp #100daysofcode #200daysofcoding #softwaredevelopment

Most developers spend a huge chunk of their time debugging code. Tools like GitHub Copilot are changing the game by helping catch bugs faster and saving hours each week. Swipe through to see how AI-powered debugging can boost productivity! #ArtificialIntelligence #AIPrompting #SoftwareDevelopment #FullStackDeveloper #Coding #TechCommunity

🚀 Day 9/60 — LeetCode Discipline Problem Solved: Container With Most Water (Revision) Difficulty: Medium Today’s session focused on revisiting this classic two-pointer optimization problem. The key insight was understanding how intelligently moving pointers can reduce time complexity while still exploring the optimal solution space. 💡 Focus Areas: • Strengthened two-pointer optimization technique • Improved area maximization intuition • Practiced greedy pointer movement logic • Focused on writing clean and efficient implementation ⚡ Performance Highlight: Achieved ~81% runtime efficiency on submission. Steady practice. Sharper instincts. Stronger foundations. #LeetCode #60DaysOfCode #100DaysOfCode #DSA #TwoPointers #Greedy #Algorithms #DataStructures #ProblemSolving #CodingJourney #SoftwareEngineering #TechCareers #Programming #Developers #CodingLife