Coder Social home page Coder Social logo

dsa_question-challenge's Introduction

DSA_Question-Challenge

In this repository I add my solved regular basis coding question of DSA

Array

0011-container-with-most-water
0027-remove-element
0049-group-anagrams
0057-insert-interval
0075-sort-colors
0080-remove-duplicates-from-sorted-array-ii
0088-merge-sorted-array
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0137-single-number-ii
0167-two-sum-ii-input-array-is-sorted
0169-majority-element
0189-rotate-array
0228-summary-ranges
0238-product-of-array-except-self
0239-sliding-window-maximum
0274-h-index
0330-patching-array
0347-top-k-frequent-elements
0448-find-all-numbers-disappeared-in-an-array
0452-minimum-number-of-arrows-to-burst-balloons
0477-total-hamming-distance
0502-ipo
0561-array-partition
0982-minimum-increment-to-make-array-unique
1001-n-repeated-element-in-size-2n-array
1016-subarray-sums-divisible-by-k
1095-two-city-scheduling
1137-height-checker
1217-relative-sort-array
1329-minimum-cost-to-move-chips-to-the-same-position
1482-how-many-numbers-are-smaller-than-the-current-number
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
1580-shuffle-the-array
1635-number-of-good-pairs
1720-crawler-log-folder
1829-maximum-units-on-a-truck
1938-minimum-operations-to-make-the-array-increasing
1988-minimize-maximum-pair-sum-in-array
2042-maximum-product-difference-between-two-pairs
2048-build-array-from-permutation
2058-concatenation-of-array
2137-final-value-of-variable-after-performing-operations
2148-minimum-number-of-moves-to-seat-everyone
2219-maximum-number-of-words-found-in-sentences
2519-find-the-original-array-of-prefix-xor
2706-minimum-score-by-changing-two-elements
2767-maximum-sum-with-exactly-k-elements
2836-neither-minimum-nor-maximum
2917-count-pairs-whose-sum-is-less-than-target
3363-most-frequent-ids

Hash Table

0003-longest-substring-without-repeating-characters
0049-group-anagrams
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0169-majority-element
0290-word-pattern
0347-top-k-frequent-elements
0448-find-all-numbers-disappeared-in-an-array
0782-jewels-and-stones
1001-n-repeated-element-in-size-2n-array
1016-subarray-sums-divisible-by-k
1217-relative-sort-array
1482-how-many-numbers-are-smaller-than-the-current-number
1635-number-of-good-pairs
3363-most-frequent-ids

Prefix Sum

0238-product-of-array-except-self
1016-subarray-sums-divisible-by-k

Divide and Conquer

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0169-majority-element
0191-number-of-1-bits
0347-top-k-frequent-elements

Sorting

0049-group-anagrams
0075-sort-colors
0088-merge-sorted-array
0169-majority-element
0274-h-index
0347-top-k-frequent-elements
0452-minimum-number-of-arrows-to-burst-balloons
0502-ipo
0561-array-partition
0982-minimum-increment-to-make-array-unique
1095-two-city-scheduling
1137-height-checker
1217-relative-sort-array
1482-how-many-numbers-are-smaller-than-the-current-number
1829-maximum-units-on-a-truck
1988-minimize-maximum-pair-sum-in-array
2042-maximum-product-difference-between-two-pairs
2148-minimum-number-of-moves-to-seat-everyone
2264-minimum-sum-of-four-digit-number-after-splitting-digits
2706-minimum-score-by-changing-two-elements
2836-neither-minimum-nor-maximum
2917-count-pairs-whose-sum-is-less-than-target

Heap (Priority Queue)

0239-sliding-window-maximum
0347-top-k-frequent-elements
0502-ipo
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
3363-most-frequent-ids

Bucket Sort

0347-top-k-frequent-elements

Counting

0347-top-k-frequent-elements

Quickselect

0347-top-k-frequent-elements

Ordered Set

1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
3363-most-frequent-ids

Counting Sort

0169-majority-element
0274-h-index
0561-array-partition
0982-minimum-increment-to-make-array-unique
1137-height-checker
1217-relative-sort-array
1482-how-many-numbers-are-smaller-than-the-current-number
1635-number-of-good-pairs

Queue

0239-sliding-window-maximum
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit

Sliding Window

0003-longest-substring-without-repeating-characters
0239-sliding-window-maximum
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit

Monotonic Queue

0239-sliding-window-maximum
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit

Two Pointers

0011-container-with-most-water
0027-remove-element
0075-sort-colors
0080-remove-duplicates-from-sorted-array-ii
0088-merge-sorted-array
0125-valid-palindrome
0167-two-sum-ii-input-array-is-sorted
0189-rotate-array
0392-is-subsequence
1988-minimize-maximum-pair-sum-in-array
2917-count-pairs-whose-sum-is-less-than-target

Tree

0105-construct-binary-tree-from-preorder-and-inorder-traversal

Binary Tree

0105-construct-binary-tree-from-preorder-and-inorder-traversal

Bit Manipulation

0137-single-number-ii
0191-number-of-1-bits
0461-hamming-distance
0476-number-complement
0477-total-hamming-distance
0899-binary-gap
2519-find-the-original-array-of-prefix-xor

Math

0189-rotate-array
0477-total-hamming-distance
1329-minimum-cost-to-move-chips-to-the-same-position
1448-maximum-69-number
1635-number-of-good-pairs
2264-minimum-sum-of-four-digit-number-after-splitting-digits
2556-convert-the-temperature

Simulation

2048-build-array-from-permutation
2058-concatenation-of-array
2137-final-value-of-variable-after-performing-operations
2800-minimum-string-length-after-removing-substrings

String

0003-longest-substring-without-repeating-characters
0049-group-anagrams
0125-valid-palindrome
0290-word-pattern
0392-is-subsequence
0782-jewels-and-stones
1720-crawler-log-folder
1737-maximum-nesting-depth-of-the-parentheses
2088-minimum-time-to-type-word-using-special-typewriter
2137-final-value-of-variable-after-performing-operations
2219-maximum-number-of-words-found-in-sentences
2800-minimum-string-length-after-removing-substrings

Binary Search

0167-two-sum-ii-input-array-is-sorted
2917-count-pairs-whose-sum-is-less-than-target

Greedy

0011-container-with-most-water
0122-best-time-to-buy-and-sell-stock-ii
0330-patching-array
0452-minimum-number-of-arrows-to-burst-balloons
0502-ipo
0561-array-partition
0982-minimum-increment-to-make-array-unique
1095-two-city-scheduling
1329-minimum-cost-to-move-chips-to-the-same-position
1448-maximum-69-number
1829-maximum-units-on-a-truck
1938-minimum-operations-to-make-the-array-increasing
1988-minimize-maximum-pair-sum-in-array
2088-minimum-time-to-type-word-using-special-typewriter
2148-minimum-number-of-moves-to-seat-everyone
2264-minimum-sum-of-four-digit-number-after-splitting-digits
2706-minimum-score-by-changing-two-elements
2767-maximum-sum-with-exactly-k-elements

Dynamic Programming

0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0392-is-subsequence

Graph

1916-find-center-of-star-graph

Stack

1720-crawler-log-folder
1737-maximum-nesting-depth-of-the-parentheses
2800-minimum-string-length-after-removing-substrings

LeetCode Topics

Array

0045-jump-game-ii
0055-jump-game
0120-triangle
0287-find-the-duplicate-number
0322-coin-change
0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii
0414-third-maximum-number
0453-minimum-moves-to-equal-array-elements
0455-assign-cookies
0474-ones-and-zeroes
0495-teemo-attacking
0522-longest-uncommon-subsequence-ii
0523-continuous-subarray-sum
0658-find-k-closest-elements
0822-unique-morse-code-words
0943-sum-of-subarray-minimums
0948-sort-an-array
0954-maximum-sum-circular-subarray
1228-minimum-cost-tree-from-leaf-values
1256-rank-transform-of-an-array
1293-three-consecutive-odds
1496-lucky-numbers-in-a-matrix
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1720-crawler-log-folder
1741-sort-array-by-increasing-frequency
1803-average-waiting-time
1951-find-the-winner-of-the-circular-game
2306-create-binary-tree-from-descriptions
2846-robot-collisions
3420-find-occurrences-of-an-element-in-an-array

Dynamic Programming

0045-jump-game-ii
0055-jump-game
0120-triangle
0124-binary-tree-maximum-path-sum
0131-palindrome-partitioning
0322-coin-change
0474-ones-and-zeroes
0943-sum-of-subarray-minimums
0954-maximum-sum-circular-subarray
1228-minimum-cost-tree-from-leaf-values

Greedy

0045-jump-game-ii
0055-jump-game
0455-assign-cookies
0680-valid-palindrome-ii
1228-minimum-cost-tree-from-leaf-values
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves

String

0012-integer-to-roman
0014-longest-common-prefix
0020-valid-parentheses
0028-find-the-index-of-the-first-occurrence-in-a-string
0131-palindrome-partitioning
0208-implement-trie-prefix-tree
0459-repeated-substring-pattern
0474-ones-and-zeroes
0520-detect-capital
0522-longest-uncommon-subsequence-ii
0680-valid-palindrome-ii
0726-number-of-atoms
0822-unique-morse-code-words
1128-remove-all-adjacent-duplicates-in-string
1298-reverse-substrings-between-each-pair-of-parentheses
1720-crawler-log-folder

Stack

0020-valid-parentheses
0445-add-two-numbers-ii
0726-number-of-atoms
0943-sum-of-subarray-minimums
1128-remove-all-adjacent-duplicates-in-string
1228-minimum-cost-tree-from-leaf-values
1298-reverse-substrings-between-each-pair-of-parentheses
1720-crawler-log-folder
2846-robot-collisions

Tree

0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0404-sum-of-left-leaves
0975-range-sum-of-bst
2306-create-binary-tree-from-descriptions

Depth-First Search

0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum
0133-clone-graph
0207-course-schedule
0210-course-schedule-ii
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0365-water-and-jug-problem
0404-sum-of-left-leaves
0975-range-sum-of-bst

Binary Search Tree

0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0287-find-the-duplicate-number
0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii
0441-arranging-coins
0658-find-k-closest-elements
0975-range-sum-of-bst

Binary Tree

0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0404-sum-of-left-leaves
0975-range-sum-of-bst
2306-create-binary-tree-from-descriptions

Divide and Conquer

0948-sort-an-array
0954-maximum-sum-circular-subarray

Queue

0954-maximum-sum-circular-subarray
1951-find-the-winner-of-the-circular-game

Monotonic Queue

0954-maximum-sum-circular-subarray

Hash Table

0012-integer-to-roman
0133-clone-graph
0160-intersection-of-two-linked-lists
0208-implement-trie-prefix-tree
0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii
0522-longest-uncommon-subsequence-ii
0523-continuous-subarray-sum
0726-number-of-atoms
0822-unique-morse-code-words
1256-rank-transform-of-an-array
1741-sort-array-by-increasing-frequency
2306-create-binary-tree-from-descriptions
3420-find-occurrences-of-an-element-in-an-array

Two Pointers

0019-remove-nth-node-from-end-of-list
0028-find-the-index-of-the-first-occurrence-in-a-string
0160-intersection-of-two-linked-lists
0287-find-the-duplicate-number
0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii
0455-assign-cookies
0522-longest-uncommon-subsequence-ii
0658-find-k-closest-elements
0680-valid-palindrome-ii
0908-middle-of-the-linked-list

Sorting

0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii
0414-third-maximum-number
0455-assign-cookies
0522-longest-uncommon-subsequence-ii
0658-find-k-closest-elements
0726-number-of-atoms
0948-sort-an-array
1256-rank-transform-of-an-array
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1741-sort-array-by-increasing-frequency
2846-robot-collisions

Math

0012-integer-to-roman
0292-nim-game
0365-water-and-jug-problem
0441-arranging-coins
0445-add-two-numbers-ii
0453-minimum-moves-to-equal-array-elements
0492-construct-the-rectangle
0504-base-7
0507-perfect-number
0523-continuous-subarray-sum
1411-convert-binary-number-in-a-linked-list-to-integer
1642-water-bottles
1951-find-the-winner-of-the-circular-game
2645-pass-the-pillow

String Matching

0028-find-the-index-of-the-first-occurrence-in-a-string
0459-repeated-substring-pattern

Brainteaser

0292-nim-game

Game Theory

0292-nim-game

Linked List

0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0083-remove-duplicates-from-sorted-list
0092-reverse-linked-list-ii
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0160-intersection-of-two-linked-lists
0206-reverse-linked-list
0445-add-two-numbers-ii
0908-middle-of-the-linked-list
1411-convert-binary-number-in-a-linked-list-to-integer
2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points
2299-merge-nodes-in-between-zeros

Simulation

0495-teemo-attacking
1642-water-bottles
1803-average-waiting-time
1951-find-the-winner-of-the-circular-game
2299-merge-nodes-in-between-zeros
2645-pass-the-pillow
2846-robot-collisions

Backtracking

0131-palindrome-partitioning

Recursion

0021-merge-two-sorted-lists
0206-reverse-linked-list
1951-find-the-winner-of-the-circular-game

Breadth-First Search

0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0133-clone-graph
0207-course-schedule
0210-course-schedule-ii
0322-coin-change
0365-water-and-jug-problem
0404-sum-of-left-leaves

Matrix

1496-lucky-numbers-in-a-matrix

Design

0208-implement-trie-prefix-tree

Trie

0014-longest-common-prefix
0208-implement-trie-prefix-tree

Bit Manipulation

0287-find-the-duplicate-number

Heap (Priority Queue)

0658-find-k-closest-elements
0948-sort-an-array

Merge Sort

0948-sort-an-array

Bucket Sort

0948-sort-an-array

Radix Sort

0948-sort-an-array

Counting Sort

0948-sort-an-array

Sliding Window

0658-find-k-closest-elements

Monotonic Stack

0943-sum-of-subarray-minimums
1228-minimum-cost-tree-from-leaf-values

Database

0620-not-boring-movies
1161-project-employees-i
1811-fix-names-in-a-table

Graph

0133-clone-graph
0207-course-schedule
0210-course-schedule-ii

Topological Sort

0207-course-schedule
0210-course-schedule-ii

Prefix Sum

0523-continuous-subarray-sum

dsa_question-challenge's People

Contributors

vivekshahare04 avatar

Watchers

 avatar  avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.