yashbansal231 Goto Github PK

bfs

You have been given a Tree consisting of N nodes. A tree is a fully-connected graph consisting of N nodes and N-1 edges. The nodes in this tree are indexed from 1 to N. Consider node indexed 1 to be the root node of this tree. The root node lies at level one in the tree. You shall be given the tree and a single integer x . You need to find out the number of nodes lying on level x.

breadth-first-search

You have been given a Tree consisting of N nodes. A tree is a fully-connected graph consisting of N nodes and N-1 edges. The nodes in this tree are indexed from 1 to N. Consider node indexed 1 to be the root node of this tree. The root node lies at level one in the tree. You shall be given the tree and a single integer x . You need to find out the number of nodes lying on level x.

coursera

These are my learning exercices from Coursera

deep-learning-coursera

Deep Learning Specialization by Andrew Ng on Coursera.

dfs

You have been given a graph consisting of N nodes and M edges. The nodes in this graph are enumerated from 1 to N . The graph can consist of self-loops as well as multiple edges. This graph consists of a special node called the head node. You need to consider this and the entry point of this graph. You need to find and print the number of nodes that are unreachable from this head node.

github_kritika

image-gallary

imdb-reminder

imdb-status-update

maze

merge-sort

programming ques

minimum-spanning-tree

nodejs-weather

Weather api created using nodejs and express to fetch whethre update when provided with the address.

open-event-frontend

The front end for the Open Event API Server https://nextgen.eventyay.com

programming-ques

competitive programs in c++

stacks

Code for questions related to stacks only

string-algos

trees

trie