Practice
JavaScriptData StructuresReactConcepts
Sign in

Data Structures in JS

0 of 120 solved0%
x

Arrays & Two-Pointers

0/7
  • ○Two Sum (Sorted Array)easy
  • ○Container With Most Watermedium
  • ○Palindrome Arrayeasy
  • ○Reverse In Placeeasy
  • ○Remove Duplicates from Sortedmedium
  • ○Product of Array Except Selfmedium
  • ○Trapping Rain Waterhard

Hash Maps / Sets

0/11
  • ○Frequency Countereasy
  • ○Two Sum (Unsorted)medium
  • ○First Non-Repeating Charactermedium
  • ○Pair With Sum Existseasy
  • ○Subarray Sum Equals Kmedium
  • ○Longest Consecutive Sequencehard
  • ○LRU Cachemedium
  • ○Design a HashMapmedium
  • ○LRU Cachehard
  • ○Design a HashSeteasy
  • ○Time-Based Key-Value Storemedium

Stacks

0/7
  • ○Valid Parentheseseasy
  • ○Evaluate Reverse Polish Notationmedium
  • ○Daily Temperaturesmedium
  • ○Next Greater Elementmedium
  • ○Largest Rectangle in Histogramhard
  • ○Design a Min Stackmedium
  • ○Design Browser Historymedium

Queues

0/7
  • ○Queue Order (FIFO)easy
  • ○Queue From Two Stacksmedium
  • ○Rotate a Queuemedium
  • ○First Unique Valuemedium
  • ○Queue Front After Operationsmedium
  • ○Implement Queue using Stacksmedium
  • ○Design Circular Queuemedium

Linked Lists

0/6
  • ○Linked List: Array to Listeasy
  • ○Reverse a Linked Listmedium
  • ○Remove Nth Node From Endmedium
  • ○Middle Nodeeasy
  • ○Merge Two Sorted Listsmedium
  • ○Design a Linked Listmedium

Trees

0/6
  • ○Max Deptheasy
  • ○Sum of Nodeseasy
  • ○Count Nodeseasy
  • ○Maximum Valuemedium
  • ○Invert a Treemedium
  • ○Inorder Traversalmedium

Binary Search Trees

0/6
  • ○BST Containseasy
  • ○BST Minimumeasy
  • ○BST Maximumeasy
  • ○Validate BSTmedium
  • ○BST Insertmedium
  • ○Lowest Common Ancestor of a BSTmedium

Graphs (BFS/DFS)

0/9
  • ○Number of Islandsmedium
  • ○Breadth-First Traversal Ordereasy
  • ○Depth-First Traversal Ordereasy
  • ○Count Connected Componentsmedium
  • ○Has Patheasy
  • ○Course Schedulemedium
  • ○Flood Filleasy
  • ○Number of Islandsmedium
  • ○Course Schedulemedium

Heaps

0/6
  • ○Is a Min-Heapmedium
  • ○Heap Insert (sift up)medium
  • ○Extract Min (sift down)hard
  • ○Build a Min-Heaphard
  • ○Top K Frequent Elementsmedium
  • ○Merge K Sorted Arrayshard

Tries

0/5
  • ○Word Exists in Triemedium
  • ○Prefix Existsmedium
  • ○Count Words With Prefixmedium
  • ○Count Distinct Wordsmedium
  • ○Implement a Triemedium

Sorting

0/7
  • ○Bubble Sorteasy
  • ○Merge Sortmedium
  • ○Quicksortmedium
  • ○Sort Colorsmedium
  • ○Merge Intervalsmedium
  • ○Kth Largest Elementmedium
  • ○Sort Colors (Dutch National Flag)medium

Searching

0/8
  • ○Binary Searcheasy
  • ○Search Insert Positioneasy
  • ○First and Last Positionmedium
  • ○Search in Rotated Sorted Arraymedium
  • ○Integer Square Rooteasy
  • ○Find Minimum in Rotated Sorted Arraymedium
  • ○Search in Rotated Sorted Arraymedium
  • ○Median of Two Sorted Arrayshard

Sliding Window

0/7
  • ○Maximum Sum Subarray of Size Keasy
  • ○Longest Substring Without Repeating Charactersmedium
  • ○Minimum Size Subarray Summedium
  • ○Longest Substring with At Most K Distinctmedium
  • ○Max Consecutive Ones IIImedium
  • ○Count Anagram Occurrencesmedium
  • ○Sliding Window Maximumhard

Dynamic Programming

0/12
  • ○Fibonacci Numbereasy
  • ○Climbing Stairseasy
  • ○Coin Changemedium
  • ○House Robbermedium
  • ○Longest Increasing Subsequencemedium
  • ○0/1 Knapsackmedium
  • ○Longest Common Subsequencemedium
  • ○Edit Distancehard
  • ○Unique Pathsmedium
  • ○Maximum Product Subarraymedium
  • ○Edit Distancehard
  • ○Coin Changemedium

Recursion & Backtracking

0/7
  • ○Factorialeasy
  • ○Power Functioneasy
  • ○Generate Subsetsmedium
  • ○Generate Permutationsmedium
  • ○Combinationsmedium
  • ○Generate Parenthesesmedium
  • ○N-Queens (Count Solutions)hard

Greedy

0/5
  • ○Best Time to Buy and Sell Stockeasy
  • ○Jump Gamemedium
  • ○Gas Stationmedium
  • ○Assign Cookieseasy
  • ○Non-overlapping Intervalsmedium

Bit Manipulation

0/4
  • ○Number of 1 Bitseasy
  • ○Single Numbereasy
  • ○Missing Numbereasy
  • ○Power of Twoeasy