Basic String Problems

Due to the various string manipulation methods available in modern programming languages, we can find the length of a string, search for a specific character in the string, reverse it and do much more. Such tasks come under the category of Basic String Problems. These problems help in building the foundation of a good programmer.

String Hashing

By Shubham Agarwal

● Published At Oct 2021

In this blog, we will discuss Hashing in the Introduction; then we will discuss String Hashing, then we will discuss how to calculate the Hash for the given String then we will discuss various applications on it.
... Keep reading ..

Maximize the Confusion of an Exam

By Husen Kagdi

● Published At Feb 2022

In this blog, we will discuss an exciting problem, namely “Maximize the confusion of an Exam”. It is an ad-hoc problem. ... Keep reading ..

Lexicographically largest String after removal of K characters

By Sandeep kamila

● Published At Nov 2021

This article covers the approach to the problem lexicographically largest string after removing k characters and its implementation in C++.... Keep reading ..

Find All Words in the Given Sentence that are Lexicographically Increasing and Lexicographically Decreasing

By Saksham Gupta

● Published At Feb 2022

This blog will discuss how we can solve the problem find all words in the given sentence that are lexicographically increasing and lexicographically decreasing.
... Keep reading ..

Check if a Substring Exists, having Only Two Distinct Characters with The Frequency of One as Twice The Others

By Anant Dhakad

● Published At Dec 2021

Arrays and String are widely asked topics in coding interviews. This article will look at a problem involving arrays and strings.... Keep reading ..

Count of Increasing Substrings in given String

By Soumya Agrawal

● Published At Jan 2022

This blog will cover the problem of counting the number of increasing substrings in a string.
... Keep reading ..

Minimizing the count of a subsequence of a given binary string such that any subsequence doesn’t contain adjacent zeroes or ones

By Vaibhav Agarwal

● Published At Jan 2022

This article will discuss the problem of finding the minimum number of subsequences of a given binary string such that any subsequence doesn’t contain adjacent zeroes or ones.... Keep reading ..

Count of all substrings in a binary string in which count of 1’s is strictly more than the count of 0’s

By Vaibhav Agarwal

● Published At Dec 2021

In this article, we will discuss the problem of counting all substrings in which the count of 1’s is more than the count of 0’s of a given binary string.
... Keep reading ..

Find the longest substring in a binary string with an equal count of 0s and 1s

By Gaurish Anand

● Published At Feb 2022

In this article, we will learn to find the longest substring in a string containing only 0s and 1s with an equal count of 0s and 1s.... Keep reading ..

Check if Count of 1s can be Made Greater in a Binary string by Changing 0s Adjacent to 1s

By Aman kumar Chourasiya

● Published At Jan 2022

In this blog, we will discuss a coding challenge that involves the use of sorting and greedy algorithms. Greedy algorithms are well known for their simplicity and ease to understand.... Keep reading ..

Find the Length of Smallest Non-Prime Subsequence in a Numeric String

By GAZAL ARORA

● Published At Mar 2022

In this article, we will solve a programming problem where we need to design an algorithm to find the length of the smallest non-prime subsequence in a given numeric string.
... Keep reading ..

The largest prime number possible from a subsequence of a binary string

By Shreya Deep

● Published At Jan 2022

This article discusses the solution to the problem of finding the largest prime number possible from a subsequence of a binary string... Keep reading ..

Compute the Count of K Length Subarrays Containing Only 1s in Binary String

By Soumya Agrawal

● Published At Mar 2022

This article will give you an overview of the implementation of subarrays related problems through Computing the Count of K Length Subarrays Containing Only 1’s in Given Binary String.... Keep reading ..

Find the Kth lexicographically smallest string with unique products for all the substrings

By Gaurish Anand

● Published At Feb 2022

In this article, we will learn to find the Kth lexicographically smallest string of integers of length N such that each substring's products should be unique.... Keep reading ..

Compare Version Numbers

By Pranav Gautam

● Published At Nov 2021

String linear traversal to compare two version numbers given as strings.... Keep reading ..

Count and Say

By Firdausia Fatima

● Published At Dec 2021

In this blog, we will discuss recursive and iterative solutions to the problem Count and Say.... Keep reading ..

Maximize the Confusion of an Exam

By Husen Kagdi

● Published At Dec 2021

In this blog, we will discuss an exciting problem, namely “Maximize the confusion of an Exam”. It is an ad-hoc problem. ... Keep reading ..

The Longest Word in a Dictionary

By Soumya Agrawal

● Published At Jan 2022

This article will cover the approach and the implementation of the problem longest word in a dictionary.... Keep reading ..