- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Found 1862 Articles for Data Structure
![Shubham Vora](https://www.tutorialspoint.com/assets/profiles/485898/profile/60_1456867-1657516792.jpeg)
196 Views
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
![Shubham Vora](https://www.tutorialspoint.com/assets/profiles/485898/profile/60_1456867-1657516792.jpeg)
71 Views
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
![Shubham Vora](https://www.tutorialspoint.com/assets/profiles/485898/profile/60_1456867-1657516792.jpeg)
130 Views
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
![Shubham Vora](https://www.tutorialspoint.com/assets/profiles/485898/profile/60_1456867-1657516792.jpeg)
82 Views
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
![Shubham Vora](https://www.tutorialspoint.com/assets/profiles/485898/profile/60_1456867-1657516792.jpeg)
61 Views
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
![Shubham Vora](https://www.tutorialspoint.com/assets/profiles/485898/profile/60_1456867-1657516792.jpeg)
51 Views
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
![Shubham Vora](https://www.tutorialspoint.com/assets/profiles/485898/profile/60_1456867-1657516792.jpeg)
141 Views
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
![Pranavnath](https://www.tutorialspoint.com/assets/profiles/629838/profile/60_1502721-1680003383.jpg)
129 Views
Introduction This C program calculates the most limited separation between two given hubs in a bidirectional weighted chart by evacuating any K edges. It utilizes an altered form of Dijkstra's calculation, considering the expulsion of K edges as a limitation. The program utilizes a need line for effective hub determination, and powerfully alters the edge weights based on the expulsion imperative. By navigating the chart and finding the briefest way, it gives the least remove between the given hubs whereas bookkeeping for the expulsion of K edges. Approach 1: Modified Dijkstra's Algorithm Algorithm Step 1: Create a structure ... Read More
![Pranavnath](https://www.tutorialspoint.com/assets/profiles/629838/profile/60_1502721-1680003383.jpg)
3K+ Views
Introduction Graph theory allows us to study and visualize relationships between objects or entities. In the current technology of computer science, graph traversal plays a crucial role in exploring and analyzing different types of data structures. One of the crucial operations performed on graphs is traversal - visiting all vertices or nodes, following specific paths. DFS traversal, based on a depth-first approach, allows us to explore the depths of a graph before backtracking and exploring other branches. In this article, we will involve in implementing DFS traversal using an adjacency matrix representation in C. DFS traversal using Adjacency Matrix ... Read More
![Pranavnath](https://www.tutorialspoint.com/assets/profiles/629838/profile/60_1502721-1680003383.jpg)
84 Views
Introduction Binary matrices are widely used in computer science and various fields to represent data or solve complex problems efficiently. In some cases, it becomes important to identify whether a given binary matrix contains continuous blocks of zeros. In this article, we will explore an elegant solution using C++ code that allows us to detect if there are T number of continuous blocks of zeroes within a given binary matrix. This approach is both intuitive and efficient, making it suitable for practical implementation. Check if there are T number of continuous of blocks of 0s or not Given ... Read More