Sandhiya Priya's contributions

A detailed guide to solving the Minimum Window Subsequence problem using a greedy two-pointer approach. The article explains how to find the smallest substring in a string that contains another string as a subsequence, using forward scanning to match characters and backward scanning to minimize the window. It includes step-by-step intuition, dry run, and an optimized O(n × m) solution suitable for coding interviews.

Maximize thieves caught by policemen within distance 'k' using a greedy two-pointer approach. Optimal O(n) solution ensures the closest valid pairs are matched first.

A comprehensive guide explaining how to check whether a stored procedure exists in SQL Server using multiple methods such as INFORMATION_SCHEMA, sys.procedures, OBJECT_ID, and SSMS UI. The article also highlights practical use cases, best practices, and common issues developers face while validating stored procedures across different environments like development and production.

A detailed guide to solving the “Minimum Swaps to Group All 1s Together” problem using the efficient sliding window technique. Learn how to avoid brute-force swaps by transforming the problem into finding the optimal subarray, along with step-by-step explanation, examples, and C# implementation.

This article explains the Longest Repeating Character Replacement problem, a medium-difficulty string manipulation challenge. It provides a step-by-step solution using the sliding window technique combined with a frequency array, along with examples and complexity analysis. The method efficiently computes the longest substring that can be transformed into a string with all identical characters after at most k character replacements.

Learn how to efficiently solve the Substrings With Exactly K Distinct Characters problem using the sliding window technique. This guide explains the key insight of converting the problem into “at most K” subproblems, includes step-by-step intuition, dry run examples, and an optimized Java solution with O(n) time complexity and constant space.

A detailed guide to solving the Subarrays With At Most K Distinct Integers problem using the sliding window technique. Learn the intuition, step-by-step approach, dry run examples, and optimized Java implementation with O(n) time complexity. Perfect for coding interviews and mastering array-based problems.

Master the 'Count Subarrays with K Odd Numbers' problem using the sliding window and 'atMost(k) - atMost(k-1)' technique. Optimize your coding interview prep with this O(n) solution!

Master the sliding window technique! Learn how to efficiently count distinct elements in every window of an array using a HashMap. Java solution and complexity analysis included.

Master the sliding window technique to find the maximum sum subarray of size K. This guide provides a clear explanation, Java code, and complexity analysis.

Master linked list flattening! Learn to merge sorted sub-lists using recursion and the merge sort pattern. Conquer vertical + horizontal pointer problems effectively. Dive into the Java solution!

Solve the streaming first non-repeating character problem using a queue and frequency array. Learn the algorithm, Java code, complexity, and key takeaways for interviews.

Master the H-Index problem with this guide! Learn the sorting approach to efficiently find the maximum H-index, balancing paper quantity and citations. Includes Java code!

Master the largest number problem! Learn how to use custom comparators and greedy algorithms to arrange integers for maximum value. Perfect for coding interviews!

Solve partition problems by transforming them into subset sum problems! This DP approach efficiently counts subsets with a specific difference. Learn the key formula!

Master Tarjan's Algorithm to find articulation points (cut vertices) in undirected graphs! Learn to identify critical nodes that disconnect a graph. Includes Java code!

Solve the classic 'Chocolates Pickup' problem with 3D Dynamic Programming! Maximize chocolate collection by two robots moving simultaneously. Java solution included.

Solve the Rotten Oranges problem using multi-source BFS! Find the minimum time to rot all fresh oranges in a grid. Learn the BFS approach with Java code and complexity analysis.

Calculate the number of unique Binary Search Trees (BSTs) possible for each element in an array as the root. Leverages Catalan numbers for efficient computation.

Master the 'Opposite Sign Pair Reduction' problem! Learn how to efficiently reduce an array using a stack-based approach, simulating collisions. Includes Java code & complexity analysis.

Find buildings visible to sunlight using a greedy algorithm! This problem focuses on array traversal, tracking maximums, and handling edge cases like equal heights. A common interview question!

Master the Sliding Window technique! This guide solves the 'Smallest Window Containing 0, 1, and 2' problem with clear explanations, examples, and Java code. Find the shortest substring efficiently!

Learn how to efficiently determine if an array can be split into two contiguous subarrays with equal sums using the prefix sum technique. Optimal O(n) solution!

Master Dijkstra's Algorithm to find the shortest path and count unique routes to a destination in a weighted graph. Includes Java code and complexity analysis.

Maximize stock-trading profit with a transaction fee using a two-state dynamic programming approach. Includes an O(n)-time, O(1)-space Java solution using hold and cash states.