- 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
Ayush Singh has Published 179 Articles
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
93 Views
In a graph, the most extreme number of hubs that can be reached from each hub depends on the structure and network of the chart. This value is determined by the number of active edges on each hub. In an undirected chart, each hub can reach all the hubs associated ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
90 Views
This article explains the perplexing process of finding two totally partitioned sets of vertices inside a given chart using a convoluted calculation. The substance of the calculation lies within the idea of chart colouring, wherein colours are efficiently relegated to vertices, guaranteeing that no adjoining vertices share the same colour. ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
63 Views
Finding K vertices in the network that are connected to at least one of the remaining vertices may be done using DFS (Depth-First Search). Your beginning point should be one of the remaining vertices, and you should then perform a DFS on that vertex. Each vertex you come across while ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
49 Views
To number the nodes of a tree that, when concatenated with their sub-tree hubs, shape a pangram, follow these steps: Begin at the root hub and navigate the tree in a depth-first way. At each hub, concatenate its value with the values of its sub-tree hubs. Check in case the ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
83 Views
We had to explore the tree and assess the weight of each hub in order to identify the nodes in a particular tree whose weighted string may be a palindrome. In this scenario, a hub's weight is seen as a string. The weight string is checked to see if it ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
55 Views
The assignment is to check the number of hubs in a given tree where the weight of each hub is detachable by a given number, X. To achieve this, we navigate the tree in a precise way, analysing each hub and its weight. In case the weight of a hub ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
55 Views
To check the nodes of a tree whose weighted string is a rearranged word of the given string, perform a depth-first search (DFS) on the tree. Beginning from the root, navigate each hub and calculate the weighted string by relegating a weight to each character within the node's esteem. Compare ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
41 Views
To identify the hubs of a tree in preparation for a depth-first look (DFS) traversal and whose weighted string does not include any copy characters. We travel through each hub, starting at the root hub, keeping track of the characters we've already encountered in the weighted string. We stop providing ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
28 Views
To check in the event that it is conceivable to dole out values such that all the given relations are fulfilled, we have to analyse the relations and decide on the off chance that they can be satisfied at the same time. This will be drawn closer by utilising limitation ... Read More
![Ayush Singh](https://www.tutorialspoint.com/assets/profiles/680995/profile/60_3152495-1689250670.png)
Ayush Singh
93 Views
The assignment is to recreate the initial cluster from a set of given sub-sequences. This includes finding the order in which the components showed up within the unique cluster based on the given subsequences. By analysing the designs and connections between the components within the subsequences, the calculation decides the ... Read More