Max Min | HackerRank Solution [Medium]
Given a list of integers, arr, and a single integer k. Create an array of size k from elements of arr such that its unfairness is minimum
Common Child | Algorithms | HackerRank Solution [Medium]
Given two strings p and q of equal length, what’s the longest string that can be constructed such that it is a child of both?
Generate Parentheses – LeetCode Solution [Medium]
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
Sum of Left Leaves in Binary tree – LeetCode Solution [Easy]
Given the root of a binary tree, return the sum of all left leaves. Number of nodes in the tree lie in the range – [1, 1000]
Counting Bits O(n) Solution – LeetCode [Easy] | Brian Kernighan’s Algorithm
Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.
Longest Substring Without Repeating Characters – LeetCode Solution [Medium]
Given a string s, consisting of English letters, symbols and spaces, find the length of the longest substring without repeating characters.
Lowest Common Ancestor of a Binary Search Tree – LeetCode Solution [Easy]
The lowest common ancestor is defined between two nodes p and q as the lowest node in Tre that has both p and q as descendants.
Invert Binary Tree Solution in C++ – LeetCode [Easy]
Given the root of a binary tree, invert the tree, and return its root.
Substring Diff | HackerRank (Algorithms) | Longest Common Substring
Given two strings and an integer, determine the length of the longest common substrings of the two strings that differ in no more than k positions.
Anagram | HackerRank Solution | Anagram Algorithm
Two words are anagrams of one another if their letters can be rearranged to form the other word. Given a string, split it into two contiguous substrings of equal length. Determine the minimum number of characters to change to make the two substrings into anagrams of one another.