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
C++ Articles
Page 429 of 597
Lexicographically smallest Palindromic Path in a Binary Tree
Binary trees are fundamental data structures in computer science, providing an efficient way to organize data hierarchically. When traversing these trees, we often uncover intriguing computational problems. Among these, identifying the lexicographically smallest palindromic path is a fascinating challenge. This article elucidates an effective C++ algorithm to solve this problem and provides a detailed example for better understanding. Problem Statement In a binary tree where each node represents a lowercase English letter, our objective is to discover the lexicographically smallest palindromic path. If several paths qualify, we can return any of them. If no palindromic path exists, we should return ...
Read MoreExtract URLs present in a given string
In the information age, it's common to encounter strings of text that contain URLs. As part of data cleaning or web scraping tasks, we often need to extract these URLs for further processing. In this article, we'll explore how to do this using C++, a high-performance language that offers fine-grained control over system resources. Understanding URLs A URL (Uniform Resource Locator) is a reference to a web resource that specifies its location on a computer network and a mechanism for retrieving it. In layman's terms, a URL is a web address. Problem Statement Given a string that contains several URLs, ...
Read MoreClassify strings from an array using Custom Hash Function
In this article, we will delve into an interesting problem involving strings, hashing, and classification in C++. The problem statement is "Classify strings from an array using a custom hash function". This problem offers a great opportunity to learn about custom hash functions, their uses, and their applications in data classification and string manipulation. Problem Statement Given an array of strings, the task is to classify the strings into different categories using a custom hash function. Custom Hash Function A hash function is a function that is used to map data of arbitrary size to a fixed size. In our ...
Read MoreMaximize partitions in a given Binary String having the same ratio of 0s and 1s
A binary string is a string that contains only zeros and ones as the different types of characters. We have given a binary string and the task is to divide it into some number of partitions (possibly zero) where each partition contains an equal ratio of zero and one. We will use the hashmap to solve the problem with efficient time and space complexity. Sample Examples Input 1: string str = 100010001 Output: 3 Explanation The given string can be partitioned into three substrings that will contain the same ratio of zeros and ones. We can break the string into ...
Read MoreMaximum Occurring Character in a Linked List
We have given a singly linked list of characters, and our task is to print the character which occurs the maximum time in the linked list. If the multiple characters have the same count of occurring then print the character which comes in the last. The Singly-linked list is a linear data structure that consists of nodes. Each node contains the data and the pointer to the next node which contains the memory address of the next node because the memory assigned to each node is not continuous. Sample Examples Let us assume we have given a linked list of ...
Read MoreCheck if the summation of two words is equal to the target word
We will be given three strings str1, str2, and str3 in this problem of the same or different lengths and we have to find whether the sum of the first two strings is equal to the third or not. Each of the strings contains elements less than ‘k’ which means ‘a’ can be decoded as ‘0’ and j as ‘9’ and we can take the sum of them as the normal numbers. Sample Examples Input 1 string str1 = “abc” string str2 = “bbe” string str3 = “cdg” Output: Yes Explanation − We can decode ‘a’ as ‘0’, ‘b’ as ...
Read MoreLexicographically smallest string formed repeatedly deleting a character from substring ‘10’
Lexicographically smallest string means among the set of strings is the string which appears first in the dictionary order is known as a lexicographically smallest string. We will be given a binary string (that contains only two different types of characters 0 and 1) and we can delete character ‘1’ from any substring ‘10’ from the given string at any number or time. We have to create the lexicographic string by applying this method. Sample Examples Input 1 string str = “1101010011” Output: 000011 Explanation − As we can only remove the character ‘1’ so will remove all the ones ...
Read MoreMaximum Pairs of Bracket Sequences which can be concatenated to form a Regular Bracket Sequence
Regular Bracket Sequence means a string that contains the parentheses of both opening and closing types and results in properly closed brackets. The given sequence may be properly symmetrical and maybe not. In this problem, we are given a list of string that contains the bracket sequences and we have to find the number of pairs that can be concatenated to a single regular bracket sequence. Sample Examples Input 1 string arr[] = {“)()”, “()(“, “()()”, “(())”} Output: 2 Explanation − For the first and second strings we can concatenate the first string after the second string resulting in the ...
Read MoreMaximum count of 0s between two 1s in the given range for Q queries
A binary string is a string that only contains the zeroes and ones as the different characters in them. We are given a binary string and an array of a given length that will contain the pairs. Each pair defines the range, and in that range, we have to return the maximum number of zeros lying between two ones. We will implement two approaches one is the naive approach and another is the efficient approach. Let’s understand with the help of example Input String str = ‘1011010110’ Array Q[][] = {{0, 2}, {2, 5}, {0, 9}} Output: 1 1 3 ...
Read MoreMinimum cost for constructing the subsequence of length K from given string S
We will be given a string of length n, an integer k, and an integer array of length 26. The integer array defines the cost of each lowercase character and the string will contain only lowercase letters. We have to create a subsequence of length k from the given string at the minimum possible cost. We will use sorting to solve the problem and will implement a code with a full explanation. Sample Examples Input 1 Given string: acbcbac Given number: 4 Given array: {2, 3, 1, 2, 4, 5, 5, 6, 6, 2, 1, 0, 4, 3, 5, ...
Read More