## Zigzag String

Concepts Used Strings Difficulty Level Easy Problem Statement (Simplified): For a given string S and number of rows R, we have to arrange each character on rows in a vertical...

Skip to content
## Zigzag String

## Convert Integer number to Roman Number

## Tina loves A

## Minimum number of operations to make string palindrome

## Find the missing number in sequence given as string

## FRACTION1

## Number of Substrings Containing All Three Characters

## Minimum Window Substring

## Minus Minus is Plus

## Minimum Number of Steps to Make Two Strings Anagram

Concepts Used Strings Difficulty Level Easy Problem Statement (Simplified): For a given string S and number of rows R, we have to arrange each character on rows in a vertical...

Concepts Used: Strings Difficulty Level: Medium Problem Statement (Simplified): For a given number between 0 and 4000, print out it's Roman Form. See original problem statement here Test Case: Input:...

Concepts Used: Strings, Basic Mathematics Difficulty Level: Easy Problem Statement (Simplified): Print the maximum length of string which can be formed such that the number of a is more than...

Concepts Used Strings Difficulty Level Easy Problem Statement (Simplified): Convert given string into a palindrome by decreasing or increasing characters by their ASCII value, in minimum number of operations. Each...

Concepts Used: String Difficulty Level: Medium Problem Statement (Simplified): Find the missing number in a given in a series as a string with no separator. The maximum length of the...

Concepts Used Strings Difficulty Level Hard Problem Statement (Simplified): Print the decimal output of fraction of two given numbers and enclose the repeating part in decimal places in brackets. For...

Concepts Used Strings, Sliding Window Algorithm using two pointers Difficulty Level Medium Problem Statement (Simplified): Print the number of substrings containing all three characters i.e. a,b,c at least once in...

Concepts Used Strings, Hashing Difficulty Level Hard Problem Statement (Simplified): Find the minimum size of the substring of string S which contains all the character from a given string T....

Concepts Used Strings Difficulty Level Medium Problem Statement (Simplified): Given two string S and T containing only - and +. Two - together can form a single +. If it...

Concepts Used Strings, Hashing Difficulty Level Medium Problem Statement (Simplified): For given two string, Print minimum number of steps to make them anagram. See original problem statement here Test Case...