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
C++ Articles
Page 65 of 597
Sort an array of strings in ascending order with each string sorted in descending order
In this article, we dive into a unique and interesting problem related to arrays and string manipulation in various programming languaues. The problem at hand is "Sort an array of strings in ascending order with each string sorted in descending order". This problem is an excellent way to enhance your knowledge of string manipulation, arrays, and sorting algorithms. Problem Statement Given an array of strings, the task is to sort the array in ascending order, but with each string sorted in descending order. Solution Approach We can solve this problem by using the sort function provided by the C++ Standard ...
Read MoreSmallest string divisible by two given Strings
The objective of this article is to determine the smallest string that is a multiple of both given strings. An interesting observation to note is that for two given strings s and t, the string s is a multiple of t if and only if s can be formed by repeating t one or more times. We have to find the smallest such string. Problem Statement Given two non-empty strings, s1 and s2, with lengths n and m respectively, the objective is to determine the smallest string that is a multiple of both s1 and s2. A ...
Read MoreSet the Leftmost Unset Bit
This article seeks a method for setting a given number's leftmost unset bit. The first unset bit after the most significant set bit is considered the leftmost unset bit. Problem Statement Given a number n, the task is to set the left most bit of the binary expansion of the number that is unset. All the other bits should be left unchanged. If all the bits of the original number are already set, return the number. Examples Input: 46 Output: 62 Explanation Binary Expansion of 46 = 101110. Left most unset bit is 101110. Upon setting the underlined ...
Read MoreRemove all occurrences of a word from a given string using Z-algorithm
This article delves into an interesting string manipulation problem: "Remove all occurrences of a word from a given string using Z-algorithm". This problem serves as an excellent use case for the Z-algorithm, highlighting its efficacy in pattern searching problems. Let's explore in detail. Problem Statement Given a string S and a word W, the task is to remove all occurrences of W from S using the Z-algorithm. Understanding the Problem Consider a string S = "HelloWorldHelloWorld" and a word W = "World". The goal is to remove all occurrences of W from S. Hence, the output would be "HelloHello". Z-algorithm ...
Read MoreRearrange a string to maximize the minimum distance between any pair of vowels
In this article, we are going to unravel an interesting problem from the domain of string manipulation: "Rearrange a string to maximize the minimum distance between any pair of vowels". This problem challenges us to manipulate the arrangement of characters in a string to ensure the maximum possible minimum distance between any two vowel characters. We'll discuss the problem in detail, providing the various programs. Understanding the Problem Statement Given a string, the task is to rearrange the characters in the string in such a way that the minimum distance between any pair of vowels is maximized. In other words, ...
Read MorePrint Words with Prime length from a Sentence
In this problem, we need to show all words of the string having the prime length. The logical part of the problem is getting the words from the string and checking whether its length is prime. We can check whether the length of the number is divisible by any number to ensure whether it is a prime number. Also, we will use the sieve of Eratosthenes and the wheel factorization algorithm to check whether the word length is a prime number. Problem statement − We have given a string alpha, and we need to print all words of ...
Read MorePrint a sorted list of words represented by the expression under the given grammar
In this article, we will be exploring an interesting problem related to expressions and grammar. The problem statement is "Print a sorted list of words represented by the expression under the given grammar". This problem offers a great opportunity to brush up your knowledge on parsing expressions, handling strings, and sorting algorithms. Problem Statement Given a string expression where each character represents a lowercase English letter and the '|' character represents an OR operation, the task is to print a sorted list of all possible words represented by the expression. Solution Approach Our approach to solve this problem is by ...
Read MorePermutation of a number whose sum with the original number is equal to another given number
In this article, we'll delve into a fascinating problem that involves numbers and permutations: "Permutation of a number whose sum with the original number is equal to another given number". This problem offers a unique intersection of number theory and combinatorics, making it a compelling challenge to tackle. To clarify, given an original number and a target number, we need to find a permutation of the original number such that, when we add the original number and its permutation, we get the target number. Understanding the Problem In essence, this problem combines the concepts of number permutation, summation, and equality ...
Read MoreMove all digits to the beginning of a given string
In this article, we will explore a common string manipulation problem: moving all digits to the beginning of a given string. This task is often seen in data cleaning or preprocessing, where we need to standardize or reformat strings in a certain way. A widely-used programming language celebrated for its efficiency and control. Problem Statement Given a string that contains alphanumeric characters, our task is to move all the digits present in the string to the beginning, while keeping the order of the rest of the characters the same. Solution Approach Our approach to solving this problem involves two key ...
Read MoreModify string by increasing each character by its distance from the end of the word
When working with strings, sometimes we need to modify them in specific ways to meet certain requirements. One such requirement is to modify a string by increasing each character by its distance from the end of the word. In this article, we will discuss an approach to solving this problem. Problem Statement Given a string S, modify the string by increasing each character by its distance from the end of the word. Approach To solve this problem, we can follow the following steps − Tokenize the given string S into individual words. Iterate over each word and for each ...
Read More