Update appNew update is available. Click here to update.
Last updated: Aug 2, 2022

Strings

Strings is one of the commonly used data types in all programs. It is technically defined as an array of characters which are enclosed within quotes in most of the languages. In some languages, it's a primitive data-type, and in others, it's defined as a complex data-type.
Check If a String is a Palindrome or Not MEDIUM
This article will discuss the problem to check if a string is a palindrome, and we will discuss solutions to this problem in 3 different ways along with their complexities.
Rabin-Karp Algorithm EASY
In this article, we will discuss the Rabin-Karp Algorithm for finding a given pattern in a given string, its Java, Python & C++ implementation, and its time and space complexities.
Author Riya
3 upvotes
Rabin-Karp Algorithm MEDIUM
Rabin-Karp Algorithm is used to find the occurrence of a pattern in a text using a hash function.
String Hashing
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.
Manacher's Algorithm
In this blog, we will discuss the widely used manacher's Algorithm, which is used primarily for finding palindrome substrings for a given string; we will also learn about the trivial Algorithm, further, our concern is to determine the time complexity and implementation of the manacher's Algorithm which we will learn in the last part of our blog.
Subsequence Vs Substring EASY
This article attempts to give an overview of Subsequence Vs Substring and their basic concepts with the help of the implementation code in Java.
Count and Toggle Queries on Binary Array MEDIUM
In this article, we will learn about Count and Toggle queries on Binary array. We will also learn about its applications and code the program for the same.
Shortest Palindrome
The blog helps us understand how the KMP and z function works
Find All Occurrences of the Pattern in the String
In this article, we will discuss the approach to finding all the occurrences of the given pattern in the given string. We will also focus on the complexity of our approach.
Car Fleet MEDIUM
This article discusses the car fleet problem and how to implement it with two different approaches.
Count Palindromes EASY
In this article, we will discuss the problem of power palindrome.
Count of Longest Palindromic Substrings
This article discusses the methods to find the count of the longest palindromic substrings of a string.
Run Length Encoding (RLE) EASY
Run-length encoding (RLE) is a very basic type of data compression in which an inputs stream of data (such as "PPPRRRSSSSSSS") is provided
Repeated Substring Pattern
The blog aims to find if we can construct a given string by making multiple copies of any of its substrings.
Rearrange a Binary String as Alternate X and Y Occurrences EASY
In this article, we will discuss how to rearrange a binary string as alternate x and y occurrences along with its complexity.
Minimum Repetitions of String A, to Generate String B as its Substring
Minimum number of repetitions of string A to generate a string that has string B as its substring.
Find the longest proper prefix that is also a suffix
In this article, we will discuss the approach to finding the longest proper prefix that is also a suffix for a given string. We will also focus on the complexity of our solution.
Count Valleys EASY
In this blog, we'll define and solve a fascinating string problem, Count Valleys.
How To Convert Array To String In Any Programming Languages? EASY
This article will guide you that how to convert a array to string in any programming languages i.e. in C++, Java, Python, PHP, and C#.
Convert Given Array of Strings to a Camel Case Format Sentence EASY
In this blog, we will discuss an application-based DSA question, i.e., convert given array of strings to a camel case format sentence
Finding the Longest Palindromic Substring using Manacher’s Algorithm MEDIUM
This article will discuss Manacher's algorithm, used to find the longest palindromic substring. We will discuss its algorithm, implementation, and its complexities.