Skip to content

Hariharanreddy/Questions-solved-on-GFG-and-Leetcode.

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

633 Commits
100-same-tree
100-same-tree
 
 
102-binary-tree-level-order-traversal
102-binary-tree-level-order-traversal
 
 
1021-remove-outermost-parentheses
1021-remove-outermost-parentheses
 
 
103-binary-tree-zigzag-level-order-traversal
103-binary-tree-zigzag-level-order-traversal
 
 
104-maximum-depth-of-binary-tree
104-maximum-depth-of-binary-tree
 
 
107-binary-tree-level-order-traversal-ii
107-binary-tree-level-order-traversal-ii
 
 
110-balanced-binary-tree
110-balanced-binary-tree
 
 
125-valid-palindrome
125-valid-palindrome
 
 
142-linked-list-cycle-ii
142-linked-list-cycle-ii
 
 
144-binary-tree-preorder-traversal
144-binary-tree-preorder-traversal
 
 
145-binary-tree-postorder-traversal
145-binary-tree-postorder-traversal
 
 
189-rotate-array
189-rotate-array
 
 
1910-remove-all-occurrences-of-a-substring
1910-remove-all-occurrences-of-a-substring
 
 
20-valid-parentheses
20-valid-parentheses
 
 
222-count-complete-tree-nodes
222-count-complete-tree-nodes
 
 
240-search-a-2d-matrix-ii
240-search-a-2d-matrix-ii
 
 
287-find-the-duplicate-number
287-find-the-duplicate-number
 
 
31-next-permutation
31-next-permutation
 
 
34-find-first-and-last-position-of-element-in-sorted-array
34-find-first-and-last-position-of-element-in-sorted-array
 
 
344-reverse-string
344-reverse-string
 
 
40-combination-sum-ii
40-combination-sum-ii
 
 
509-fibonacci-number
509-fibonacci-number
 
 
54-spiral-matrix
54-spiral-matrix
 
 
543-diameter-of-binary-tree
543-diameter-of-binary-tree
 
 
637-average-of-levels-in-binary-tree
637-average-of-levels-in-binary-tree
 
 
70-climbing-stairs
70-climbing-stairs
 
 
724-find-pivot-index
724-find-pivot-index
 
 
74-search-a-2d-matrix
74-search-a-2d-matrix
 
 
852-peak-index-in-a-mountain-array
852-peak-index-in-a-mountain-array
 
 
94-binary-tree-inorder-traversal
94-binary-tree-inorder-traversal
 
 
987-vertical-order-traversal-of-a-binary-tree
987-vertical-order-traversal-of-a-binary-tree
 
 
Add 1 to a number represented as linked list - GFG
Add 1 to a number represented as linked list - GFG
 
 
Add two numbers represented by linked lists - GFG
Add two numbers represented by linked lists - GFG
 
 
Anagram - GFG
Anagram - GFG
 
 
Armstrong Numbers - GFG
Armstrong Numbers - GFG
 
 
BST to max heap - GFG
BST to max heap - GFG
 
 
Binary Tree to BST - GFG
Binary Tree to BST - GFG
 
 
Binary Tree to DLL - GFG
Binary Tree to DLL - GFG
 
 
Binary number to decimal number - GFG
Binary number to decimal number - GFG
 
 
Bottom View of Binary Tree - GFG
Bottom View of Binary Tree - GFG
 
 
Boundary Traversal of binary tree - GFG
Boundary Traversal of binary tree - GFG
 
 
Brothers From Different Roots - GFG
Brothers From Different Roots - GFG
 
 
Burning Tree - GFG
Burning Tree - GFG
 
 
Check If Circular Linked List - GFG
Check If Circular Linked List - GFG
 
 
Check for BST - GFG
Check for BST - GFG
 
 
Check for Balanced Tree - GFG
Check for Balanced Tree - GFG
 
 
Check if Linked List is Palindrome - GFG
Check if Linked List is Palindrome - GFG
 
 
Circular tour - GFG
Circular tour - GFG
 
 
Clone a linked list with next and random pointer - GFG
Clone a linked list with next and random pointer - GFG
 
 
Combination Sum - GFG
Combination Sum - GFG
 
 
Common Subsequence - GFG
Common Subsequence - GFG
 
 
Construct Tree from Inorder & Preorder - GFG
Construct Tree from Inorder & Preorder - GFG
 
 
Count Inversions - GFG
Count Inversions - GFG
 
 
Count Leaves in Binary Tree - GFG
Count Leaves in Binary Tree - GFG
 
 
Count nodes of linked list - GFG
Count nodes of linked list - GFG
 
 
Count pairs with given sum - GFG
Count pairs with given sum - GFG
 
 
Count the Reversals - GFG
Count the Reversals - GFG
 
 
Count the characters - GFG
Count the characters - GFG
 
 
Count ways to reach the n'th stair - GFG
Count ways to reach the n'th stair - GFG
 
 
Decimal to binary - GFG
Decimal to binary - GFG
 
 
Delete a node from BST - GFG
Delete a node from BST - GFG
 
 
Delete middle element of a stack - GFG
Delete middle element of a stack - GFG
 
 
Deque Implementations - GFG
Deque Implementations - GFG
 
 
Detect Loop in linked list - GFG
Detect Loop in linked list - GFG
 
 
Diagonal Traversal of Binary Tree - GFG
Diagonal Traversal of Binary Tree - GFG
 
 
Diameter of a Binary Tree - GFG
Diameter of a Binary Tree - GFG
 
 
Expression contains redundant bracket or not - GFG
Expression contains redundant bracket or not - GFG
 
 
Find Prime numbers in a range - GFG
Find Prime numbers in a range - GFG
 
 
Find a pair with given target in BST - GFG
Find a pair with given target in BST - GFG
 
 
Find all possible palindromic partitions of a String - GFG
Find all possible palindromic partitions of a String - GFG
 
 
Find duplicates in an array - GFG
Find duplicates in an array - GFG
 
 
Find length of Loop - GFG
Find length of Loop - GFG
 
 
Find median in a stream - GFG
Find median in a stream - GFG
 
 
Find the Frequency - GFG
Find the Frequency - GFG
 
 
Find the first node of loop in linked list - GFG
Find the first node of loop in linked list - GFG
 
 
Find the smallest and second smallest element in an array - GFG
Find the smallest and second smallest element in an array - GFG
 
 
Finding middle element in a linked list - GFG
Finding middle element in a linked list - GFG
 
 
First negative integer in every window of size k - GFG
First negative integer in every window of size k - GFG
 
 
First non-repeating character in a stream - GFG
First non-repeating character in a stream - GFG
 
 
Flatten binary tree to linked list - GFG
Flatten binary tree to linked list - GFG
 
 
Flattening a Linked List - GFG
Flattening a Linked List - GFG
 
 
Get min at pop - GFG
Get min at pop - GFG
 
 
Get minimum element from stack - GFG
Get minimum element from stack - GFG
 
 
Given a linked list of 0s, 1s and 2s, sort it. - GFG
Given a linked list of 0s, 1s and 2s, sort it. - GFG
 
 
Heap Sort - GFG
Heap Sort - GFG
 
 
Height of Binary Tree - GFG
Height of Binary Tree - GFG
 
 
Implement Queue using array - GFG
Implement Queue using array - GFG
 
 
Implement two stacks in an array - GFG
Implement two stacks in an array - GFG
 
 
Inorder Traversal (Iterative) - GFG
Inorder Traversal (Iterative) - GFG
 
 
Inorder Traversal - GFG
Inorder Traversal - GFG
 
 
Interleave the First Half of the Queue with Second Half - GFG
Interleave the First Half of the Queue with Second Half - GFG
 
 
Intersection Point in Y Shapped Linked Lists - GFG
Intersection Point in Y Shapped Linked Lists - GFG
 
 
Intersection of two sorted Linked lists - GFG
Intersection of two sorted Linked lists - GFG
 
 
Is Binary Tree Heap - GFG
Is Binary Tree Heap - GFG
 
 
K Sum Paths - GFG
K Sum Paths - GFG
 
 
K-th element of two sorted Arrays - GFG
K-th element of two sorted Arrays - GFG
 
 
Kadane's Algorithm - GFG
Kadane's Algorithm - GFG
 
 
Kth Ancestor in a Tree - GFG
Kth Ancestor in a Tree - GFG
 
 
Kth element in Matrix - GFG
Kth element in Matrix - GFG
 
 
Kth largest element in BST - GFG
Kth largest element in BST - GFG
 
 

Repository files navigation

LEETCODE-JOURNEY

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub.

About

Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub](https://github.com/QasimWani/LeetHub).

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages