RRajesh Gurajala·Sep 27, 2025RecursionA function calls itself until specific condition is met. Example: void print(int now, int target){ if(now==target) return; cout<<now<<endl; print(now+1, target); } int main(){ print(1,11); return 0; } What if there’s no if condi...4 min read·learning-dsa.hashnode.dev
RRajesh Gurajala·Sep 27, 2025Sorting TechniquesPopular sorting techniques include: Selection sort Bubble sort Insertion sort Merge sort Quick sort Selection Sort void selectionSort(vector<int>& arr){ int n = arr.size(); for(int i = 0; i < n; i++){ int minimum = i; f...2 min read·learning-dsa.hashnode.dev
RreverieInLoop·Jul 22, 2025DSA in the Wild: My Survival Log BeginsA student’s honest take on learning DSA in a world flooded with too many resources, too many bugs, and not enough clarity.2 min read·dsa-in-the-wild.hashnode.dev
JJava·Jul 3, 2025Quick Solutions for the 2Sum Problem on LeetcodeDiscover efficient solutions for Leetcode's 2Sum problem using hash maps to find indices quickly1 min read·javagar.hashnode.dev
JJava·Jul 2, 2025Solving the Rotated Sorted Array Search Problem: A Helpful Solution.Learn how to efficiently search a rotated sorted array using binary search techniques to achieve optimal performance in `O(logn)` time complexity2 min read·javagar.hashnode.dev11A
JJava·Jul 1, 2025Solving LeetCode's Best Time to Buy and Sell Stock ChallengeLearn how to solve LeetCode's Best Time to Buy and Sell Stock challenge to maximize your profits with smart strategy2 min read·javagar.hashnode.dev
JJava·Jun 30, 2025How to Complete the Two Sum Challenge on LeetcodeLearn how to solve the Two Sum problem on Leetcode using nested loops and hash map strategies with various time complexities3 min read·javagar.hashnode.dev
JJava·Jun 29, 2025Efficient Method to Identify the Minimum in a Rotated Sorted ArrayLearn how to identify the minimum in a rotated sorted array efficiently with a time complexity of O(log(n))3 min read·javagar.hashnode.dev
JJava·Jun 28, 2025How to Solve the Maximum Product Subarray Problem on LeetcodeLearn efficient strategies to solve the Maximum Product Subarray problem on LeetCode using nested loops and Kadane's algorithm3 min read·javagar.hashnode.dev
JJava·Jun 27, 2025How to Solve the Maximum Subarray Problem on LeetCode [53]Learn methods to solve the Maximum Subarray problem on LeetCode, from nested loops to Kadane's Algorithm and Divide and Conquer3 min read·javagar.hashnode.dev