Name		Name	Last commit message	Last commit date
Latest commit History 38 Commits
BFS of graph - GFG		BFS of graph - GFG
DFS of Graph - GFG		DFS of Graph - GFG
Detect cycle in a directed graph - GFG		Detect cycle in a directed graph - GFG
Detect cycle in an undirected graph - GFG		Detect cycle in an undirected graph - GFG
Height of Binary Tree - GFG		Height of Binary Tree - GFG
Print adjacency list - GFG		Print adjacency list - GFG
Activity Selection Problem.cpp		Activity Selection Problem.cpp
Add two numbers represented by linked lists..cpp		Add two numbers represented by linked lists..cpp
Add “1” to a number represented as a Linked List..cpp		Add “1” to a number represented as a Linked List..cpp
Best time to buy and Sell stock.cpp		Best time to buy and Sell stock.cpp
Boundary traversal of a Binary tree.cpp		Boundary traversal of a Binary tree.cpp
Check if 2 trees are mirror or not.cpp		Check if 2 trees are mirror or not.cpp
Check if Binary tree is Sum tree or not.cpp		Check if Binary tree is Sum tree or not.cpp
Check if a linked list is a circular linked list..cpp		Check if a linked list is a circular linked list..cpp
Check if a tree is balanced or not.cpp		Check if a tree is balanced or not.cpp
Check if all leaf nodes are at same level or not.cpp		Check if all leaf nodes are at same level or not.cpp
Construct Binary tree from Inorder and preorder traversal.cpp		Construct Binary tree from Inorder and preorder traversal.cpp
Construct a trie from scratch .cpp		Construct a trie from scratch .cpp
Convert Binary tree into Doubly Linked List.cpp		Convert Binary tree into Doubly Linked List.cpp
Convert Binary tree into Sum tree.cpp		Convert Binary tree into Sum tree.cpp
Count pairs from 2 BST.cpp		Count pairs from 2 BST.cpp
Count set bits in an integer.cpp		Count set bits in an integer.cpp
Create a Graph, print it.cpp		Create a Graph, print it.cpp
Delete nodes having greater value on right.cpp		Delete nodes having greater value on right.cpp
Deletion from a Circular Linked List..cpp		Deletion from a Circular Linked List..cpp
Diameter of binary tree.cpp		Diameter of binary tree.cpp
Fina a value in a BST.cpp		Fina a value in a BST.cpp
Find Kth Largest_ element in a BST.cpp		Find Kth Largest_ element in a BST.cpp
Find Kth smallest element in a BST.cpp		Find Kth smallest element in a BST.cpp
Find LCA of 2 nodes in a BST.cpp		Find LCA of 2 nodes in a BST.cpp
Find all pairs with a given sum.cpp		Find all pairs with a given sum.cpp
Find common elements in three sorted arrays.cpp		Find common elements in three sorted arrays.cpp
Find first and last positions of an element in a sorted array.cpp		Find first and last positions of an element in a sorted array.cpp
Find inorder successor and inorder predecessor in a BST.cpp		Find inorder successor and inorder predecessor in a BST.cpp
Find min and max value in a BST.cpp		Find min and max value in a BST.cpp
Find pairs with a given sum in a DLL..cpp		Find pairs with a given sum in a DLL..cpp
Find shortest unique prefix for every word in a given list.cpp		Find shortest unique prefix for every word in a given list.cpp
Find the Kth max and min element of an array.cpp		Find the Kth max and min element of an array.cpp
Find the Union and Intersection of the two sorted arrays..cpp		Find the Union and Intersection of the two sorted arrays..cpp
Find the maximum and minimum element in an array.cpp		Find the maximum and minimum element in an array.cpp
Find the middle Element of a linked list..cpp		Find the middle Element of a linked list..cpp
Find the starting point of the loop.cpp		Find the starting point of the loop.cpp
Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo.cpp		Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo.cpp
Height of a tree.cpp		Height of a tree.cpp
Intersection Point of two Linked Lists..cpp		Intersection Point of two Linked Lists..cpp
Intersection of two Sorted Linked List..cpp		Intersection of two Sorted Linked List..cpp
Merge 2 sorted arrays without using Extra space..cpp		Merge 2 sorted arrays without using Extra space..cpp
Merge Intervals.cpp		Merge Intervals.cpp
Most frequent word in an array of strings.cpp		Most frequent word in an array of strings.cpp
Move all the negative elements to one side of the array.cpp		Move all the negative elements to one side of the array.cpp
Populate Inorder successor of all nodes.cpp		Populate Inorder successor of all nodes.cpp
Print unique rows in a given boolean matrix.cpp		Print unique rows in a given boolean matrix.cpp
Program for n’th node from the end of a Linked List.cpp		Program for n’th node from the end of a Linked List.cpp
README.md		README.md
Remove Duplicates in a Un-sorted Linked List..cpp		Remove Duplicates in a Un-sorted Linked List..cpp
Remove Duplicates in a sorted Linked List..cpp		Remove Duplicates in a sorted Linked List..cpp
Reverse Level Order traversal.cpp		Reverse Level Order traversal.cpp
Reverse a Doubly Linked list..cpp		Reverse a Doubly Linked list..cpp
Reverse a String.cpp		Reverse a String.cpp
Reverse the array.cpp		Reverse the array.cpp
Rotate DoublyLinked list by N nodes..cpp		Rotate DoublyLinked list by N nodes..cpp
Sort a LL of 0's, 1's and 2's.cpp		Sort a LL of 0's, 1's and 2's.cpp
Sort an array according to the other.cpp		Sort an array according to the other.cpp
Split a Circular linked list into two halves..cpp		Split a Circular linked list into two halves..cpp
Sum of Nodes on the Longest path from root to leaf node.cpp		Sum of Nodes on the Longest path from root to leaf node.cpp
Tree Isomorphism Problem.cpp		Tree Isomorphism Problem.cpp
Write a Program to Move the last element to Front in a Linked List..cpp		Write a Program to Move the last element to Front in a Linked List..cpp
Write a Program to reverse the Linked List. (Iterative).cpp		Write a Program to reverse the Linked List. (Iterative).cpp
Write a Program to reverse the Linked List. (recursive).cpp		Write a Program to reverse the Linked List. (recursive).cpp
Write a program to Delete loop in a linked list..cpp		Write a program to Delete loop in a linked list..cpp
Write a program to Detect loop in a linked list..cpp		Write a program to Detect loop in a linked list..cpp
Write a program to cyclically rotate an array by one..cpp		Write a program to cyclically rotate an array by one..cpp
Zig-Zag traversal of a binary tree.cpp		Zig-Zag traversal of a binary tree.cpp
bottom view of binary tree.cpp		bottom view of binary tree.cpp
check for bst.cpp		check for bst.cpp
check-if-an-array-can-be-divided-into-pairs-whose-sum-is-divisible-by-k.cpp		check-if-an-array-can-be-divided-into-pairs-whose-sum-is-divisible-by-k.cpp
count inversions.cpp		count inversions.cpp
count pairs with given sum.cpp		count pairs with given sum.cpp
count-distinct-elements-in-every-window-of-size-k.cpp		count-distinct-elements-in-every-window-of-size-k.cpp
find common elements In 3 sorted arrays.cpp		find common elements In 3 sorted arrays.cpp
find duplicate in an array of N+1 Integers.cpp		find duplicate in an array of N+1 Integers.cpp
find-the-element-that-appears-once-in-a-sorted-array.cpp		find-the-element-that-appears-once-in-a-sorted-array.cpp
first-element-occurring-k-times-array.cpp		first-element-occurring-k-times-array.cpp
inorder traversal.cpp		inorder traversal.cpp
left view of a tree.cpp		left view of a tree.cpp
level order traversal.cpp		level order traversal.cpp
mirror of binary tree.cpp		mirror of binary tree.cpp
postorder traversal.cpp		postorder traversal.cpp
preorder traversal.cpp		preorder traversal.cpp
reverse(Iterative) (2).cpp		reverse(Iterative) (2).cpp
reverse(recursive) (1).cpp		reverse(recursive) (1).cpp
right view of a tree.cpp		right view of a tree.cpp
top view of a tree.cpp		top view of a tree.cpp

jatinparashar333/SDE-sheet-450

Folders and files

Latest commit

History

Repository files navigation

SDE-sheet-450

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages