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
Articles by Sonal Meenu Singh
Page 2 of 5
How to Decode the string encoded with the given algorithm?
Introduction Encoding means converting the text into some form of representation, and decoding is the process of converting the encoded text into its original form. Encoding and decoding are two interrelated techniques for transferring information from one form to another. In this tutorial, we implement an approach to decode the string which is encoded with the given algorithm that finds the decoded string using an encoded string encoded with some algorithm. The string is encoded using the following concept − For example string = India Encoded string = dniIa In the string "India", the middle character is 'd', ...
Read MoreHow to decrypt a string according to given algorithm?
Decryption or decrypt a string is the process used to protect confidential and sensitive data from hackers. It converts encrypted data or text into its original form. Encryption is the process of converting plain text into an unreadable and non-understandable cipher text format so that hackers cannot understand it. These processes are interrelated and involve various algorithms for processing. We decrypt the string according to the following algorithm. If the string length is odd. For odd index values append alphabets from the back of the string and for even index values append alphabets from the front of the input ...
Read MoreCount of all substrings with sum of weights at most K
Introduction In this tutorial, we discuss the problem of counting the substrings from a given string with the sum of weights at most K. To implement the problem statement we consider a string S to generate substrings and some value for k. The character weights are predefined integer values and we consider some value of K like 2, 3 or anything. We count only those substrings whose total weight is equal to the value of K. The weights of the characters are defined in two different ways − When the weights are defined for a string in any order. ...
Read MoreCheck whether the string can be printed using same row of qwerty keypad
Introduction In this tutorial, we will check if an input string can be formed using characters in the same row of the Qwerty keypad. The task is to check whether a given string exists in a single row of the Qwerty keypad. To determine whether a string can be printed with the same row of the Qwerty keypad, all characters should be found in the same row. We implement an approach using set and unordered_set to solve this task. The characters of different rows are stored in different sets or unordered_sets. Compare the string characters to each stored row value. ...
Read MoreCheck if a substring can be Palindromic by replacing K characters for Q queries
Introduction In this tutorial, we implement an approach to check substring is palindrome by replacing its K characters for Q queries. Palindromes are words that read the same in both directions. When you read a palindromic word from a forward or backward direction, it sounds the same. For example, madam, refer. Here, Q queries are a numeric array containing the starting index, ending index, and value of K. The starting and ending index values for the input string are used to select only those characters that lie between these starting and ending index values (both values are inclusive). For the ...
Read MoreLargest Component Size in a Graph Formed by Connecting Non-Co-Prime Nodes
Introduction In this tutorial, we discuss the problem of finding the largest component size in a graph generated by connecting non-co-prime nodes through C++. Graphs are formed by nodes connected by edges. The components of the graph are a subset of values that form nodes. There is an array a[] which forms graph G. The components of the graph are a subset of values that form nodes. The non-coprime numbers are the numbers that have a HCF (Highest Common Factor) other than 1, that means they have some other common factors. We solve the problem statement in this tutorial using ...
Read MoreReverse alternate k characters in a string
Introduction In this tutorial, we implement examples using C++ programming logic to reverse the alternate k characters in an input string. We define the value of k to reverse the characters in a given string. K is the number of characters to be reversed. The value of k can be anything. If the value of k is more than the total number of characters in the string we do not reverse any of the string characters. Demonstration 1 String = “tutorialspoint” K = 4 Output otutrialiopsnt In the above demonstration, we consider a string “tutorialspoint” to ...
Read MoreRange Queries to find the Element having Maximum Digit Sum
Introduction In this tutorial, we discuss the problem of range queries to find the element having Maximum Digit Sum in C++. To solve the problem, take an array of elements and some queries. The queries denote the indices of the array and using those queries find the array element with the maximum digit sum. Maximum digit sum is the highest sum of two digit numbers (addition of ones and tens place digits) or one digit number. For example: 12, its sum is 3 (1 + 2). In this tutorial, by using the queries find such a number that has a ...
Read MoreQueries for the Count of Even Digit Sum Elements in the given Range using Segment Tree
Introduction In this tutorial, we implement an approach in C++ to resolve queries for the count of even digit sum elements in the given range. We use a segment tree. To solve this task, we consider an array of elements with queries defining the range of the subarray. In that subarray count the even digit sum elements. Predefine the element array and the queries to resolve the problem using the Segment tree. What is a segment tree? A segment tree is a binary data structure that stores array interval or segment information. It efficiently solves range or segment query problems. ...
Read MorePrint Strings In Reverse Dictionary Order Using Trie
Introduction This tutorial implements an approach to printing Strings In Reverse Dictionary Order Using Trie. Trie is a data structure with a tree representation. It is in ordered form and provides an efficient approach for string retrieval. It has nodes and edges like a tree data structure. To solve the task, initialize an array and arrange strings in reverse dictionary order using the trie. Each alphabet is used as a node in the tree. Duplicate array elements are printed only once. Demonstration 1 arr[] = {“hello", "world", "open", "ai", "c++", "programming"”} Output world programming open hello c++ ai ...
Read More