Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

Loading LarpCode 150

coding drills

LarpCode 150

The curated 150. Clear them and you are ready for any interview.

coding drills

LarpCode 150

The curated 150. Clear them and you are ready for any interview.

Next up · Arrays & Hashing

Contains Duplicate

Overall progress · 0%

0 / 150

Contains Duplicateeasy Mock

Valid Anagrameasy Mock

Majority Elementeasy Mock

Warehouse Restock Pairseasy Mock

Group Anagramsmedium Mock

Top K Frequent Elementsmedium Mock

Product of Array Except Selfmedium Mock

Longest Consecutive Sequencemedium Mock

Valid Sudokumedium Mock

Subarray Sum Equals Kmedium Mock

Valid Palindromeeasy Mock

Widest Water Tankmedium Mock

Two Sum II - Sorted Inputmedium Mock

3Summedium Mock

Sort Colorsmedium Mock

3Sum Closestmedium Mock

Trapping Rain Waterhard Mock

Best Time to Buy and Sell Stockeasy Mock

Longest Distinct Runmedium Mock

Longest Repeating Character Replacementmedium Mock

Permutation in Stringmedium Mock

Minimum Size Subarray Summedium Mock

Minimum Window Substringhard Mock

Sliding Window Maximumhard Mock

Valid Parentheseseasy Mock

Evaluate Reverse Polish Notationmedium Mock

Car Fleetmedium Mock

Asteroid Collisionmedium Mock

Server Load Cooldownmedium Mock

Daily Temperaturesmedium Mock

Generate Parenthesesmedium Mock

Largest Rectangle in Histogramhard Mock

Binary Searcheasy Mock

Minimum Throughput to Drain the Queuemedium Mock

Find Minimum in Rotated Sorted Arraymedium Mock

Koko Eating Bananasmedium Mock

Search in Rotated Sorted Arraymedium Mock

Search a 2D Matrixmedium Mock

Find First and Last Positionmedium Mock

Median of Two Sorted Arrayshard Mock

Reverse a Linked Listeasy Mock

Merge Two Sorted Listseasy Mock

Palindrome Linked Listeasy Mock

Remove Nth Node From Endmedium Mock

Add Two Numbersmedium Mock

Reorder Listmedium Mock

Reverse Linked List IImedium Mock

Odd Even Linked Listmedium Mock

Find the Duplicate Numbermedium Mock

Swap Nodes in Pairsmedium Mock

Merge k Sorted Listshard Mock

Reverse Nodes in k-Grouphard Mock

Maximum Depth of a Binary Treeeasy Mock

Balanced Binary Treeeasy Mock

Diameter of Binary Treeeasy Mock

Subtree of Another Treeeasy Mock

Count Complete Tree Nodeseasy Mock

Path Sumeasy Mock

Invert Binary Treeeasy Mock

Same Treeeasy Mock

Binary Tree Level Order Traversalmedium Mock

Validate Binary Search Treemedium Mock

Kth Smallest Element in a BSTmedium Mock

Construct Binary Tree from Preorder and Inordermedium Mock

Binary Tree Right Side Viewmedium Mock

Count Good Nodes in Binary Treemedium Mock

Lowest Common Ancestor of a Binary Treemedium Mock

Lowest Common Ancestor of a BSTmedium Mock

Binary Tree Zigzag Level Order Traversalmedium Mock

Binary Tree Maximum Path Sumhard Mock

Count Words With Prefixmedium Mock

Word Search IIhard Mock

Last Stone Weighteasy Mock

Kth Strongest Signalmedium Mock

K Closest Points to Originmedium Mock

Kth Largest Element in an Arraymedium Mock

Task Schedulermedium Mock

Median From Data Streamhard Mock

Permutationsmedium Mock

Combination Summedium Mock

Subsets IImedium Mock

Combination Sum IImedium Mock

All Team Splitsmedium Mock

Word Searchmedium Mock

Letter Combinations of a Phone Numbermedium Mock

Palindrome Partitioningmedium Mock

N-Queens (Count Solutions)hard Mock

Count Connected Regionsmedium Mock

Max Area of Islandmedium Mock

Rotting Orangesmedium Mock

Pacific Atlantic Water Flowmedium Mock

Number of Islandsmedium Mock

Course Schedulemedium Mock

Number of Connected Componentsmedium Mock

Graph Valid Treemedium Mock

Course Schedule IImedium Mock

01 Matrixmedium Mock

Surrounded Regionsmedium Mock

Cheapest Flights Within K Stopsmedium Mock

Redundant Connectionmedium Mock

Min Cost to Connect All Pointsmedium Mock

Slowest Signal Arrivalhard Mock

Word Ladderhard Mock

Max Non-Adjacent Booth Profiteasy Mock

Climbing Stairseasy Mock

Min Cost Climbing Stairseasy Mock

Coin Changemedium Mock

House Robber IImedium Mock

Longest Increasing Subsequencemedium Mock

Palindromic Substringsmedium Mock

Maximum Product Subarraymedium Mock

Word Breakmedium Mock

Decode Waysmedium Mock

Longest Palindromic Substringmedium Mock

Partition Equal Subset Summedium Mock

Combination Sum IVmedium Mock

Grid Routes Avoiding Blocksmedium Mock

Longest Common Subsequencemedium Mock

Minimum Path Summedium Mock

Coin Change IImedium Mock

Edit Distancemedium Mock

Interleaving Stringmedium Mock

Unique Pathsmedium Mock

Maximal Squaremedium Mock

Longest Increasing Path in a Matrixhard Mock

Largest Number From Concatenationmedium Mock

Maximum Subarraymedium Mock

Jump Gamemedium Mock

Valid Parenthesis Stringmedium Mock

Gas Stationmedium Mock

Hand of Straightsmedium Mock

Partition Labelsmedium Mock

Jump Game IImedium Mock

Merge Booking Windowsmedium Mock

Non-overlapping Intervalsmedium Mock

Meeting Rooms IImedium Mock

Insert Intervalmedium Mock

Happy Numbereasy Mock

Plus Oneeasy Mock

Multiply Stringsmedium Mock

Trailing Zeros of a Factorialmedium Mock

Spiral Matrixmedium Mock

Rotate Imagemedium Mock

Set Matrix Zeroesmedium Mock

The Lone Readingeasy Mock

Counting Bitseasy Mock

Number of 1 Bitseasy Mock

Reverse Bitseasy Mock

Missing Numbereasy Mock

Sum of Two Integersmedium Mock