chore: add LeetCode daily solution

Author: TechnoBlogger14o3

Easy/2026-04-24-2833-Furthest-Point-From-Origin/explanation.md

@@ -0,0 +1,43 @@
+# Furthest Point From Origin (Easy)
+
+**Problem ID:** 2833  
+**Date:** 2026-04-24  
+**Link:** https://leetcode.com/problems/furthest-point-from-origin/
+
+## Approach
+
+To solve the problem of finding the furthest point from the origin based on the given movement string, we can follow a straightforward approach that involves counting possible moves in both directions.
+
+### Problem Breakdown
+1. **Understanding Moves**:
+   - The string consists of three types of characters:
+     - 'L': Move left.
+     - 'R': Move right.
+     - '_': Move either left or right (flexible move).
+   
+2. **Goal**:
+   - We want to maximize the distance from the origin (0) after interpreting the moves.
+
+### Approach
+1. **Count Moves**:
+   - Traverse the string and count the occurrences of 'L', 'R', and '_'.
+   - Let:
+     - `countL` = number of 'L'
+     - `countR` = number of 'R'
+     - `countUnderscore` = number of '_'
+
+2. **Calculate Maximum Distance**:
+   - The furthest point can be calculated as:
+     - Move all 'L' left, which contributes `-countL` to the position.
+     - Move all 'R' right, which contributes `+countR` to the position.
+     - Use all '_' to extend either left or right.
+   - The furthest distance from the origin can be expressed as:
+     - `maxDistance = countL + countR + countUnderscore`
+   - This formula accounts for moving all possible characters to maximize the distance from the origin.
+
+### Complexity
+- **Time Complexity**: O(n), where n is the length of the string. We perform a single pass through the string to count the characters.
+- **Space Complexity**: O(1), as we are using a constant amount of space for counters.
+
+### Conclusion
+By counting the moves and utilizing the flexible moves represented by '_', we can efficiently compute the maximum distance achievable from the origin. This approach ensures that we consider all possible configurations of moves while maintaining optimal performance.

Easy/2026-04-24-2833-Furthest-Point-From-Origin/solution.java

@@ -0,0 +1,22 @@
+class Solution {
+    public int furthestDistanceFromOrigin(String moves) {
+        int leftMoves = 0;
+        int rightMoves = 0;
+        int unknownMoves = 0;
+
+        for (char move : moves.toCharArray()) {
+            if (move == 'L') {
+                leftMoves++;
+            } else if (move == 'R') {
+                rightMoves++;
+            } else if (move == '_') {
+                unknownMoves++;
+            }
+        }
+
+        int maxDistance = Math.abs((leftMoves + unknownMoves) - rightMoves);
+        maxDistance = Math.max(maxDistance, Math.abs(leftMoves - (rightMoves + unknownMoves)));
+
+        return maxDistance;
+    }
+}

Easy/2026-04-24-2833-Furthest-Point-From-Origin/solution.js

@@ -0,0 +1,17 @@
+var furthestDistanceFromOrigin = function(moves) {
+    let leftMoves = 0;
+    let rightMoves = 0;
+    let underscoreCount = 0;
+
+    for (let move of moves) {
+        if (move === 'L') {
+            leftMoves++;
+        } else if (move === 'R') {
+            rightMoves++;
+        } else if (move === '_') {
+            underscoreCount++;
+        }
+    }
+
+    return Math.abs(leftMoves - rightMoves) + underscoreCount;
+};

Easy/2026-04-24-2833-Furthest-Point-From-Origin/solution.py

@@ -0,0 +1,7 @@
+class Solution:
+    def furthestDistanceFromOrigin(self, moves: str) -> int:
+        left_moves = moves.count('L')
+        right_moves = moves.count('R')
+        underscore_moves = moves.count('_')
+        
+        return left_moves + right_moves + underscore_moves

README.md

@@ -433,3 +433,4 @@ Through completing the Blind 75 and NeetCode 150, you will have mastered:
 - 2026-04-21 — [Minimize Hamming Distance After Swap Operations](https://leetcode.com/problems/minimize-hamming-distance-after-swap-operations/) (Medium) → `Medium/2026-04-21-1722-Minimize-Hamming-Distance-After-Swap-Operations`
 - 2026-04-22 — [Words Within Two Edits of Dictionary](https://leetcode.com/problems/words-within-two-edits-of-dictionary/) (Medium) → `Medium/2026-04-22-2452-Words-Within-Two-Edits-of-Dictionary`
 - 2026-04-23 — [Sum of Distances](https://leetcode.com/problems/sum-of-distances/) (Medium) → `Medium/2026-04-23-2615-Sum-of-Distances`
+- 2026-04-24 — [Furthest Point From Origin](https://leetcode.com/problems/furthest-point-from-origin/) (Easy) → `Easy/2026-04-24-2833-Furthest-Point-From-Origin`