--- title: "#leetcode-solution articles | Hashnode" description: "Explore 664 articles tagged #leetcode-solution on Hashnode. Tutorials, guides, and how-tos from the community." url: "https://hashnode.com/tag/leetcode-solution" --- Tag # #leetcode-solution 664 posts 路 68 followers [Linkjob AI](https://hashnode.com/@linkjob) 路 [Nov 3](https://hashnode.com/posts/palindrome-linked-list-leetcode-234-o-1-space-without-losing-the-list/6aea23d1cadde8ab9055a509) ### [Palindrome Linked List (LeetCode 234): O(1) Space Without Losing the List](https://linkjob-ai.hashnode.dev/palindrome-linked-list-leetcode-234-o-1-space-without-losing-the-list?utm_source=hashnode&utm_medium=feed) Given 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](https://linkjob-ai.hashnode.dev/palindrome-linked-list-leetcode-234-o-1-space-without-losing-the-list?utm_source=hashnode&utm_medium=feed) [swayanprabha](https://hashnode.com/@swayan) 路 [Oct 20](https://hashnode.com/posts/binary-search/6ad7405ce311ba6d058b8942) ### [Stop Thinking Binary Search Is Only for Searching 馃攳](https://dsadiscuss.hashnode.dev/binary-search?utm_source=hashnode&utm_medium=feed) It鈥檚 a way of asking the right questions and making the right choice. 7 min read 路 [dsadiscuss.hashnode.dev](https://dsadiscuss.hashnode.dev/binary-search?utm_source=hashnode&utm_medium=feed) [Fortunatus Olorunsola](https://hashnode.com/@whatisnatus27) 路 [Aug 9](https://hashnode.com/posts/solving-1920-how-to-store-2-numbers-in-1/6a78721e1c5680ecc81f7d54) ### [Solving 1920: how to store 2 numbers in 1](https://fortunatus-notes.hashnode.dev/solving-1920-how-to-store-2-numbers-in-1?utm_source=hashnode&utm_medium=feed) For 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](https://fortunatus-notes.hashnode.dev/solving-1920-how-to-store-2-numbers-in-1?utm_source=hashnode&utm_medium=feed) [Rohit Kumhar](https://hashnode.com/@techrohit) 路 [Jul 23](https://hashnode.com/posts/master-the-two-pointers-pattern-in-python/6a628304aec868cf3accbcb5) ### [Master the Two Pointers Pattern in Python (Part 1): Two Sum, Squares of Sorted Array & Remove Duplicates](https://tech-rohit.hashnode.dev/master-the-two-pointers-pattern-in-python?utm_source=hashnode&utm_medium=feed) A beginner-friendly guide to understanding, recognizing, and applying the Two Pointers pattern in coding interviews. 38 min read 路 [tech-rohit.hashnode.dev](https://tech-rohit.hashnode.dev/master-the-two-pointers-pattern-in-python?utm_source=hashnode&utm_medium=feed) [Gunjan C.](https://hashnode.com/@gkc5) 路 [Jul 17](https://hashnode.com/posts/leetcode-2390-removing-stars-from-a-string/6a59d288079594ee19fd20ab) ### [LeetCode #01 | 2390. Removing Stars From a String | Stack Approach | Java, C & Python](https://leetcodevisualized.hashnode.dev/leetcode-2390-removing-stars-from-a-string?utm_source=hashnode&utm_medium=feed) Learn 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.dev](https://leetcodevisualized.hashnode.dev/leetcode-2390-removing-stars-from-a-string?utm_source=hashnode&utm_medium=feed) [Arpit Tiwari](https://hashnode.com/@arpittiwari) 路 [Jul 8](https://hashnode.com/posts/leetcode-is-dead-what-ai-actually-killed-and-what-it-didn-t/6a4e345b87c3ca6db8540135) ### [LeetCode Is Dead: What AI Actually Killed and What It Didn't](https://arpittiwari.hashnode.dev/leetcode-is-dead-what-ai-actually-killed-and-what-it-didn-t?utm_source=hashnode&utm_medium=feed) Is LeetCode dead? Here's what AI actually changed about coding interviews and what it didn't. 6 min read 路 [arpittiwari.hashnode.dev](https://arpittiwari.hashnode.dev/leetcode-is-dead-what-ai-actually-killed-and-what-it-didn-t?utm_source=hashnode&utm_medium=feed) [1](https://hashnode.com/posts/leetcode-is-dead-what-ai-actually-killed-and-what-it-didn-t/6a4e345b87c3ca6db8540135) [Alex Mateo](https://hashnode.com/@alexmateo) 路 [May 10](https://hashnode.com/posts/graph-algorithms-for-coding-interviews-when-to-use-bfs-dfs-or-dijkstra/6a004c68e3eebc2e20584ea5) ### [Graph Algorithms for Coding Interviews: When to Use BFS, DFS, or Dijkstra](https://alexmateo.hashnode.dev/graph-algorithms-for-coding-interviews-when-to-use-bfs-dfs-or-dijkstra?utm_source=hashnode&utm_medium=feed) Learn 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](https://alexmateo.hashnode.dev/graph-algorithms-for-coding-interviews-when-to-use-bfs-dfs-or-dijkstra?utm_source=hashnode&utm_medium=feed) [Felipe Castillo](https://hashnode.com/@barrazadev) 路 [Apr 4](https://hashnode.com/posts/how-to-solve-your-first-leetcode-problem-a-beginner-s-guide/69d165d76792e486f6be6868) ### [How to Solve Your First LeetCode Problem: A Beginner's Guide](https://opencodex.hashnode.dev/how-to-solve-your-first-leetcode-problem-a-beginner-s-guide?utm_source=hashnode&utm_medium=feed) LeetCode 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](https://opencodex.hashnode.dev/how-to-solve-your-first-leetcode-problem-a-beginner-s-guide?utm_source=hashnode&utm_medium=feed) [himanshu](https://hashnode.com/@Himanshu-) 路 [Feb 28](https://hashnode.com/posts/search-in-rotated-sorted-array/69a27f77d4053a09f3782dd4) ### [Day 20 - Search in Rotated Sorted Array](https://blogs-himanshu.hashnode.dev/search-in-rotated-sorted-array?utm_source=hashnode&utm_medium=feed) Question 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: \[3 3 min read 路 [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/search-in-rotated-sorted-array?utm_source=hashnode&utm_medium=feed) [himanshu](https://hashnode.com/@Himanshu-) 路 [Feb 23](https://hashnode.com/posts/day-19-find-minimum-in-rotated-sorted-array/699bea2e8dabaa365a768fa0) ### [Day 19 - Find Minimum in Rotated Sorted Array](https://blogs-himanshu.hashnode.dev/day-19-find-minimum-in-rotated-sorted-array?utm_source=hashnode&utm_medium=feed) Question 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: \[3 3 min read 路 [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/day-19-find-minimum-in-rotated-sorted-array?utm_source=hashnode&utm_medium=feed)