--- title: "#leetcodedaily articles | Hashnode" description: "Explore 200 articles tagged #leetcodedaily on Hashnode. Tutorials, guides, and how-tos from the community." url: "https://hashnode.com/tag/leetcodedaily" --- Tag # #leetcodedaily 200 posts · 46 followers [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 22](https://hashnode.com/posts/koko%20eating%20banana/699ab36de8d394da492bc755) ### [Day 18 - Koko Eating Bananas](https://blogs-himanshu.hashnode.dev/koko%20eating%20banana?utm_source=hashnode&utm_medium=feed) Question 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 ban 3 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/koko%20eating%20banana?utm_source=hashnode&utm_medium=feed) [himanshu](https://hashnode.com/@Himanshu-) · [Feb 21](https://hashnode.com/posts/search2dmatrix/69994b02a20b74e093e1a8d4) ### [Day 17 - Search a 2d Matrix](https://blogs-himanshu.hashnode.dev/search2dmatrix?utm_source=hashnode&utm_medium=feed) Question 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 3 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/search2dmatrix?utm_source=hashnode&utm_medium=feed) [himanshu](https://hashnode.com/@Himanshu-) · [Feb 20](https://hashnode.com/posts/dailytemperature/6997f5ea587b14d25b776e64) ### [Day 16 - Daily Temperatures](https://blogs-himanshu.hashnode.dev/dailytemperature?utm_source=hashnode&utm_medium=feed) Question You are given an array of integers temperatures where temperatures\[i\] represents the daily temperatures on the ith day. Return an array result where result\[i\] is the number of days after the 4 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/dailytemperature?utm_source=hashnode&utm_medium=feed) [himanshu](https://hashnode.com/@Himanshu-) · [Feb 19](https://hashnode.com/posts/day-15-evaluate-reverse-polish-notation/69969ec95eb4f8f5bd33a36d) ### [Day 15 - Evaluate Reverse Polish Notation](https://blogs-himanshu.hashnode.dev/day-15-evaluate-reverse-polish-notation?utm_source=hashnode&utm_medium=feed) Evaluate arithmetic expressions in Reverse Polish Notation using a stack-based approach for quick integer results 2 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/day-15-evaluate-reverse-polish-notation?utm_source=hashnode&utm_medium=feed) [himanshu](https://hashnode.com/@Himanshu-) · [Feb 18](https://hashnode.com/posts/day-14-min-stack/69955954246d39efde562ee8) ### [Day 14 - Min Stack](https://blogs-himanshu.hashnode.dev/day-14-min-stack?utm_source=hashnode&utm_medium=feed) Design a MinStack supporting push, pop, top, and getMin operations efficiently, running each in O(1) time 3 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/day-14-min-stack?utm_source=hashnode&utm_medium=feed) [himanshu](https://hashnode.com/@Himanshu-) · [Feb 16](https://hashnode.com/posts/day-13-valid-parenthesis/6992d24b6c4e9a057324847f) ### [Day 13 - Valid Parenthesis](https://blogs-himanshu.hashnode.dev/day-13-valid-parenthesis?utm_source=hashnode&utm_medium=feed) Check if a string of brackets is valid using a stack-based algorithm. Efficient solution with O(n) time complexity 2 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/day-13-valid-parenthesis?utm_source=hashnode&utm_medium=feed) [himanshu](https://hashnode.com/@Himanshu-) · [Feb 15](https://hashnode.com/posts/day-12-3sum/699187c786d3802356fdaf8a) ### [Day 12 - 3Sum](https://blogs-himanshu.hashnode.dev/day-12-3sum?utm_source=hashnode&utm_medium=feed) Find all unique triplets in an integer array that sum to zero using a two-pointer technique for efficient results 3 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/day-12-3sum?utm_source=hashnode&utm_medium=feed) [himanshu](https://hashnode.com/@Himanshu-) · [Feb 13](https://hashnode.com/posts/day-11-two-integer-sum-ii/698eb87da641f6302df42531) ### [Day 11 - Two Integer Sum II](https://blogs-himanshu.hashnode.dev/day-11-two-integer-sum-ii?utm_source=hashnode&utm_medium=feed) Find two indices from a sorted array that sum to a target, using a two-pointer technique 2 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/day-11-two-integer-sum-ii?utm_source=hashnode&utm_medium=feed) [himanshu](https://hashnode.com/@Himanshu-) · [Feb 12](https://hashnode.com/posts/day-10-valid-palindrome/698d79b22df3fc4650dda159) ### [Day 10 - Valid Palindrome](https://blogs-himanshu.hashnode.dev/day-10-valid-palindrome?utm_source=hashnode&utm_medium=feed) Determine if a string is a palindrome, ignoring case and non-alphanumeric characters, using a two-pointer approach 2 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/day-10-valid-palindrome?utm_source=hashnode&utm_medium=feed)