Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Java Articles
Page 222 of 450
Count M-length substrings occurring exactly K times in a string
In this article, we will be delving into a unique and fascinating problem from the realm of computer science - "Counting M-Length Substrings Occurring Exactly K Times in a String". This type of problem is often encountered during programming competitions and interviews. Before we get started, let's define what we're dealing with − Substrin − A continuous sequence that is found within another string. M-Length − The length of the substring that we're interested in. K Times − The exact number of times the substring should appear in the original string. Algorithm Explanation To solve this problem, we will leverage the ...
Read MoreCount even indices of String whose prefix has prime number of distinct Characters
In this problem, we will find total invalid characters in the given string. If total distinct characters till the particular even index is prime, we can say the character is invalid. We can use the map data structure to count the total number of distinct characters while traversing the string. Also, we can use the string of characters to keep track of the distinct digits. Also, for every character, we can check whether its index is even and whether distinct characters are prime. Problem statement – We have given a string alpha containing the N characters. We need to find ...
Read MoreCount distinct regular bracket sequences which are not N periodic
In this article, we're going to delve into an intriguing problem from the realm of combinatorics and string processing: "Counting distinct regular bracket sequences which are not N periodic". This problem involves generating distinct valid bracket sequences and then filtering out sequences that are N-periodic. We'll discuss the problem, provide a C++ code implementation of a brute-force approach, and explain a test case. Understanding the Problem Statement Given an integer N, the task is to count the distinct regular bracket sequences of length 2N which are not N-periodic. A sequence is N-periodic if it can be represented as a string ...
Read MoreCount anagrams having first character as a consonant and no pair of consonants or vowels placed adjacently
Anagrams are a fascinating concept in computer science and language processing. They are essentially words or phrases made by rearranging the letters of another word or phrase. The challenge increases when we introduce specific rules. Today, we'll delve into a unique problem - counting anagrams that start with a consonant and have no adjacent consonants or vowels. We'll use C++ to develop a solution and walk through an illustrative example. Algorithm Explanation Our task is to count anagrams under two constraints − The first character must be a consonant. There should be no adjacent consonants or vowels. To ...
Read MoreCheck if a sequence of path visits any coordinate twice or not
In certain applications, we might be interested in checking whether a sequence of path visits any coordinate twice or not. This can be useful, for example, in GPS tracking systems to detect if a vehicle is going back and forth between two points. In this article, we will discuss how to check if a sequence of path visits any coordinate twice or not, along with its implementation in C++. Algorithm To solve this problem, we can use a hash table to keep track of all the coordinates that we have visited so far. We start by visiting the first coordinate ...
Read MoreCheck if two binary strings can be made equal by swapping 1s occurring before 0s
In this article, we will be discussing an intriguing problem related to string manipulation and binary numbers in C++. The problem we will be tackling is "Check if two binary strings can be made equal by swapping 1s occurring before 0s". This problem is a great way to enhance your understanding of strings, binary numbers, and algorithmic thinking. Problem Statement The task is to determine if two binary strings can be made equal by swapping 1s that occur before 0s in the strings. C++ Solution Approach The approach to solve this problem is to keep track of the number of ...
Read MoreCheck if substrings from three given strings can be concatenated to form a palindrome
Palindromes are a fascinating topic in computer science and programming. A palindrome is a word, phrase, number, or other sequences of characters that read the same forward and backward, ignoring spaces, punctuation, and capitalization. In this article, we will investigate a unique problem: how to determine if substrings from three given strings can be concatenated to form a palindrome. This problem is a common interview question and can be solved using various techniques, including string manipulation, hashing, and dynamic programming. Problem Statement Given three strings, the task is to check if it's possible to select substrings from each of the ...
Read MoreCheck if String can be divided into two Subsequences so that product of sum is odd
In this problem, we will check if it is possible to divide the given numeric string into two disjoint subsequences such that sum(sub1) * sum(sub2) becomes odd. We need to divide the string into two subsequences such that the sum of the digits of both becomes odd to get the odd multiplication result. Problem statement − We have given a string num_string containing the numeric characters. We need to check whether we can divide the string into two subsequences such that the multiplication of the sum of both subsequences becomes odd. Also, it is given that every character of the ...
Read MoreCheck if given number contains only “01” and “10” as substring in its binary representation
In this article, we delve into an interesting problem from the world of binary string manipulation: "Check if a given number contains only '01' and '10' as substrings in its binary representation". This problem challenges us to verify whether a number's binary representation contains only the substrings '01' and '10'. We'll discuss the problem in detail, offer a C++ code implementation, and illustrate the concept with an example. Understanding the Problem Statement Given a number, the task is to check if its binary representation contains only '01' and '10' as substrings. In other words, we need to verify if the ...
Read MoreCheck if characters of each word can be rearranged to form an Arithmetic Progression (AP)
In this article, we will discuss how to check if the characters of each word in a given string can be rearranged to form an Arithmetic Progression (AP). We will also implement the solution in C++ and provide an example to illustrate the working of the code. Arithmetic Progression (AP) An Arithmetic Progression (AP) is a sequence of numbers in which each term after the first is obtained by adding a constant d to the preceding term. The constant d is called the common difference. For example, the sequence 1, 3, 5, 7, 9 is an Arithmetic Progression with common ...
Read More