FOFortunatus Olorunsolainfortunatus-notes.hashnode.dev·Aug 9 · 10 min readSolving 1920: how to store 2 numbers in 1Check out the problem here. The first and obvious solution to this problem is even in the question: ans[i] = nums[nums[i]]. You loop over the nums array and in each iteration, you just put whatever nu00
RKRohit Kumharintech-rohit.hashnode.dev·Jul 23 · 38 min readMaster the Two Pointers Pattern in Python (Part 1): Two Sum, Squares of Sorted Array & Remove DuplicatesIntroduction If you've spent time solving coding interview problems, you've probably noticed a common pattern: many array problems seem to invite a nested loop solution. While that approach works, it 10
GCGunjan C.inleetcodevisualized.hashnode.dev·Jul 17 · 4 min readLeetCode #01 | 2390. Removing Stars From a String | Stack Approach | Java, C & Python👋 Introduction Welcome to LeetCode Visualized! In this series, we'll solve LeetCode problems using visual explanations, intuitive walkthroughs, and clean implementations in Java, Python, and C. Today10
ATArpit Tiwariinarpittiwari.hashnode.dev·Jul 8 · 6 min readLeetCode Is Dead: What AI Actually Killed and What It Didn't"LeetCode is dead. Nobody writes code line by line anymore." I’ve been going through a lot about this post ever since it went viral. There’s an entire thread on Reddit that’s hilariously jumbled up wi01M
AMAlex Mateoinalexmateo.hashnode.dev·May 10 · 11 min readGraph Algorithms for Coding Interviews: When to Use BFS, DFS, or DijkstraGraphs are the most feared topic in coding interviews — not because they're impossible, but because most people learn the algorithms in isolation without understanding when to use each one. This guide00
FCFelipe Castilloinopencodex.hashnode.dev·Apr 4 · 9 min readHow to Solve Your First LeetCode Problem: A Beginner's GuideHow to Solve Your First LeetCode Problem: A Beginner's Guide LeetCode has become the favorite playground for developers preparing for technical interviews. With over 3,500 problems ranging from "easy"00
Hhimanshuinblogs-himanshu.hashnode.dev·Feb 28 · 3 min readDay 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: [300
Hhimanshuinblogs-himanshu.hashnode.dev·Feb 23 · 3 min readDay 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: [300
Hhimanshuinblogs-himanshu.hashnode.dev·Feb 22 · 3 min readDay 18 - Koko Eating BananasQuestion You are given an integer array piles where piles[i] is the number of bananas in the ith pile. You are also given an integer h, which represents the number of hours you have to eat all the ban00
Hhimanshuinblogs-himanshu.hashnode.dev·Feb 21 · 3 min readDay 17 - Search a 2d MatrixQuestion You are given an m x n 2-D integer array matrix and an integer target. Each row in matrix is sorted in non-decreasing order. The first integer of every row is greater than the last integer 00
