In this problem, we have given the email string containing the ‘dot’ and ‘at’ words. We need to replace them with ‘.’ And ‘@’ characters. Note – The valid email address should contain the ‘@’ character only once. It should contain any prefixes before the ‘@’ character and the domain name after that. Also, a valid email can contain multiple ‘.’ Characters. Furthermore, the ‘@’ and ‘.’ Characters should not be at the start or end of the email address. Problem statement – We have given a string str containing the email address, and the length of the string is equal ... Read More
In this problem, we need to count the total number of strings of the given string containing an equal number of lowercase and uppercase characters. The naïve approach to solving the problem is to find all substrings and count the total number of substrings with an equal number of lowercase and uppercase characters. The efficient approach is using the subarray sum problem. We can consider lowercase characters as -1 and uppercase characters as +1, and we will learn both approaches to solve the problem. Problem statement- We have given string str containing the lowercase and uppercase alphabetical characters. We need ... Read More
In this problem, we need to right-shift each character of a given string by its frequency. To solve the problem, we can count the frequency of each character and store it in a data structure like an array or map. After that, we can use the ASCII values of the characters to right-shift each character by their frequency. Problem statement- We have given string str containing lowercase characters and a length equal to N. We need to right-shift each character of the string by the frequency of that particular character in the given string. Sample examples Input – str = ‘tutorialspoint’ ... Read More
In this problem, we need to construct the str2 by using the subsequences of the str1. To solve the problem, we can find subsequences of the str1 so that it can cover the substring with a maximum length of str2. Here, we will learn two different approaches to solving the problem. Problem statement – We have given two strings, str1, and str2, of different lengths. We need to construct the str2 from the str1 by following the condition below. Pick any subsequence from the str1, and append it to the new string, which is empty initially. We need to return ... Read More
In this problem, we have given a string containing 0, 1, and ? characters. We need to find permutations of the string by replacing ‘?’ with 0 and 1. The logic to solve the problem is that we can replace every ‘?’ with either 0 or 1. So, by replacing one ‘?’, we can generate two different permutations, and by replacing N ‘?’ with 2 possibilities, we can generate 2^N permutations. In this tutorial, we will learn two different approaches to solving the given problem. Problem statement – We have given string str containing ‘0’, ‘1’ and ‘?’ characters. We ... Read More
In this problem, we need to select the pair of strings and swap their first character. After that, we need to count the total number of new pairs. We can solve the problem by swapping the first character of each pair and checking whether it exists in the array. The efficient approach to solve the problem can be using the hashmap data structure. Problem statement – We have given an array containing N strings. We can take any of two strings from all array elements and swap the first characters of both strings. We need to count the total ... Read More
In this problem, we have given the array of integers. We need to combine all elements in a single integer and check if it is a Harshad number. Before we move with the solution, let’s understand Harshad number. All numbers are Harshad numbers which are divisible by the sum of their digits. For example, 12 is Harshad number, as 12 is divisible by 3 = 1 + 2. To solve the problem, we can combine all array elements, and after that, we can check whether the resultant number is the Harshad number. Problem statement – We have given an array ... Read More
In this problem, we need to check if we can make all characters of strings equal by increment and decrement operations. We can get the weight of each character based on their ASCII values and check whether the total weight can be used to make all characters equal. Problem statement – We have given string str of length N containing lowercase alphabetical characters. We need to check whether we can make all characters of the string equal by choosing any of two characters, increasing one, and decreasing another by 1. If possible, print ‘yes’, else ‘no’. Sample examples Input– ... Read More
Injection molding and extrusion are two typical manufacturing procedures used to generate a wide range of products from various materials, such as plastics, metals, and even food. While both processes are classified as "forming, " they differ in their applications, methodologies, and final products. Read this article to find out more about Injection Molding and Extrusion and how they are different from each other. What is Injection Molding? Molding, sometimes called as "molding" in some areas, is a manufacturing technique that uses a mold or a die to shape raw materials into desired shapes. Heating the raw material to a ... Read More
Google's iGoogle and Google Chrome were popular products, but they served different objectives and had different functionalities. Read this article to find out more about iGoogle and Google Chrome and how they are different from each other. What is iGoogle? Google Personalized Homepage, or iGoogle, was a web portal service released by Google in May 2005. It aspired to provide customers with a configurable homepage that collected information from numerous sources, allowing it to serve as a one-stop destination for personalized content and services. The service allowed users to create a personalized dashboard out of a collection of widgets ... Read More
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP