LeetCode-GFG-LintCode-Practice

In this repository, it contains the solution of coding question in Java which I am submitting during my preparation.

Name		Name	Last commit message	Last commit date
Latest commit History 1,196 Commits
0 - 1 Knapsack Problem - GFG		0 - 1 Knapsack Problem - GFG
0two-sum		0two-sum
1-two-sum		1-two-sum
1. Inorder Traversal - GFG		1. Inorder Traversal - GFG
1. Insert a node in a BST - GFG		1. Insert a node in a BST - GFG
1. Rat in a Maze Problem - I - GFG		1. Rat in a Maze Problem - I - GFG
10. Flood fill Algorithm - GFG		10. Flood fill Algorithm - GFG
1004-max-consecutive-ones-iii		1004-max-consecutive-ones-iii
1008-construct-binary-search-tree-from-preorder-traversal		1008-construct-binary-search-tree-from-preorder-traversal
1009-complement-of-base-10-integer		1009-complement-of-base-10-integer
1020-number-of-enclaves		1020-number-of-enclaves
1021-remove-outermost-parentheses		1021-remove-outermost-parentheses
1022-sum-of-root-to-leaf-binary-numbers		1022-sum-of-root-to-leaf-binary-numbers
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
1034-coloring-a-border		1034-coloring-a-border
1038-binary-search-tree-to-greater-sum-tree		1038-binary-search-tree-to-greater-sum-tree
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1046-last-stone-weight		1046-last-stone-weight
107-binary-tree-level-order-traversal-ii		107-binary-tree-level-order-traversal-ii
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
1081-smallest-subsequence-of-distinct-characters		1081-smallest-subsequence-of-distinct-characters
1092-shortest-common-supersequence		1092-shortest-common-supersequence
1094-car-pooling		1094-car-pooling
11-container-with-most-water		11-container-with-most-water
110-balanced-binary-tree		110-balanced-binary-tree
111-minimum-depth-of-binary-tree		111-minimum-depth-of-binary-tree
112-path-sum		112-path-sum
113-path-sum-ii		113-path-sum-ii
1137-n-th-tribonacci-number		1137-n-th-tribonacci-number
1143-longest-common-subsequence		1143-longest-common-subsequence
116-populating-next-right-pointers-in-each-node		116-populating-next-right-pointers-in-each-node
1161-maximum-level-sum-of-a-binary-tree		1161-maximum-level-sum-of-a-binary-tree
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
118-pascals-triangle		118-pascals-triangle
1190-reverse-substrings-between-each-pair-of-parentheses		1190-reverse-substrings-between-each-pair-of-parentheses
12. Possible Words From Phone Digits - GFG		12. Possible Words From Phone Digits - GFG
120-triangle		120-triangle
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
1248-count-number-of-nice-subarrays		1248-count-number-of-nice-subarrays
1254-number-of-closed-islands		1254-number-of-closed-islands
1260-shift-2d-grid		1260-shift-2d-grid
1268-search-suggestions-system		1268-search-suggestions-system
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
131-palindrome-partitioning		131-palindrome-partitioning
1312-minimum-insertion-steps-to-make-a-string-palindrome		1312-minimum-insertion-steps-to-make-a-string-palindrome
1319-number-of-operations-to-make-network-connected		1319-number-of-operations-to-make-network-connected
1339-maximum-product-of-splitted-binary-tree		1339-maximum-product-of-splitted-binary-tree
136-single-number		136-single-number
137-single-number-ii		137-single-number-ii
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1381-design-a-stack-with-increment-operation		1381-design-a-stack-with-increment-operation
1382-balance-a-binary-search-tree		1382-balance-a-binary-search-tree
1385-find-the-distance-value-between-two-arrays		1385-find-the-distance-value-between-two-arrays
14-longest-common-prefix		14-longest-common-prefix
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
146-lru-cache		146-lru-cache
147-insertion-sort-list		147-insertion-sort-list
148-sort-list		148-sort-list
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
152-maximum-product-subarray		152-maximum-product-subarray
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
154-find-minimum-in-rotated-sorted-array-ii		154-find-minimum-in-rotated-sorted-array-ii
1541-minimum-insertions-to-balance-a-parentheses-string		1541-minimum-insertions-to-balance-a-parentheses-string
1569-number-of-ways-to-reorder-array-to-get-same-bst		1569-number-of-ways-to-reorder-array-to-get-same-bst
16. Huffman Encoding - GFG		16. Huffman Encoding - GFG
16. Josephus problem - GFG		16. Josephus problem - GFG
16. Right View of Binary Tree - GFG		16. Right View of Binary Tree - GFG
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
1642-furthest-building-you-can-reach		1642-furthest-building-you-can-reach
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
1671-minimum-number-of-removals-to-make-mountain-array		1671-minimum-number-of-removals-to-make-mountain-array
1672-richest-customer-wealth		1672-richest-customer-wealth
1673-find-the-most-competitive-subsequence		1673-find-the-most-competitive-subsequence
1679-max-number-of-k-sum-pairs		1679-max-number-of-k-sum-pairs
169-majority-element		169-majority-element
17. Reverse a Linked List in groups of given size. - GFG		17. Reverse a Linked List in groups of given size. - GFG
17. Tower Of Hanoi - GFG		17. Tower Of Hanoi - GFG
171-excel-sheet-column-number		171-excel-sheet-column-number
1721-swapping-nodes-in-a-linked-list		1721-swapping-nodes-in-a-linked-list
1791-find-center-of-star-graph		1791-find-center-of-star-graph
18-4sum		18-4sum
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
1971-find-if-path-exists-in-graph		1971-find-if-path-exists-in-graph
199-binary-tree-right-side-view		199-binary-tree-right-side-view
2-add-two-numbers		2-add-two-numbers
2. Delete Middle of Linked List - GFG		2. Delete Middle of Linked List - GFG
2. Lowest Common Ancestor in a BST - GFG		2. Lowest Common Ancestor in a BST - GFG
2. Delete Middle of Linked List - GFG		2. Delete Middle of Linked List - GFG
2. Lowest Common Ancestor in a BST - GFG		2. Lowest Common Ancestor in a BST - GFG
2. Maximum of all subarrays of size k - GFG		2. Maximum of all subarrays of size k - GFG
20-valid-parentheses		20-valid-parentheses
200-number-of-islands		200-number-of-islands
2006-count-number-of-pairs-with-absolute-difference-k		2006-count-number-of-pairs-with-absolute-difference-k
203-remove-linked-list-elements		203-remove-linked-list-elements
204-count-primes		204-count-primes
207-course-schedule		207-course-schedule

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

LeetCode-GFG-LintCode-Practice

About

Uh oh!

Releases

Packages

Languages

swatiprajapati08/LeetCode-Practice

Folders and files

Latest commit

History

Repository files navigation

LeetCode-GFG-LintCode-Practice

About

Topics

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages