- 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 34494 Articles for Programming
77 Views
In this problem, we need to find the maximum difference between the indices of the subsequence present in the given string. To solve the problem, we need to find the indices of the subsequence in the actual and reverse order. After that, we need to take the difference of both. Problem statement - We have given two strings named 'str' and 'sub'. The 'sub' string is always present in the 'str' string as a subsequence. We need to find the maximum index cost. The index cost is the difference between two indices of the subsequence. ... Read More
61 Views
In this problem, we need to remove the maximum characters from the string if the adjacent character is the previous character. We can find the occurrence of each character and check whether any of its adjacent characters is a previous character, we can remove the particular character. Problem statement - We have given a string containing the N alphabetic characters. The given task is we need to remove the maximum number of characters, and we can remove any character of the string if any adjacent character is the previous character in the alphabet. At last, print the count ... Read More
76 Views
In this problem, we will find the suffix array of the given string. We can sort all the string's suffixes using their first character, as the input string contains different characters. Problem statement - We have given a string containing the different alphabetical characters, and we need to find the suffix array of the given string. The suffix array of the string is a sorted array containing all suffixes of the given string. Sample examples Input str = "point"; Output 2 3 1 0 4 Explanation All suffixes of the string ... Read More
82 Views
In this problem, we need to count digits frequencies after merging the ASCII values of all characters. The approach to solving the problem is to create a string containing each character's ASCII values and count the frequency of the digits in the string. Problem statement - We have a string alpha containing different characters, and the length of the string is N. We need to calculate each digit's frequency after concatenating the ASCII values of the given string's characters. Sample examples Input alpha = "tutorialspoint" Output 4 25 1 0 1 3 3 2 1 1 ... Read More
67 Views
In this problem, we need to prepare a set of unique substrings of the given binary string and remove them from the set if it contains an even number of 1s and its reverse also exits in the set. We can solve the problem using two ways. The first way is to find all substrings of the given binary string, check if any substring contains an even number of 1's and its reverse exits, and remove the reverse string from the set. Another way is by comparing the total number of parity bits in the given string. ... Read More
40 Views
In this problem, we need to encode the string in xAyB format, where x is the count of digits present in both strings at the same index, and y is the count of digits in both strings at different indices. We can solve the problem by counting the same digits in both strings. Also, we can count the total number of the same digits present at same index in both strings to encode the string. Problem statement - We have given str1 and str2 strings of the same length containing only digits. We need to encode the given ... Read More
145 Views
In this problem, we need to calculate the distance between the character and 'a', and by adding it to the character, we need to shift the character. The solution approach is to find the difference between the ASCII values of both characters, and add it to the current character's ASCII value. Problem statement - We have given an alpha string of length N containing only alphabetical characters. We need to encode the string according to the below conditions. Take a distance between the current character and 'a'. ... Read More
67 Views
Introduction In C language, finding the most extreme briefest separate in each component of a chart may be a vital assignment. The chart is spoken to utilizing a contiguousness list or lattice. By utilizing Breadth-First Search (BFS) or Depth-First Look (DFS), we will compute the most limited separations from each hub to all other hubs inside a component. To get the most extreme most brief separate in each component, we emphasize through the components and keep up a running most extreme. At last, we yield the comes about for each component. This productive calculation permits us to analyze complex systems, ... Read More
149 Views
Introduction Undirected graphs are an essential component of computer science and graph theory, representing a set of vertices connected by edges without any directionality. One common problem associated with undirected graphs is the counting the number of nodes in a graph whose sum of neighbours is at most K. In computer science, the graph theory field will deal with the connection between the elements in the given matrix. Usually the graphs consists of the elements namely the edges and the nodes. Count the number of nodes in a Graph The Graph that is exclusively used is the undirected graph in ... Read More
257 Views
Introduction Dijkstra's algorithm could be a broadly utilized graph traversal algorithm that finds the shortest way between two vertices in a graph. It is effective and ensures ideal comes about when connected to graphs with non-negative weights. In any case, when negative weights are presented, Dijkstra's algorithm comes up short to produce rectify comes about. In this article, we'll investigate the reasons behind this disappointment and discuss three distinctive approaches to handling negative weights in graphs using C language. We'll give a step-by-step clarification of each approach, in conjunction with the comparing code and outputs. Understanding Dijkstra's Algorithm Dijkstra's algorithm ... Read More