LLinkjob AI路Nov 3Palindrome Linked List (LeetCode 234): O(1) Space Without Losing the ListGiven the head of a singly linked list, return true if it reads the same forward and backward. Easy version: copy to an array Push every value into a list and compare it with its reverse. That's O(n)2 min read路linkjob-ai.hashnode.dev
Sswayanprabha路Oct 20Stop Thinking Binary Search Is Only for Searching 馃攳It鈥檚 a way of asking the right questions and making the right choice.7 min read路dsadiscuss.hashnode.dev
FFortunatus Olorunsola路Aug 9Solving 1920: how to store 2 numbers in 1For LeetCode 1920, an O(n) solution wasn't good enough. It wanted O(1) space. Here's the math trick (quotients & remainders) that makes it work.10 min read路fortunatus-notes.hashnode.dev
RRohit Kumhar路Jul 23Master the Two Pointers Pattern in Python (Part 1): Two Sum, Squares of Sorted Array & Remove DuplicatesA beginner-friendly guide to understanding, recognizing, and applying the Two Pointers pattern in coding interviews.38 min read路tech-rohit.hashnode.dev1
GGunjan C.路Jul 17LeetCode #01 | 2390. Removing Stars From a String | Stack Approach | Java, C & PythonLearn LeetCode 2390 with a visual stack explanation and clean Java, Python, and C solutions. Perfect for DSA and interview preparation.4 min read路leetcodevisualized.hashnode.dev1
AArpit Tiwari路Jul 8LeetCode Is Dead: What AI Actually Killed and What It Didn'tIs LeetCode dead? Here's what AI actually changed about coding interviews and what it didn't.6 min read路arpittiwari.hashnode.dev1M
AAlex Mateo路May 10Graph Algorithms for Coding Interviews: When to Use BFS, DFS, or DijkstraLearn when to use BFS, DFS, or Dijkstra in coding interviews. Decision framework, complexity, and classic problems for each algorithm.11 min read路alexmateo.hashnode.dev
FFelipe Castillo路Apr 4How to Solve Your First LeetCode Problem: A Beginner's GuideLeetCode can be intimidating for beginners. This guide walks you through solving your first problem step-by-step, understanding patterns and building.9 min read路opencodex.hashnode.dev
Hhimanshu路Feb 28Day 20 - Search in Rotated Sorted ArrayQuestion You are given an array of length n which was originally sorted in ascending order. It has now been rotated between 1 and n times. For example, the array nums = [1,2,3,4,5,6] might become: [33 min read路blogs-himanshu.hashnode.dev
Hhimanshu路Feb 23Day 19 - Find Minimum in Rotated Sorted ArrayQuestion You are given an array of length n which was originally sorted in ascending order. It has now been rotated between 1 and n times. For example, the array nums = [1,2,3,4,5,6] might become: [33 min read路blogs-himanshu.hashnode.dev
