Articles by Nidhi Sharma

Learn how to determine whether two strings are anagrams using character-frequency hashing, with C++, Java, and Python implementations and O(n) complexity.

Master the Longest Palindromic Substring problem! This guide offers a clear explanation, optimized code (C++, Java, Python), and interview tips for DSA success.

Learn the Group Anagrams problem in DSA with a simple and clear explanation. Step-by-step logic, examples, and clean code to help beginners and interview preparation.

Master the 'Product of Array Except Self' problem! Learn the optimized prefix and suffix product approach to solve it in O(n) time and ace your coding interviews.

Learn how to search an element in a rotated sorted array using Binary Search. This beginner-friendly DSA article explains the logic step by step with examples and clean code.

Learn the Sliding Window Technique in DSA with a simple explanation of the Longest Substring Without Repeating Characters problem. Step-by-step logic with clean code examples.

Learn the 3 Sum Problem in DSA with a simple and clear explanation. This beginner-friendly article explains the optimized approach step by step with examples and clean code.

Learn the Two Sum Problem in DSA using a simple Array and HashMap approach. This beginner-friendly article explains the logic step by step with examples and clean code.

Learn how to solve the Maximum Subarray Sum problem using Kadane’s Algorithm. This beginner-friendly DSA article explains the concept step by step with examples, code, and time complexity.