Skip to content

Rk-Engineer/Leetcode-Problems

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

LeetCode Topics

Array

0001-two-sum
0046-permutations
0049-group-anagrams
0053-maximum-subarray
0074-search-a-2d-matrix
0150-evaluate-reverse-polish-notation
0215-kth-largest-element-in-an-array
0239-sliding-window-maximum
0268-missing-number
0347-top-k-frequent-elements
0503-next-greater-element-ii
0987-reveal-cards-in-increasing-order
1582-design-browser-history
2527-count-subarrays-with-fixed-bounds

Hash Table

0001-two-sum
0003-longest-substring-without-repeating-characters
0049-group-anagrams
0141-linked-list-cycle
0142-linked-list-cycle-ii
0268-missing-number
0347-top-k-frequent-elements
0931-maximum-frequency-stack

String

0003-longest-substring-without-repeating-characters
0020-valid-parentheses
0028-find-the-index-of-the-first-occurrence-in-a-string
0032-longest-valid-parentheses
0049-group-anagrams
0151-reverse-words-in-a-string
0224-basic-calculator
0678-valid-parenthesis-string
0957-minimum-add-to-make-parentheses-valid
1508-longest-happy-prefix
2221-check-if-a-parentheses-string-can-be-valid

Sorting

0049-group-anagrams
0215-kth-largest-element-in-an-array
0268-missing-number
0347-top-k-frequent-elements
0987-reveal-cards-in-increasing-order

Stack

0020-valid-parentheses
0032-longest-valid-parentheses
0145-binary-tree-postorder-traversal
0150-evaluate-reverse-polish-notation
0224-basic-calculator
0503-next-greater-element-ii
0678-valid-parenthesis-string
0931-maximum-frequency-stack
0957-minimum-add-to-make-parentheses-valid
1582-design-browser-history
2221-check-if-a-parentheses-string-can-be-valid
2573-remove-nodes-from-linked-list

Tree

0104-maximum-depth-of-binary-tree
0145-binary-tree-postorder-traversal

Depth-First Search

0104-maximum-depth-of-binary-tree
0145-binary-tree-postorder-traversal

Binary Tree

0104-maximum-depth-of-binary-tree
0145-binary-tree-postorder-traversal

Breadth-First Search

0104-maximum-depth-of-binary-tree

Linked List

0019-remove-nth-node-from-end-of-list
0023-merge-k-sorted-lists
0061-rotate-list
0141-linked-list-cycle
0142-linked-list-cycle-ii
0203-remove-linked-list-elements
0206-reverse-linked-list
0237-delete-node-in-a-linked-list
0908-middle-of-the-linked-list
1582-design-browser-history
2573-remove-nodes-from-linked-list

Recursion

0050-powx-n
0203-remove-linked-list-elements
0206-reverse-linked-list
0224-basic-calculator
2573-remove-nodes-from-linked-list

Monotonic Stack

0503-next-greater-element-ii
2573-remove-nodes-from-linked-list

Greedy

0678-valid-parenthesis-string
0957-minimum-add-to-make-parentheses-valid
2221-check-if-a-parentheses-string-can-be-valid

Math

0050-powx-n
0150-evaluate-reverse-polish-notation
0224-basic-calculator
0268-missing-number

Binary Search

0074-search-a-2d-matrix
0268-missing-number

Bit Manipulation

0268-missing-number

Matrix

0074-search-a-2d-matrix

Sliding Window

0003-longest-substring-without-repeating-characters
0239-sliding-window-maximum
2527-count-subarrays-with-fixed-bounds

Divide and Conquer

0023-merge-k-sorted-lists
0053-maximum-subarray
0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements

Dynamic Programming

0032-longest-valid-parentheses
0053-maximum-subarray
0678-valid-parenthesis-string

Rolling Hash

1508-longest-happy-prefix

String Matching

0028-find-the-index-of-the-first-occurrence-in-a-string
1508-longest-happy-prefix

Hash Function

1508-longest-happy-prefix

Two Pointers

0019-remove-nth-node-from-end-of-list
0028-find-the-index-of-the-first-occurrence-in-a-string
0061-rotate-list
0141-linked-list-cycle
0142-linked-list-cycle-ii
0151-reverse-words-in-a-string
0908-middle-of-the-linked-list

Queue

0239-sliding-window-maximum
0987-reveal-cards-in-increasing-order
2527-count-subarrays-with-fixed-bounds

Simulation

0987-reveal-cards-in-increasing-order

Monotonic Queue

0239-sliding-window-maximum
2527-count-subarrays-with-fixed-bounds

Heap (Priority Queue)

0023-merge-k-sorted-lists
0215-kth-largest-element-in-an-array
0239-sliding-window-maximum
0347-top-k-frequent-elements

Quickselect

0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements

Bucket Sort

0347-top-k-frequent-elements

Counting

0347-top-k-frequent-elements

Design

0931-maximum-frequency-stack
1582-design-browser-history

Ordered Set

0931-maximum-frequency-stack

Doubly-Linked List

1582-design-browser-history

Data Stream

1582-design-browser-history

Merge Sort

0023-merge-k-sorted-lists

Backtracking

0046-permutations

Database

0595-big-countries
1258-article-views-i

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages