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
Jump to Specific Character in Vim with f{char}
More Relevant Posts
-
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
To view or add a comment, sign in
-
-
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
To view or add a comment, sign in
-
-
Several goroutines updating the same variable can race: reads and writes overlap and you get wrong totals. sync.Mutex fixes that. You declare the mutex, then only one goroutine at a time runs the bit between Lock and Unlock. That is the critical section. Everyone else waits until Unlock. No inheritance, no magic: one lock, one counter update at a time. This is how Go keeps shared memory safe when goroutines run in parallel. Lock, change, unlock. Follow me for more Go bytes #golang #golangtips #goprogramming #coding #softwaredevelopment
To view or add a comment, sign in
-
-
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
To view or add a comment, sign in
-
Just solved a challenging binary tree problem! 🌳💻 🔍 Problem: Given a binary tree and an integer k, find the number of downward-only paths where the sum of node values equals k. ➡️ Paths can start and end at any node, but must always move from parent to child. 💡 Key Insight: Using prefix sum + hashmap during DFS traversal helps efficiently track all valid paths in O(n) time! ✅ All test cases passed ⚡ Optimized approach 🔥 Consistency streak continues! #geekstreak #gfg #npci #coding #dsa #binarytree #algorithms #100DaysOfCode #programming #developers #techgrowth
To view or add a comment, sign in
-
-
Stop letting the Garbage Collector dictate your API's latency. 🛑 In a high-frequency environment—think 10,000 requests per second—the "standard" way of handling JSON can become a bottleneck. Every time you allocate a new struct, you’re creating work for the Go Garbage Collector. By using sync.Pool, we can: ✅ Reuse memory instead of constantly allocating. ✅ Keep our data in the CPU cache (L1/L2) for microsecond speeds. ✅ Flatten the "sawtooth" memory profile. #go #golang #coding #programming
Your Go API is SLOW (And it’s the Garbage Collector’s fault) #golang #go #coding
https://www.youtube.com/
To view or add a comment, sign in
-
#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
To view or add a comment, sign in
-
-
🚀 Day 2 of #100DaysOfCode 📌 Reverse Integer 🔗 https://lnkd.in/gtKB8Mdi ✅ Accepted (All test cases passed) ⚡ Runtime: 0 ms 🧠 Approach: Reversed the number digit by digit using modulo and division, while handling overflow conditions carefully. ⏱️ Time: O(log n) | 📦 Space: O(1) 💡 Learning: Handling edge cases like overflow is the key part of this problem. #leetcode #dsa #cpp #coding #developers
To view or add a comment, sign in
-
-
Day 19 of #GeekStreak60 🚀 Today’s problem focused on strengthening my understanding of Dynamic Programming and counting techniques in DSA. While solving it, the key takeaway was how breaking a problem into smaller subproblems and storing intermediate results can significantly reduce time complexity. Instead of brute forcing every possibility, DP helps build the solution step-by-step using previously computed states. #GeeksforGeeks #DSA #DynamicProgramming #ProblemSolving #Cpp #CodingJourney #Consistency #100DaysOfCode
To view or add a comment, sign in
-
-
POV: You chose programming and now your life is debugging, caffeine, and folders named final_final_really_final ☕💻 Programmers will understand this pain. Which slide is too real for you? 😂 #UnitedSol #Tech #Programming #Meme #SoftwareDevelopers
To view or add a comment, sign in
More from this author
Explore content categories
- Career
- Productivity
- Finance
- Soft Skills & Emotional Intelligence
- Project Management
- Education
- Technology
- Leadership
- Ecommerce
- User Experience
- Recruitment & HR
- Customer Experience
- Real Estate
- Marketing
- Sales
- Retail & Merchandising
- Science
- Supply Chain Management
- Future Of Work
- Consulting
- Writing
- Economics
- Artificial Intelligence
- Employee Experience
- Workplace Trends
- Fundraising
- Networking
- Corporate Social Responsibility
- Negotiation
- Communication
- Engineering
- Hospitality & Tourism
- Business Strategy
- Change Management
- Organizational Culture
- Design
- Innovation
- Event Planning
- Training & Development