Get free ebooK with 50 must do coding Question for Product Based Companies solved
Fill the details & get ebook over email
Thank You!
We have sent the Ebook on 50 Must Do Coding Questions for Product Based Companies Solved over your email. All the best!

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

## Convert Integer number to Roman Number

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

## Tina loves A

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

## Minimum Number of Operations to Make String Palindrome

Palindrome string is a string which is the same on reading from the front side as well as on the rear side. Example of a palindrome string is “NAMAN” as...

## Find the missing number in sequence given as string

In the realm of problem-solving and data manipulation, uncovering the missing element in a sequence embedded within a string can be a perplexing yet intriguing task. This article delves into...

## FRACTION

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

## Number of Substrings Containing All Three Characters

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

## Minimum Window Substring

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

## Minus Minus is Plus

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

## Minimum Number of Steps to Make Two Strings Anagram

In the realm of string manipulation, anagrams hold a significant place due to their intriguing nature. An anagram is formed by rearranging the letters of one word or phrase to...

## Form the Largest Number

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

## Longest Palindromic Substring

A palindrome is a sequence of characters that reads the same forwards and backward. Finding the longest palindromic substring is a common problem in computer science and has applications in...

## First character

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

## Distint Concat

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

## Code Characters

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

## Branches of Bytecode

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

## Aman and Math

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