Reverse Shuffle Merge | HackerRank Solution [Advanced]
Given a string s such that, s ∈ merge(reverse(A), shuffle(A)) for some string A, find the lexicographically smallest A
Category: Competitive Programming
Generate Parentheses – LeetCode Solution [Medium]
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
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
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.
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.
Reinfected Solution | CodeChef Puzzle in C++
We are very near to our goal now. The enemy is being weakened continuously. But alas, sensing his fall, the hacker has spread a worm into our network. It is consuming all our files at a tremendous rate and must be stopped at all costs. The only way to stop it is to enter a specific code number in to the worm.
Hardware Store | CodeChef Puzzle in C++
The first and the last digits of the price were not readable. Although, the number of nails in the box could be read clearly. The box read,
72 nails, Rs. _679_
Riled Solution | CodeChef Puzzle in C++
Someone is trying to break into Thapar University’s Database and steal sensitive research information. It is now up to us to stop this attack. Fortunately our defence mechanisms have traced the attacks to their source. The fastest way to stop the attacks is to disable the source.
Check if string contains substring in C++
Given two strings, A and B, output true if B is a substring of A and false otherwise. The first line contains the number of test cases T. This is followed by T lines each consisting of pairs of binary strings A and B.