COYO-IIT-BHU

Competitive programming workshop Chief mentor : SHAILENDRA UPADHYAY and SHREYASH JAIN

Name		Name	Last commit message	Last commit date
Latest commit History 256 Commits
PLACEMENT & INTERNSHIP EXAM QUESTIONS		PLACEMENT & INTERNSHIP EXAM QUESTIONS
TREES		TREES
include-bits		include-bits
placement peparation/Arrays		placement peparation/Arrays
#KNAPSACK WITH DUPLICATE ITEMS		#KNAPSACK WITH DUPLICATE ITEMS
0 - 1 Knapsack Problem		0 - 1 Knapsack Problem
0 - 1 Knapsack Problem with dp		0 - 1 Knapsack Problem with dp
APPEND NODE AT TAIL OF LL		APPEND NODE AT TAIL OF LL
ARRAY MANIPULATION		ARRAY MANIPULATION
ARRAY_BUG		ARRAY_BUG
Agitated Chandan		Agitated Chandan
Alien Dictionary		Alien Dictionary
Anti Diagonals		Anti Diagonals
Array to Balanced Binary search tree		Array to Balanced Binary search tree
BELLMEN FORD ALGORITHM IMPLEMENTATION		BELLMEN FORD ALGORITHM IMPLEMENTATION
BFS of graph		BFS of graph
BINARY SEARCH		BINARY SEARCH
BIRTHDAY PARADOX		BIRTHDAY PARADOX
BIT IMPLEMENTATION		BIT IMPLEMENTATION
CANDIES		CANDIES
CATALAN NUMBERS		CATALAN NUMBERS
CHECK FOR BALANCED BINARY TREE(0(n) solution)		CHECK FOR BALANCED BINARY TREE(0(n) solution)
CHECK FOR BST		CHECK FOR BST
CHOOSE AREA GAME		CHOOSE AREA GAME
COIN CHANGE		COIN CHANGE
COIN_CHANGE_RECURSIVE		COIN_CHANGE_RECURSIVE
CYCLE DETECTION IN UNDIRECTED GRAPH USING BFS		CYCLE DETECTION IN UNDIRECTED GRAPH USING BFS
Check for Balanced Tree(O(n*n) solution)		Check for Balanced Tree(O(n*n) solution)
Check if divisible by 4		Check if divisible by 4
Compare two Large Numbers		Compare two Large Numbers
Connected Cell in a Grid		Connected Cell in a Grid
Connected Components in a Graph		Connected Components in a Graph
Construct Tree from Inorder & Preorder		Construct Tree from Inorder & Preorder
Count all subsequences having product less than K		Count all subsequences having product less than K
Count all subsequences having product less than K(DP)		Count all subsequences having product less than K(DP)
Count characters at same position as in English alphabet		Count characters at same position as in English alphabet
Count number of substrings		Count number of substrings
Count of distinct substrings of a string using Suffix Array		Count of distinct substrings of a string using Suffix Array
Count of strings that can be formed using a, b and c under given constraints		Count of strings that can be formed using a, b and c under given constraints
Count of substrings of a binary string containing K ones		Count of substrings of a binary string containing K ones
Count sub-arrays whose product is divisible by k		Count sub-arrays whose product is divisible by k
Count type of Characters		Count type of Characters
DELETE NODE OF BST		DELETE NODE OF BST
DFS of Graph		DFS of Graph
DIAMETER OF THE BINARY TREE		DIAMETER OF THE BINARY TREE
DIAMETER OF THE BINARY TREE(OPTIMIZED APPROACH)		DIAMETER OF THE BINARY TREE(OPTIMIZED APPROACH)
DIJKSTRA ALGORITHM		DIJKSTRA ALGORITHM
DIJKSTRA ALGORITHM IMPLEMENTATION		DIJKSTRA ALGORITHM IMPLEMENTATION
Delete a node from BST		Delete a node from BST
Detect cycle in a directed graph		Detect cycle in a directed graph
Detect cycle in an undirected graph		Detect cycle in an undirected graph
Diameter of the tree		Diameter of the tree
Dice throw		Dice throw
Difference between getline and ignore		Difference between getline and ignore
Distinct Substrings		Distinct Substrings
Distorted Palindrome		Distorted Palindrome
EQUAL		EQUAL
EVEN-TREE		EVEN-TREE
Egg Dropping Puzzle		Egg Dropping Puzzle
Egg Dropping Puzzle with DP		Egg Dropping Puzzle with DP
Excel Column Number		Excel Column Number
FIRST AND LAST OCCURENCE OF A NUMBER IN SORTED ARRAY		FIRST AND LAST OCCURENCE OF A NUMBER IN SORTED ARRAY
FLIP		FLIP
FLOYD WARSHELL ALGORITHM		FLOYD WARSHELL ALGORITHM
FLOYD WARSHELL ALGORITHM(All to all shortest path)		FLOYD WARSHELL ALGORITHM(All to all shortest path)
FUNCTORS AND PRIORITY QUEUE IN STL IN CPP		FUNCTORS AND PRIORITY QUEUE IN STL IN CPP
Factorials of large numbers		Factorials of large numbers
Find Duplicate in Array		Find Duplicate in Array
Find all combinations of k-bit numbers with n bits set where 1 <= n <= k in sorted order		Find all combinations of k-bit numbers with n bits set where 1 <= n <= k in sorted order
Find k’th character of decrypted string		Find k’th character of decrypted string
Find length of the largest region in Boolean Matrix		Find length of the largest region in Boolean Matrix
Find the number of islands		Find the number of islands
FizzBuzz		FizzBuzz
Flatten the BST into sorted linkedlist		Flatten the BST into sorted linkedlist
GOLD MINE PROBLEM		GOLD MINE PROBLEM
GRAPHS(DFS and BFS) implementation		GRAPHS(DFS and BFS) implementation
GRAY CODE CODECHEF		GRAY CODE CODECHEF
Game with String		Game with String
Geek and its Colored Strings		Geek and its Colored Strings
German_lotto.cpp		German_lotto.cpp
Greatest Common Divisor		Greatest Common Divisor
HASH TABLES: RANSOME NOTES		HASH TABLES: RANSOME NOTES
Hotel Bookings Possible		Hotel Bookings Possible
INSERTION SORT		INSERTION SORT
Implement Power Function		Implement Power Function
Implementing Dijkstra \| Set 1 (Adjacency Matrix)		Implementing Dijkstra \| Set 1 (Adjacency Matrix)
Infix to Postfix		Infix to Postfix
Insert a node in a BST		Insert a node in a BST
Integer To Roman		Integer To Roman
Jump Game Array		Jump Game Array
K-Pangrams		K-Pangrams
KEY PAD DIALING		KEY PAD DIALING
KNAPSACK DP		KNAPSACK DP
KNAPSACK WITH DUPLICATE ITEMS		KNAPSACK WITH DUPLICATE ITEMS
KRUSKAL'S ALGORITHM(MINIMUM SPANNING TREE)		KRUSKAL'S ALGORITHM(MINIMUM SPANNING TREE)
Kth Row of Pascal's Triangle		Kth Row of Pascal's Triangle
LCS		LCS
LCS OF THREE STRINGS		LCS OF THREE STRINGS
LIS(DP)		LIS(DP)
LONGEST COMMON SUBSEQUENCE		LONGEST COMMON SUBSEQUENCE

Navigation Menu

Repository files navigation

COYO-IIT-BHU

About

Releases

Packages

Used by

Contributors

Languages

Folders and files

Latest commit

History

Repository files navigation

COYO-IIT-BHU

About

Resources

Stars

Watchers

Forks

Releases

Packages

Used by

Contributors

Languages