new(blogpost):

fezcode · fezcode · commit 8e0bd7ab6bab · 2025-11-08T00:29:01.000+03:00
diff --git a/public/posts/algos/find-minimum-in-rotated-sorted-array.txt b/public/posts/algos/find-minimum-in-rotated-sorted-array.txt
@@ -0,0 +1,57 @@
+# Find Minimum in Rotated Sorted Array
+
+## Problem Description
+
+Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
+(i.e., `[0,1,2,4,5,6,7]` might become `[4,5,6,7,0,1,2]`).
+
+Find the minimum element.
+
+You may assume no duplicate exists in the array.
+
+## Solution
+
+This problem can be solved efficiently using a modified binary search approach.
+The key idea is to observe that if we pick an arbitrary element `mid`, one of the two halves (left or right) must be sorted.
+The minimum element will always be in the unsorted half.
+
+1.  Initialize `left` to 0 and `right` to `len(nums) - 1`.
+2.  While `left < right`:
+    a.  Calculate `mid = left + (right - left) / 2`.
+    b.  If `nums[mid] > nums[right]`, it means the minimum element is in the right half (from `mid + 1` to `right`), because the right part is unsorted. So, set `left = mid + 1`.
+    c.  Else (`nums[mid] < nums[right]`), it means the minimum element is in the left half (from `left` to `mid`), because the right part is sorted, and `nums[mid]` could be the minimum. So, set `right = mid`.
+3.  Return `nums[left]` (or `nums[right]`, as `left` and `right` will converge to the minimum element's index).
+
+## Code (GoLang)
+
+```go
+package main
+
+import "fmt"
+
+func findMin(nums []int) int {
+    left, right := 0, len(nums)-1
+
+    for left < right {
+        mid := left + (right-left)/2
+        if nums[mid] > nums[right] {
+            // Minimum is in the right half (mid+1 to right)
+            left = mid + 1
+        } else {
+            // Minimum is in the left half (left to mid)
+            // nums[mid] could be the minimum
+            right = mid
+        }
+    }
+
+    return nums[left]
+}
+
+func main() {
+    fmt.Println(findMin([]int{3, 4, 5, 1, 2})) // Output: 1
+    fmt.Println(findMin([]int{4, 5, 6, 7, 0, 1, 2})) // Output: 0
+    fmt.Println(findMin([]int{1})) // Output: 1
+    fmt.Println(findMin([]int{1, 2})) // Output: 1
+    fmt.Println(findMin([]int{2, 1})) // Output: 1
+}
+```
diff --git a/public/posts/posts.json b/public/posts/posts.json
@@ -241,6 +241,15 @@
     "tags": ["cs", "algorithms", "graphs"],
     "series": {
       "posts": [
+        {
+          "slug": "find-minimum-in-rotated-sorted-array",
+          "title": "Find Minimum in Rotated Sorted Array",
+          "date": "2025-11-08",
+          "description": "LeetCode problem: Find Minimum in Rotated Sorted Array",
+          "tags": ["cs", "algorithms", "binary-search", "array"],
+          "category": "dev",
+          "filename": "/algos/find-minimum-in-rotated-sorted-array.txt"
+        },
         {
           "slug": "lca",
           "title": "Lowest Common Ancestor with Binary Search Tree",
diff --git a/src/components/Navbar.js b/src/components/Navbar.js
@@ -1,7 +1,7 @@
 import React, { useState, useEffect } from 'react';
 import { Link } from 'react-router-dom';
 import Fez from './Fez';
-import { Sidebar, User, BookOpen, RocketLaunch } from '@phosphor-icons/react';
+import { Sidebar, User, BookOpen } from '@phosphor-icons/react';
 
 const Navbar = ({ toggleSidebar, isSidebarOpen }) => {
   const [isScrolled, setIsScrolled] = useState(false);
