- Count ways of choosing a pair with maximum difference
- Number of positions where a letter can be inserted such that a string becomes palindrome
- Minimum cost to connect weighted nodes represented as array
- Pairs with Difference less than K
- Check if a number is divisible by all prime divisors of another number
- Ways to color a skewed tree such that parent and child have different colors
- Maximum Unique Element in every subarray of size K
- Number of subsequences as "ab" in a string repeated K times
- Pair with given sum and maximum shortest distance from end
- K-Primes (Numbers with k prime factors) in a range
- Probability of choosing a random pair with maximum sum in an array
- Longest alternating (positive and negative) subarray starting at every index
- Express an odd number as sum of prime numbers
- Break a number such that sum of maximum divisors of all parts is minimum
- Longest subsegment of '1's formed by changing at most k '0's
- Minimum insertions to make a Co-prime array
- Largest subset with sum of every pair as prime
- Rearrange array such that even positioned are greater than odd
- Smallest subarray with all occurrences of a most frequent element
- Change the array into a permutation of numbers from 1 to n
- Print a closest string that does not contain adjacent duplicates
- Numbers whose factorials end with n zeros
- Possible edges of a tree for given diameter, height and vertices
- Check if it is possible to make array equal by doubling or tripling
- Value of k-th index of a series formed by append and insert MEX in middle
- Maximum OR sum of sub-arrays of two different arrays
- Find a string in lexicographic order which is in between given two strings
- Number of horizontal or vertical line segments to connect 3 points
- Reduce Hamming distance by swapping two characters
- Make a lexicographically smallest palindrome with minimal changes
- Find N integers with given difference between product and sum
- list unique() in C++ STL
- smatch max_size() function in C++ STL
- match_results cbegin() add cend() in C++ STL
- match_results begin() and end() function in C++ STL
- match_results size() in C++ STL
- match_results operator[] in C++ STL
- match_results operator= in C++
- match_results length() in C++ STL
- match_results empty() in C++ STL
- match_results prefix() and suffix() in C++

Harsha_Mogali hasn't improved any 'Articles' yet!