## Zigzag String from the Character on Rows

Problem Statement (Simplified): For a given string S and number of rows R, we have to arrange each character on rows in a vertical zigzag format, and then print values...

Skip to content
## Zigzag String from the Character on Rows

## 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

## FRACTION

## Number of Substrings Containing All Three Characters

## Minimum Window Substring

## Minus Minus is Plus

## Minimum Number of Steps to Make Two Strings Anagram

## Form the Largest Number

## Longest Palindromic Substring

## First character

## Distint Concat

## Code Characters

## Branches of Bytecode

## Aman and Math

Problem Statement (Simplified): For a given string S and number of rows R, we have to arrange each character on rows in a vertical zigzag format, and then print values...

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...

Convert given string into a palindrome by decreasing or increasing characters by their ASCII value, in minimum number of operations. Each decrement or increment is considered as one opeartion. Print...

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...

Find the minimum size of the substring of string S which contains all the character from a given string T. Print the substring with minimum length. See original problem statement...

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...

Concepts Used Strings, Sorting Difficulty Level Hard Problem Statement (Simplified): Given an array of numbers, arrange them in such a way that they form the largest number on joining. See...

Concepts Used Strings Difficulty Level Medium Problem Statement (Simplified): Find the longest palindromic substring in a given string and print the substring. See original problem statement here Test Cases: Input:...

Concepts Used String, Hashing Difficulty Level Easy Problem Statement (Simplified): Find the first non-repeating character in the string, print -1 if all characters are repeating. See original problem statement here...

Concepts Used String Difficulty Level Hard Problem Statement (Simplified): Find the total number of substrings which are the concatenation of the same strings, e.g.PP if formed by concatenating P twice....

Concepts Used String Difficulty Level Easy Problem Statement (Simplified): Find the minimum length of substring, which on replacing with any other substring of the same length gives a string containing...

Concepts Used String Difficulty Level Hard Problem Statement (Simplified): For given n strings and a separator s, print n/2 number of strings of equal length, by concatenating two substrings with...

Concepts Used Strings Difficulty Level Hard Problem Statement (Simplified): Find the maximum answer by evaluating the given string and putting a bracket anywhere in the string. See original problem statement...