master

BranchesTags

Go to file

Code

Open more actions menu

Latest commit

 

History

82 Commits

82 Commits

Folders and files

Name		Name	Last commit message	Last commit date
(2nd approach) program to check if a binary tree is BST		(2nd approach) program to check if a binary tree is BST
A program to check if a binary tree is BST or not		A program to check if a binary tree is BST or not
Binary Search 01-Find the index of last occurence of element in soeted array		Binary Search 01-Find the index of last occurence of element in soeted array
Binary Search 02- Count number of occurrence of an element		Binary Search 02- Count number of occurrence of an element
Binary Search 03 - Count no of 1's in a array		Binary Search 03 - Count no of 1's in a array
Binary Search 03- Search an element in a sorted and circular array		Binary Search 03- Search an element in a sorted and circular array
Binary Search 04-Find Peak element in unsorted array		Binary Search 04-Find Peak element in unsorted array
Binary Search Tree : Lowest Common Ancestor		Binary Search Tree : Lowest Common Ancestor
Binary Search-05 Find no of rotations of an circular sorted array or find smallest element in circular sorted array		Binary Search-05 Find no of rotations of an circular sorted array or find smallest element in circular sorted array
Binary Tree to Doubly Linked List		Binary Tree to Doubly Linked List
Check identical trees		Check identical trees
Circular tour-		Circular tour-
Coomvault - DP question of canisters		Coomvault - DP question of canisters
Count inversions in an array		Count inversions in an array
Create a mirror of a binary tree		Create a mirror of a binary tree
Find subarray with given sum		Find subarray with given sum
Find subarray with given sum (handles Negative number)		Find subarray with given sum (handles Negative number)
GFG Main input file		GFG Main input file
Greedy - Highest Product		Greedy - Highest Product
Heap 01 - HeapSort		Heap 01 - HeapSort
Linked List 01- Reverse a linked list using recursion		Linked List 01- Reverse a linked list using recursion
Linked List 02 - Check for pallandrom without using stack		Linked List 02 - Check for pallandrom without using stack
Lowest Common Ancestor		Lowest Common Ancestor
Matrix chain Multipication		Matrix chain Multipication
Max width of a tree		Max width of a tree
Maximum width of a binary tree		Maximum width of a binary tree
Meeting rooms		Meeting rooms
Merge K sorted Lists		Merge K sorted Lists
Merge k sorted Lists		Merge k sorted Lists
Minimum number of steps to reach nth floor.java		Minimum number of steps to reach nth floor.java
Print a Binary Tree in Vertical Order		Print a Binary Tree in Vertical Order
Print ancestors of a node in Binary tree		Print ancestors of a node in Binary tree
Queue 01 - Sliding window maximum		Queue 01 - Sliding window maximum
Random		Random
Rotten Oranges - Queues		Rotten Oranges - Queues
Select distinct names - SQL		Select distinct names - SQL
Sorting 01- Merge 2 sorted array with O(1) space		Sorting 01- Merge 2 sorted array with O(1) space
Sorting 02- Count inversions in an array		Sorting 02- Count inversions in an array
Spiral traversal of tree without recursion		Spiral traversal of tree without recursion
Stack 01- balanced paanathesis		Stack 01- balanced paanathesis
Stack 01- largest Rectangle		Stack 01- largest Rectangle
The celebrity problem		The celebrity problem
Trapping Rain Water		Trapping Rain Water
Truck tour -01		Truck tour -01
Vertical sum in a tree		Vertical sum in a tree
Zig zag		Zig zag
check if a tree is subtree of another tree		check if a tree is subtree of another tree
queue-using-two-stacks		queue-using-two-stacks
random123		random123
searching questions		searching questions
t		t
to create a tree		to create a tree
truck tour 1		truck tour 1
vertical traversal in a tree		vertical traversal in a tree
View all files

About

No description, website, or topics provided.

Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks

Report repository

Releases

Packages

Contributors

Languages