Jul 3, 2025 · 5 min read · LeetCode Link Date: 30th June 2025 Tags: Hash Map, Frequency Counting, Array, Easy, Subsequence Problem Overview We define a harmonious array as an array where the difference between its maximum value and its minimum value is exactly 1. Given an in...
Join discussion
Mar 26, 2025 · 2 min read · Understanding the Problem Given strings s and t, it is to tell whether s is the subsequence to t. It is not finding if the characters in s exist in t. Well basically it is, but the sequence matters too. # example Input: s = "abc", t = "ahbgdc" Output...
Join discussion
Dec 27, 2024 · 5 min read · Recursion is a powerful concept that simplifies problem-solving by breaking down problems into smaller subproblems. In this blog, we will explore advanced topics in recursion, specifically Quick Sort, Merge Sort, Subsets, and Subsequences. These conc...
Join discussionSep 20, 2023 · 2 min read · Substring 👍 A substring is a contiguous(continuous) sequence of characters present within a string. It is a string present inside a string.For instance, the substrings of the string “tree” would be:‘t,’ ‘r,’ ‘e,’ ‘tr,’ ‘tre,’ ‘tree,’ ‘re,’ ‘ree,’ ‘e...
Join discussionDec 16, 2022 · 3 min read · As we all know that Recursion is calling the function itself again and again until the base condition is satisfied. So,in order to make a recursive function we should keep in mind the base condition and the function definition we want to create. Ple...
Join discussion