DSA-Practice

This repository contains the solution of the problems done on the Leetcode and the Geeksforgeeks. The sheet solved to practice the problems are as follows:

Coding Sheet

Name		Name	Last commit message	Last commit date
0008-string-to-integer-atoi		0008-string-to-integer-atoi
0014-longest-common-prefix		0014-longest-common-prefix
0019-remove-nth-node-from-end-of-list		0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0023-merge-k-sorted-lists		0023-merge-k-sorted-lists
0036-valid-sudoku		0036-valid-sudoku
0037-sudoku-solver		0037-sudoku-solver
0038-count-and-say		0038-count-and-say
0039-combination-sum		0039-combination-sum
0041-first-missing-positive		0041-first-missing-positive
0046-permutations		0046-permutations
0050-powx-n		0050-powx-n
0051-n-queens		0051-n-queens
0053-maximum-subarray		0053-maximum-subarray
0054-spiral-matrix		0054-spiral-matrix
0056-merge-intervals		0056-merge-intervals
0059-spiral-matrix-ii		0059-spiral-matrix-ii
0060-permutation-sequence		0060-permutation-sequence
0073-set-matrix-zeroes		0073-set-matrix-zeroes
0075-sort-colors		0075-sort-colors
0088-merge-sorted-array		0088-merge-sorted-array
0091-decode-ways		0091-decode-ways
0118-pascals-triangle		0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0131-palindrome-partitioning		0131-palindrome-partitioning
0139-word-break		0139-word-break
0169-majority-element		0169-majority-element
0206-reverse-linked-list		0206-reverse-linked-list
0226-invert-binary-tree		0226-invert-binary-tree
0229-majority-element-ii		0229-majority-element-ii
0540-single-element-in-a-sorted-array		0540-single-element-in-a-sorted-array
0704-binary-search		0704-binary-search
0785-is-graph-bipartite		0785-is-graph-bipartite
0875-koko-eating-bananas		0875-koko-eating-bananas
1523-count-odd-numbers-in-an-interval-range		1523-count-odd-numbers-in-an-interval-range
1539-kth-missing-positive-number		1539-kth-missing-positive-number
1572-matrix-diagonal-sum		1572-matrix-diagonal-sum
2187-minimum-time-to-complete-trips		2187-minimum-time-to-complete-trips
2390-removing-stars-from-a-string		2390-removing-stars-from-a-string
Arithmetic Number - GFG		Arithmetic Number - GFG
BST Downward Traversal - GFG		BST Downward Traversal - GFG
Binary matrix having maximum number of 1s - GFG		Binary matrix having maximum number of 1s - GFG
Fractional Knapsack - GFG		Fractional Knapsack - GFG
GFG		GFG
Job Sequencing Problem - GFG		Job Sequencing Problem - GFG
Leetcode		Leetcode
Max Level Sum in Binary Tree - GFG		Max Level Sum in Binary Tree - GFG
Minimum Integer - GFG		Minimum Integer - GFG
Minimum Steps Required - GFG		Minimum Steps Required - GFG
N meetings in one room - GFG		N meetings in one room - GFG
Subset Sums - GFG		Subset Sums - GFG
Total Cuts - GFG		Total Cuts - GFG
README.md		README.md

Navigation Menu

Repository files navigation

DSA-Practice

About

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

DSA-Practice

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages