npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

@javadev/leetcode-in-typescript

v1.3.0

Published

TypeScript-based LeetCode algorithm problem solutions, regularly updated

Downloads

9

Vulnerabilities

Powered byPowered by Snyk
  • 0High
  • 0Medium
  • 0Low

Links

Git

Maintainers

javadevjavadev

Keywords

algorithmtypescriptmathleetcodealgorithm-competitionsleetcode-solutionsinterview-questionsdynamic-programmingalgorithms-and-data-structuresleetcode-typescript

Readme

LeetCode-in-TypeScript

npm version MIT License TypeScript CI Maintainability Rating

TypeScript-based LeetCode algorithm problem solutions, regularly updated.

"For coding interview preparation, LeetCode is one of the best online resource providing a rich library of more than 300 real coding interview questions for you to practice from using one of the 7 supported languages - C, C++, Java, Python, C#, JavaScript, Ruby."

Binary Search II

Day 1

| | | | | | |-|-|-|-|-|-

Day 2

| | | | | | |-|-|-|-|-|-

Day 3

| | | | | | |-|-|-|-|-|- | 0300 |Longest Increasing Subsequence| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n*log_n)_Space_O(n) | 57 | 93.75

Day 4

| | | | | | |-|-|-|-|-|-

Day 5

| | | | | | |-|-|-|-|-|- | 0287 |Find the Duplicate Number| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 60 | 98.11

Day 6

| | | | | | |-|-|-|-|-|-

Day 7

| | | | | | |-|-|-|-|-|-

Day 8

| | | | | | |-|-|-|-|-|- | 0240 |Search a 2D Matrix II| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 58 | 64.44

Day 9

| | | | | | |-|-|-|-|-|-

Day 10

| | | | | | |-|-|-|-|-|-

Day 11

| | | | | | |-|-|-|-|-|-

Day 12

| | | | | | |-|-|-|-|-|-

Day 13

| | | | | | |-|-|-|-|-|-

Day 14

| | | | | | |-|-|-|-|-|-

Day 15

| | | | | | |-|-|-|-|-|-

Day 16

| | | | | | |-|-|-|-|-|-

Day 17

| | | | | | |-|-|-|-|-|-

Day 18

| | | | | | |-|-|-|-|-|-

Day 19

| | | | | | |-|-|-|-|-|-

Day 20

| | | | | | |-|-|-|-|-|-

Dynamic Programming I

Day 1

| | | | | | |-|-|-|-|-|-

Day 2

| | | | | | |-|-|-|-|-|- | 0070 |Climbing Stairs| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 44 | 94.58

Day 3

| | | | | | |-|-|-|-|-|- | 0198 |House Robber| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 51 | 77.29

Day 4

| | | | | | |-|-|-|-|-|- | 0055 |Jump Game| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 58 | 91.95 | 0045 |Jump Game II| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 50 | 95.93

Day 5

| | | | | | |-|-|-|-|-|- | 0053 |Maximum Subarray| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 66 | 90.36

Day 6

| | | | | | |-|-|-|-|-|- | 0152 |Maximum Product Subarray| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 53 | 87.50

Day 7

| | | | | | |-|-|-|-|-|- | 0121 |Best Time to Buy and Sell Stock| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 56 | 99.56

Day 8

| | | | | | |-|-|-|-|-|-

Day 9

| | | | | | |-|-|-|-|-|- | 0139 |Word Break| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max*N)_Space_O(M+N+max) | 56 | 88.44 | 0042 |Trapping Rain Water| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 46 | 99.52

Day 10

| | | | | | |-|-|-|-|-|-

Day 11

| | | | | | |-|-|-|-|-|- | 0096 |Unique Binary Search Trees| Medium | Top_100_Liked_Questions, Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(1) | 45 | 96.00

Day 12

| | | | | | |-|-|-|-|-|-

Day 13

| | | | | | |-|-|-|-|-|-

Day 14

| | | | | | |-|-|-|-|-|-

Day 15

| | | | | | |-|-|-|-|-|- | 0062 |Unique Paths| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m*n)_Space_O(m*n) | 40 | 98.97

Day 16

| | | | | | |-|-|-|-|-|- | 0064 |Minimum Path Sum| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m*n)_Space_O(m*n) | 48 | 99.67 | 0221 |Maximal Square| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m*n)_Space_O(m*n) | 83 | 79.70

Day 17

| | | | | | |-|-|-|-|-|- | 0005 |Longest Palindromic Substring| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 68 | 95.34

Day 18

| | | | | | |-|-|-|-|-|- | 0300 |Longest Increasing Subsequence| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n*log_n)_Space_O(n) | 57 | 93.75

Day 19

| | | | | | |-|-|-|-|-|- | 1143 |Longest Common Subsequence| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n*m)_Space_O(n*m) | 94 | 80.56 | 0072 |Edit Distance| Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 68 | 95.20

Day 20

| | | | | | |-|-|-|-|-|- | 0322 |Coin Change| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m*n)_Space_O(amount) | 85 | 86.14

Day 21

| | | | | | |-|-|-|-|-|-

Programming Skills I

Day 1 Basic Data Type

| | | | | | |-|-|-|-|-|-

Day 2 Operator

| | | | | | |-|-|-|-|-|-

Day 3 Conditional Statements

| | | | | | |-|-|-|-|-|-

Day 4 Loop

| | | | | | |-|-|-|-|-|-

Day 5 Function

| | | | | | |-|-|-|-|-|-

Day 6 Array

| | | | | | |-|-|-|-|-|- | 0283 |Move Zeroes| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 71 | 91.63

Day 7 Array

| | | | | | |-|-|-|-|-|-

Day 8 String

| | | | | | |-|-|-|-|-|-

Day 9 String

| | | | | | |-|-|-|-|-|-

Day 10 Linked List and Tree

| | | | | | |-|-|-|-|-|- | 0104 |Maximum Depth of Binary Tree| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 51 | 97.14

Day 11 Containers and Libraries

| | | | | | |-|-|-|-|-|-

Day 12 Class and Object

| | | | | | |-|-|-|-|-|-

Programming Skills II

Day 1

| | | | | | |-|-|-|-|-|-

Day 2

| | | | | | |-|-|-|-|-|-

Day 3

| | | | | | |-|-|-|-|-|-

Day 4

| | | | | | |-|-|-|-|-|-

Day 5

| | | | | | |-|-|-|-|-|-

Day 6

| | | | | | |-|-|-|-|-|- | 0739 |Daily Temperatures| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(n) | 194 | 97.36

Day 7

| | | | | | |-|-|-|-|-|- | 0048 |Rotate Image| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 45 | 95.31

Day 8

| | | | | | |-|-|-|-|-|-

Day 9

| | | | | | |-|-|-|-|-|-

Day 10

| | | | | | |-|-|-|-|-|-

Day 11

| | | | | | |-|-|-|-|-|- | 0049 |Group Anagrams| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n*k_log_k)_Space_O(n) | 93 | 97.29

Day 12

| | | | | | |-|-|-|-|-|- | 0438 |Find All Anagrams in a String| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1) | 69 | 96.69

Day 13

| | | | | | |-|-|-|-|-|-

Day 14

| | | | | | |-|-|-|-|-|- | 0138 |Copy List with Random Pointer| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N) | 52 | 88.27

Day 15

| | | | | | |-|-|-|-|-|- | 0002 |Add Two Numbers| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)) | 92 | 77.86

Day 16

| | | | | | |-|-|-|-|-|-

Day 17

| | | | | | |-|-|-|-|-|-

Day 18

| | | | | | |-|-|-|-|-|- | 0155 |Min Stack| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 84 | 92.72

Day 19

| | | | | | |-|-|-|-|-|-

Day 20

| | | | | | |-|-|-|-|-|-

Graph Theory I

Day 1 Matrix Related Problems

| | | | | | |-|-|-|-|-|- | 0200 |Number of Islands| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M*N)_Space_O(M*N) | 61 | 96.71

Day 2 Matrix Related Problems

| | | | | | |-|-|-|-|-|-

Day 3 Matrix Related Problems

| | | | | | |-|-|-|-|-|-

Day 4 Matrix Related Problems

| | | | | | |-|-|-|-|-|-

Day 5 Matrix Related Problems

| | | | | | |-|-|-|-|-|-

Day 6 Matrix Related Problems

| | | | | | |-|-|-|-|-|-

Day 7 Standard Traversal

| | | | | | |-|-|-|-|-|-

Day 8 Standard Traversal

| | | | | | |-|-|-|-|-|-

Day 9 Standard Traversal

| | | | | | |-|-|-|-|-|-

Day 10 Standard Traversal

| | | | | | |-|-|-|-|-|-

Day 11 Breadth First Search

| | | | | | |-|-|-|-|-|-

Day 12 Breadth First Search

| | | | | | |-|-|-|-|-|-

Day 13 Graph Theory

| | | | | | |-|-|-|-|-|-

Day 14 Graph Theory

| | | | | | |-|-|-|-|-|-

SQL I

Day 1 Select

| | | | | | |-|-|-|-|-|-

Day 2 Select and Order

| | | | | | |-|-|-|-|-|-

Day 3 String Processing Functions

| | | | | | |-|-|-|-|-|-

Day 4 Union and Select

| | | | | | |-|-|-|-|-|-

Day 5 Union

| | | | | | |-|-|-|-|-|-

Day 6 Union

| | | | | | |-|-|-|-|-|-

Day 7 Function

| | | | | | |-|-|-|-|-|-

Day 8 Function

| | | | | | |-|-|-|-|-|-

Day 9 Control of Flow

| | | | | | |-|-|-|-|-|-

Day 10 Where

| | | | | | |-|-|-|-|-|-

Level 1

Day 1 Prefix Sum

| | | | | | |-|-|-|-|-|-

Day 2 String

| | | | | | |-|-|-|-|-|-

Day 3 Linked List

| | | | | | |-|-|-|-|-|- | 0021 |Merge Two Sorted Lists| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 59 | 86.77 | 0206 |Reverse Linked List| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 51 | 92.87

Day 4 Linked List

| | | | | | |-|-|-|-|-|- | 0142 |Linked List Cycle II| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 59 | 94.39

Day 5 Greedy

| | | | | | |-|-|-|-|-|- | 0121 |Best Time to Buy and Sell Stock| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 56 | 99.56

Day 6 Tree

| | | | | | |-|-|-|-|-|- | 0102 |Binary Tree Level Order Traversal| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 60 | 97.47

Day 7 Binary Search

| | | | | | |-|-|-|-|-|-

Day 8 Binary Search Tree

| | | | | | |-|-|-|-|-|- | 0098 |Validate Binary Search Tree| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 51 | 98.35

Day 9 Graph/BFS/DFS

| | | | | | |-|-|-|-|-|- | 0200 |Number of Islands| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M*N)_Space_O(M*N) | 61 | 96.71

Day 10 Dynamic Programming

| | | | | | |-|-|-|-|-|- | 0070 |Climbing Stairs| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 44 | 94.58

Day 11 Dynamic Programming

| | | | | | |-|-|-|-|-|- | 0062 |Unique Paths| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m*n)_Space_O(m*n) | 40 | 98.97

Day 12 Sliding Window/Two Pointer

| | | | | | |-|-|-|-|-|- | 0438 |Find All Anagrams in a String| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1) | 69 | 96.69

Day 13 Hashmap

| | | | | | |-|-|-|-|-|- | 0001 |Two Sum| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 54 | 91.72

Day 14 Stack

| | | | | | |-|-|-|-|-|- | 0394 |Decode String| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 51 | 81.02

Day 15 Heap

| | | | | | |-|-|-|-|-|-

Level 2

Day 1 Implementation/Simulation

| | | | | | |-|-|-|-|-|-

Day 2 String

| | | | | | |-|-|-|-|-|-

Day 3 Linked List

| | | | | | |-|-|-|-|-|- | 0019 |Remove Nth Node From End of List| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 54 | 87.87 | 0234 |Palindrome Linked List| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 96 | 95.67

Day 4 Linked List

| | | | | | |-|-|-|-|-|- | 0148 |Sort List| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(log(N))_Space_O(log(N)) | 141 | 97.14

Day 5 Greedy

| | | | | | |-|-|-|-|-|-

Day 6 Tree

| | | | | | |-|-|-|-|-|- | 0226 |Invert Binary Tree| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 52 | 81.65

Day 7 Tree

| | | | | | |-|-|-|-|-|- | 0543 |Diameter of Binary Tree| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 61 | 80.89 | 0437 |Path Sum III| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 68 | 86.71

Day 8 Binary Search

| | | | | | |-|-|-|-|-|- | 0074 |Search a 2D Matrix| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 45 | 96.82 | 0033 |Search in Rotated Sorted Array| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 43 | 98.54

Day 9 Binary Search Tree

| | | | | | |-|-|-|-|-|- | 0230 |Kth Smallest Element in a BST| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 54 | 97.22

Day 10 Graph/BFS/DFS

| | | | | | |-|-|-|-|-|-

Day 11 Graph/BFS/DFS

| | | | | | |-|-|-|-|-|-

Day 12 Dynamic Programming

| | | | | | |-|-|-|-|-|- | 0198 |House Robber| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 51 | 77.29 | 0322 |Coin Change| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m*n)_Space_O(amount) | 85 | 86.14

Day 13 Dynamic Programming

| | | | | | |-|-|-|-|-|- | 0416 |Partition Equal Subset Sum| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Big_O_Time_O(n*sums)_Space_O(n*sums) | 91 | 74.38 | 0152 |Maximum Product Subarray| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 53 | 87.50

Day 14 Sliding Window/Two Pointer

| | | | | | |-|-|-|-|-|- | 0003 |Longest Substring Without Repeating Characters| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1) | 65 | 90.77 | 0076 |Minimum Window Substring| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 82 | 82.17

Day 15 Tree

| | | | | | |-|-|-|-|-|- | 0101 |Symmetric Tree| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 49 | 98.54

Day 16 Design

| | | | | | |-|-|-|-|-|- | 0155 |Min Stack| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 84 | 92.72 | 0208 |Implement Trie (Prefix Tree)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 168 | 80.99

Day 17 Interval

| | | | | | |-|-|-|-|-|- | 0056 |Merge Intervals| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 84 | 92.06

Day 18 Stack

| | | | | | |-|-|-|-|-|-

Day 19 Union Find

| | | | | | |-|-|-|-|-|-

Day 20 Brute Force/Backtracking

| | | | | | |-|-|-|-|-|- | 0039 |Combination Sum| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 65 | 86.86 | 0046 |Permutations| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n*n!)_Space_O(n+n!) | 56 | 96.26

Udemy

Udemy Integers

| | | | | | |-|-|-|-|-|- | 0136 |Single Number| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 56 | 85.48 | 0007 |Reverse Integer| Medium | Top_Interview_Questions, Math | 56 | 95.68 | 0009 |Palindrome Number| Easy | Math | 137 | 88.64

Udemy Strings

| | | | | | |-|-|-|-|-|- | 0003 |Longest Substring Without Repeating Characters| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1) | 65 | 90.77 | 0020 |Valid Parentheses| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 50 | 95.90 | 0005 |Longest Palindromic Substring| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 68 | 95.34 | 0394 |Decode String| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 51 | 81.02 | 0049 |Group Anagrams| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n*k_log_k)_Space_O(n) | 93 | 97.29

Udemy Binary Search

| | | | | | |-|-|-|-|-|- | 0033 |Search in Rotated Sorted Array| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 43 | 98.54 | 0153 |Find Minimum in Rotated Sorted Array| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 42 | 98.87

Udemy Arrays

| | | | | | |-|-|-|-|-|- | 0121 |Best Time to Buy and Sell Stock| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 56 | 99.56 | 0283 |Move Zeroes| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 71 | 91.63 | 0001 |Two Sum| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 54 | 91.72 | 0189 |Rotate Array| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 75 | 97.25 | 0055 |Jump Game| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 58 | 91.95 | 0075 |Sort Colors| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 43 | 97.41 | 0238 |Product of Array Except Self| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 89 | 64.48 | 0041 |First Missing Positive| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 55 | 98.51 | 0239 |Sliding Window Maximum| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Big_O_Time_O(n*k)_Space_O(n+k) | 216 | 99.50

Udemy Two Pointers

| | | | | | |-|-|-|-|-|- | 0042 |Trapping Rain Water| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 46 | 99.52 | 0015 |3Sum| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n*log(n))_Space_O(n^2) | 148 | 92.62

Udemy Famous Algorithm

| | | | | | |-|-|-|-|-|- | 0053 |Maximum Subarray| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 66 | 90.36 | 0169 |Majority Element| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 50 | 96.16

Udemy Sorting Algorithms

| | | | | | |-|-|-|-|-|-

Udemy 2D Arrays/Matrix

| | | | | | |-|-|-|-|-|- | 0074 |Search a 2D Matrix| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 45 | 96.82 | 0048 |Rotate Image| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 45 | 95.31 | 0073 |Set Matrix Zeroes| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix, Big_O_Time_O(m*n)_Space_O(1) | 61 | 97.66 | 0056 |Merge Intervals| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 84 | 92.06

Udemy Linked List

| | | | | | |-|-|-|-|-|- | 0114 |Flatten Binary Tree to Linked List| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Big_O_Time_O(N)_Space_O(N) | 55 | 90.66 | 0024 |Swap Nodes in Pairs| Medium | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 59 | 62.67 | 0142 |Linked List Cycle II| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 59 | 94.39 | 0141 |Linked List Cycle| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 59 | 93.37 | 0206 |Reverse Linked List| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 51 | 92.87 | 0021 |Merge Two Sorted Lists| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 59 | 86.77 | 0160 |Intersection of Two Linked Lists| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 67 | 93.58 | 0234 |Palindrome Linked List| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 96 | 95.67 | 0138 |Copy List with Random Pointer| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N) | 52 | 88.27 | 0025 |Reverse Nodes in k-Group| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 74 | 66.83 | 0146 |LRU Cache| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 473 | 94.72

Udemy Tree Stack Queue

| | | | | | |-|-|-|-|-|- | 0094 |Binary Tree Inorder Traversal| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 45 | 97.30 | 0102 |Binary Tree Level Order Traversal| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 60 | 97.47 | 0543 |Diameter of Binary Tree| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 61 | 80.89 | 0226 |Invert Binary Tree| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 52 | 81.65 | 0104 |Maximum Depth of Binary Tree| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 51 | 97.14 | 0124 |Binary Tree Maximum Path Sum| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 61 | 96.73 | 0098 |Validate Binary Search Tree| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 51 | 98.35 | 0236 |Lowest Common Ancestor of a Binary Tree| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 59 | 96.11

Udemy Trie and Heap

| | | | | | |-|-|-|-|-|- | 0208 |Implement Trie (Prefix Tree)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 168 | 80.99

Udemy Graph

| | | | | | |-|-|-|-|-|- | 0200 |Number of Islands| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M*N)_Space_O(M*N) | 61 | 96.71

Udemy Dynamic Programming

| | | | | | |-|-|-|-|-|- | 0139 |Word Break| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max*N)_Space_O(M+N+max) | 56 | 88.44 | 0152 |Maximum Product Subarray| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 53 | 87.50 | 0198 |House Robber| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 51 | 77.29 | 0070 |Climbing Stairs| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 44 | 94.58 | 0064 |Minimum Path Sum| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m*n)_Space_O(m*n) | 48 | 99.67 | 0300 |Longest Increasing Subsequence| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n*log_n)_Space_O(n) | 57 | 93.75 | 1143 |Longest Common Subsequence| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n*m)_Space_O(n*m) | 94 | 80.56 | 0072 |Edit Distance| Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 68 | 95.20 | 0010 |Regular Expression Matching| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m*n)_Space_O(m*n) | 69 | 92.65

Udemy Backtracking/Recursion

| | | | | | |-|-|-|-|-|- | 0022 |Generate Parentheses| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 60 | 62.03 | 0039 |Combination Sum| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 65 | 86.86 | 0078 |Subsets| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_Space_O(n*2^n) | 50 | 94.61 | 0017 |Letter Combinations of a Phone Number| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 52 | 79.11 | 0046 |Permutations| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n*n!)_Space_O(n+n!) | 56 | 96.26

Udemy Bit Manipulation

| | | | | | |-|-|-|-|-|- | 0338 |Counting Bits| Easy | Top_100_Liked_Questions, Dynamic_Programming, Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 69 | 86.81

Udemy Design

| | | | | | |-|-|-|-|-|- | 0155 |Min Stack| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 84 | 92.72

Data Structure I

Day 1 Array

| | | | | | |-|-|-|-|-|- | 0053 |Maximum Subarray| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 66 | 90.36

Day 2 Array

| | | | | | |-|-|-|-|-|- | 0001 |Two Sum| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 54 | 91.72

Day 3 Array

| | | | | | |-|-|-|-|-|- | 0121 |Best Time to Buy and Sell Stock| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 56 | 99.56

Day 4 Array

| | | | | | |-|-|-|-|-|-

Day 5 Array

| | | | | | |-|-|-|-|-|- | 0074 |Search a 2D Matrix| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 45 | 96.82

Day 6 String

| | | | | | |-|-|-|-|-|-

Day 7 Linked List

| | | | | | |-|-|-|-|-|- | 0141 |Linked List Cycle| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 59 | 93.37 | 0021 |Merge Two Sorted Lists| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 59 | 86.77

Day 8 Linked List

| | | | | | |-|-|-|-|-|- | 0206 |Reverse Linked List| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 51 | 92.87

Day 9 Stack Queue

| | | | | | |-|-|-|-|-|- | 0020 |Valid Parentheses| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 50 | 95.90

Day 10 Tree

| | | | | | |-|-|-|-|-|- | 0094 |Binary Tree Inorder Traversal| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 45 | 97.30

Day 11 Tree

| | | | | | |-|-|-|-|-|- | 0102 |Binary Tree Level Order Traversal| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 60 | 97.47 | 0104 |Maximum Depth of Binary Tree| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 51 | 97.14 | 0101 |Symmetric Tree| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 49 | 98.54

Day 12 Tree

| | | | | | |-|-|-|-|-|- | 0226 |Invert Binary Tree| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 52 | 81.65

Day 13 Tree

| | | | | | |-|-|-|-|-|-

Day 14 Tree

| | | | | | |-|-|-|-|-|- | 0098 |Validate Binary Search Tree| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 51 | 98.35

Data Structure II

Day 1 Array

| | | | | | |-|-|-|-|-|- | 0136 |Single Number| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 56 | 85.48 | 0169 |Majority Element| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 50 | 96.16 | 0015 |3Sum| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n*log(n))_Space_O(n^2) | 148 | 92.62

Day 2 Array

| | | | | | |-|-|-|-|-|- | 0075 |Sort Colors| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 43 | 97.41 | 0056 |Merge Intervals| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 84 | 92.06

Day 3 Array

| | | | | | |-|-|-|-|-|- | 0048 |Rotate Image| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 45 | 95.31

Day 4 Array

| | | | | | |-|-|-|-|-|- | 0240 |Search a 2D Matrix II| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 58 | 64.44

Day 5 Array

| | | | | | |-|-|-|-|-|- | 0238 |Product of Array Except Self| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 89 | 64.48 | 0560 |Subarray Sum Equals K| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Big_O_Time_O(n)_Space_O(n) | 70 | 92.45

Day 6 String

| | | | | | |-|-|-|-|-|-

Day 7 String

| | | | | | |-|-|-|-|-|- | 0763 |Partition Labels| Medium | Top_100_Liked_Questions, String, Hash_Table, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 54 | 94.74

Day 8 String

| | | | | | |-|-|-|-|-|- | 0049 |Group Anagrams| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n*k_log_k)_Space_O(n) | 93 | 97.29

Day 9 String

| | | | | | |-|-|-|-|-|- | 0005 |Longest Palindromic Substring| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 68 | 95.34

Day 10 Linked List

| | | | | | |-|-|-|-|-|- | 0002 |Add Two Numbers| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)) | 92 | 77.86 | 0142 |Linked List Cycle II| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 59 | 94.39

Day 11 Linked List

| | | | | | |-|-|-|-|-|- | 0160 |Intersection of Two Linked Lists| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 67 | 93.58

Day 12 Linked List

| | | | | | |-|-|-|-|-|- | 0024 |Swap Nodes in Pairs| Medium | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 59 | 62.67

Day 13 Linked List

| | | | | | |-|-|-|-|-|- | 0025 |Reverse Nodes in k-Group| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 74 | 66.83

Day 14 Stack Queue

| | | | | | |-|-|-|-|-|- | 0155 |Min Stack| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 84 | 92.72

Day 15 Tree

| | | | | | |-|-|-|-|-|- | 0105 |Construct Binary Tree from Preorder and Inorder Traversal| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Big_O_Time_O(N)_Space_O(N) | 65 | 96.47

Day 16 Tree

| | | | | | |-|-|-|-|-|-

Day 17 Tree

| | | | | | |-|-|-|-|-|- | 0230 |Kth Smallest Element in a BST| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 54 | 97.22

Day 18 Tree

| | | | | | |-|-|-|-|-|- | 0236 |Lowest Common Ancestor of a Binary Tree| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 59 | 96.11

Day 19 Graph

| | | | | | |-|-|-|-|-|-

Day 20 Heap Priority Queue

| | | | | | |-|-|-|-|-|- | 0215 |Kth Largest Element in an Array| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Big_O_Time_O(n*log(n))_Space_O(log(n)) | 148 | 54.45 | 0347 |Top K Frequent Elements| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort, Big_O_Time_O(n*log(n))_Space_O(k) | 62 | 87.48

Day 21 Heap Priority Queue

| | | | | | |-|-|-|-|-|-

Algorithm I

Day 1 Binary Search

| | | | | | |-|-|-|-|-|- | 0035 |Search Insert Position| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 51 | 80.95

Day 2 Two Pointers

| | | | | | |-|-|-|-|-|- | 0189 |Rotate Array| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 75 | 97.25

Day 3 Two Pointers

| | | | | | |-|-|-|-|-|- | 0283 |Move Zeroes| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 71 | 91.63

Day 4 Two Pointers

| | | | | | |-|-|-|-|-|-

Day 5 Two Pointers

| | | | | | |-|-|-|-|-|- | 0019 |Remove Nth Node From End of List| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 54 | 87.87

Day 6 Sliding Window

| | | | | | |-|-|-|-|-|- | 0003 |Longest Substring Without Repeating Characters| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1) | 65 | 90.77

Day 7 Breadth First Search Depth First Search

| | | | | | |-|-|-|-|-|-

Day 8 Breadth First Search Depth First Search

| | | | | | |-|-|-|-|-|-

Day 9 Breadth First Search Depth First Search

| | | | | | |-|-|-|-|-|-

Day 10 Recursion Backtracking

| | | | | | |-|-|-|-|-|- | 0021 |Merge Two Sorted Lists| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 59 | 86.77 | 0206 |Reverse Linked List| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 51 | 92.87

Day 11 Recursion Backtracking

| | | | | | |-|-|-|-|-|- | 0046 |Permutations| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n*n!)_Space_O(n+n!) | 56 | 96.26

Day 12 Dynamic Programming

| | | | | | |-|-|-|-|-|- | 0070 |Climbing Stairs| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 44 | 94.58 | 0198 |House Robber| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 51 | 77.29

Day 13 Bit Manipulation

| | | | | | |-|-|-|-|-|-

Day 14 Bit Manipulation

| | | | | | |-|-|-|-|-|- | 0136 |Single Number| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 56 | 85.48

Algorithm II

Day 1 Binary Search

| | | | | | |-|-|-|-|-|- | 0034 |Find First and Last Position of Element in Sorted Array| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 45 | 98.05 | 0033 |Search in Rotated Sorted Array| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 43 | 98.54 | 0074 |Search a 2D Matrix| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 45 | 96.82

Day 2 Binary Search

| | | | | | |-|-|-|-|-|- | 0153 |Find Minimum in Rotated Sorted Array| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 42 | 98.87

Day 3 Two Pointers

| | | | | | |-|-|-|-|-|- | 0015 |3Sum| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n*log(n))_Space_O(n^2) | 148 | 92.62

Day 4 Two Pointers

| | | | | | |-|-|-|-|-|- | 0011 |Container With Most Water| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 57 | 98.23

Day 5 Sliding Window

| | | | | | |-|-|-|-|-|- | 0438 |Find All Anagrams in a String| Medium |