335 posts found

[Medium] 1669. Merge In Between Linked Lists

You are given two linked lists: list1 and list2 of sizes n and m respectively. Remove list1’s nodes from the a-th node to the b-th node (0-indexed), and put list2...
leetcodemediumlinked-list

[Medium] 894. All Possible Full Binary Trees

Given an integer n, return a list of all possible full binary trees with n nodes. Each node has value 0. A full binary tree is a tree where every...
leetcodemediumtreerecursionmemoization

[Medium] 2365. Task Scheduler II

You are given a list of tasks to complete in order. Each day you can complete one task. After completing a task of type t, you must wait at least...
leetcodemediumhash-mapsimulation

[Medium] 382. Linked List Random Node

Given a singly linked list, return a random node’s value. Each node must have an equal probability of being chosen.
leetcodemediumlinked-listrandomized

[Medium] 1328. Break a Palindrome

Given a palindromic string palindrome, replace exactly one character to make it not a palindrome, and make the resulting string the lexicographically smallest possible. Return the result, or an empty...
leetcodemediumstringgreedy

[Medium] 2270. Number of Ways to Split Array

You are given a 0-indexed integer array nums of length n. A split at index i is valid if the sum of the first i + 1 elements is greater...
leetcodemediumprefix-sumarray

[Medium] 73. Set Matrix Zeroes

Given an m x n integer matrix, if an element is 0, set its entire row and column to 0. You must do it in place.
leetcodemediummatrixarray

[Medium] 261. Graph Valid Tree

Given n nodes labeled 0 to n-1 and a list of undirected edges, determine if these edges form a valid tree.
leetcodemediumgraphdsudfs

[Medium] 260. Single Number III

Given an integer array nums where exactly two elements appear once and all other elements appear exactly twice, find the two elements that appear only once. Return them in any...
leetcodemediumbit-manipulation

[Medium] 1870. Minimum Speed to Arrive on Time

You are given n train rides with distances dist[i]. Each train departs at an integer hour, so you must wait until the next whole hour to board the next train...
leetcodemediumbinary-search

[Medium] 1188. Design Bounded Blocking Queue

Implement a thread-safe bounded blocking queue with the following methods: BoundedBlockingQueue(int capacity) – initialize with max capacity void enqueue(int element) – add element to the back; blocks if the queue...
leetcodemediumconcurrencydesign

[Medium] 1115. Print FooBar Alternately

Two different threads will call foo and bar respectively. Design a mechanism so that "foobar" is printed n times by alternating between the two threads: foo always prints first, then...
leetcodemediumconcurrency

[Medium] 151. Reverse Words in a String

Given an input string s, reverse the order of the words. A word is a sequence of non-space characters. Words are separated by at least one space. Return a string...
leetcodemediumstringtwo-pointers

[Easy] 389. Find the Difference

You are given two strings s and t. String t is generated by randomly shuffling s and then adding one more letter at a random position. Return the letter that...
leetcodeeasybit-manipulationstring

[Easy] 1768. Merge Strings Alternately

Given two strings word1 and word2, merge them by adding letters in alternating order, starting with word1. If one string is longer, append the remaining letters at the end.
leetcodeeasystringtwo-pointers

[Medium] 1087. Brace Expansion

Given a string s representing a list of words, where each letter can be replaced by a group of letters inside braces {a,b,c}, return all possible words in sorted order....
leetcodemediumbacktrackingstring

[Medium] 918. Maximum Sum Circular Subarray

Given a circular integer array nums, find the maximum possible sum of a non-empty subarray. A circular subarray can wrap around the end back to the beginning.
leetcodemediumdparraykadane

[Medium] 341. Flatten Nested List Iterator

You are given a nested list of integers nestedList. Each element is either an integer or a list whose elements may also be integers or other lists. Implement an iterator...
leetcodemediumdesignstackiterator

[Medium] 134. Gas Station

There are n gas stations along a circular route. Station i has gas[i] units of gas. It costs cost[i] units to travel from station i to station i+1. Starting with...
leetcodemediumgreedyarray

[Medium] 713. Subarray Product Less Than K

Given an array of positive integers nums and an integer k, return the number of contiguous subarrays where the product of all elements is strictly less than k.
leetcodemediumsliding-windowtwo-pointers

[Medium] 1197. Minimum Knight Moves

In an infinite chess board with coordinates from -infinity to +infinity, a knight starts at (0, 0). Return the minimum number of moves to reach (x, y).
leetcodemediumbfs

[Medium] 1146. Snapshot Array

Implement a SnapshotArray that supports: SnapshotArray(int length) – initializes an array of the given length (all zeros) void set(index, val) – sets the element at index to val int snap()...
leetcodemediumdesignbinary-search

[Medium] 362. Design Hit Counter

Design a hit counter that counts the number of hits received in the past 5 minutes (300 seconds).
leetcodemediumdesignqueue

[Medium] 1448. Count Good Nodes in Binary Tree

Given a binary tree, a node X is good if there is no node with a value greater than X on the path from root to X. Return the number...
leetcodemediumtreedfsbfs

[Medium] 1376. Time Needed to Inform All Employees

A company has n employees numbered 0 to n-1. Each employee has exactly one direct manager given in manager[i], except the head of the company (manager[headID] == -1). An employee...
leetcodemediumtreedfsbfs

[Medium] 2406. Divide Intervals Into Minimum Number of Groups

You are given a 2D array intervals where intervals[i] = [left_i, right_i] represents the inclusive interval [left_i, right_i]. Divide the intervals into one or more groups such that no two...
leetcodemediumgreedyheapintervals

[Medium] 433. Minimum Genetic Mutation

A gene string is represented by an 8-character string of 'A', 'C', 'G', and 'T'. Given startGene, endGene, and a bank of valid gene strings, return the minimum number of...
leetcodemediumbfsstring

[Medium] 841. Keys and Rooms

There are n rooms labeled 0 to n-1. All rooms are locked except room 0. Each room contains a set of keys to other rooms. Given rooms[i] – the set...
leetcodemediumgraphdfsbfs

[Medium] 1091. Shortest Path in Binary Matrix

Given an n x n binary matrix grid, return the length of the shortest clear path from top-left (0,0) to bottom-right (n-1,n-1). A clear path consists of cells with value...
leetcodemediumgraphbfs

[Easy] 876. Middle of the Linked List

Given the head of a singly linked list, return the middle node. If there are two middle nodes, return the second middle node.
leetcodeeasylinked-listtwo-pointers

[Medium] 1202. Smallest String With Swaps

You are given a string s and an array of index pairs pairs where pairs[i] = [a, b] indicates you can swap the characters at indices a and b any...
leetcodemediumstringgraphdsu

[Medium] 1584. Min Cost to Connect All Points

You are given an array points where points[i] = [xi, yi] represents a point on the 2D plane. The cost to connect two points is the Manhattan distance: |xi -...
leetcodemediumgraphmstdsu

[Medium] 249. Group Shifted Strings

We can “shift” a string by shifting each character to its successive character (with z wrapping to a). For example, "abc" can be shifted to "bcd", …, "xyz", "yza", "zab"....
leetcodemediumstringhash

[Easy] 383. Ransom Note

Given two strings ransomNote and magazine, return true if ransomNote can be constructed by using the letters from magazine. Each letter in magazine can only be used once.
leetcodeeasystringhash

[Easy] 242. Valid Anagram

Given two strings s and t, return true if t is an anagram of s, and false otherwise. An anagram uses the exact same characters with the exact same frequencies....
leetcodeeasystringhash

[Easy] 219. Contains Duplicate II

Given an integer array nums and an integer k, return true if there are two distinct indices i and j such that nums[i] == nums[j] and abs(i - j) <=...
leetcodeeasyarrayhashsliding-window

[Easy] 217. Contains Duplicate

Given an integer array nums, return true if any value appears at least twice, and false if every element is distinct.
leetcodeeasyarrayhash

[Medium] 113. Path Sum II

Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where the sum of the node values equals targetSum. Each path should be returned as...
leetcodemediumtreedfsbacktracking

[Easy] 94. Binary Tree Inorder Traversal

Given the root of a binary tree, return the inorder traversal of its nodes’ values. Inorder visits: left → root → right.
leetcodeeasytreedfs

[Easy] 543. Diameter of Binary Tree

Given the root of a binary tree, return the length of the diameter of the tree. The diameter is the length of the longest path between any two nodes (measured...
leetcodeeasytreedfs

[Easy] 145. Binary Tree Postorder Traversal

Given the root of a binary tree, return the postorder traversal of its nodes’ values. Postorder visits: left → right → root.
leetcodeeasytreedfs

[Easy] 144. Binary Tree Preorder Traversal

Given the root of a binary tree, return the preorder traversal of its nodes’ values. Preorder visits: root → left → right.
leetcodeeasytreedfs

[Easy] 112. Path Sum

Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along the path...
leetcodeeasytreedfs

[Easy] 110. Balanced Binary Tree

Given a binary tree, determine if it is height-balanced. A height-balanced binary tree is one in which the depth of the two subtrees of every node never differs by more...
leetcodeeasytreedfs

[Medium] 78. Subsets

Given an integer array nums of unique elements, return all possible subsets (the power set). The solution must not contain duplicate subsets.
leetcodemediumbacktracking

[Medium] 523. Continuous Subarray Sum

Given an integer array nums and an integer k, return true if nums has a good subarray, i.e., a contiguous subarray of length at least 2 whose sum is a...
leetcodemediumprefix-sumhash

[Medium] 348. Design Tic-Tac-Toe

Design a Tic-Tac-Toe game that is played on an n x n board between two players. A move is guaranteed to be valid and is placed on an empty block....
leetcodemediumdesignmatrix

[Easy] 1275. Find Winner on a Tic Tac Toe Game

Tic-tac-toe is played on a 3 x 3 grid by two players A and B. Player A always plays first. Given an array moves where moves[i] = [row, col] indicates...
leetcodeeasysimulationmatrix

[Medium] 59. Spiral Matrix II

Given a positive integer n, generate an n × n matrix filled with elements from 1 to n² in spiral order (clockwise).
leetcodemediummatrixsimulation

[Medium] 43. Multiply Strings

Given two non-negative integers represented as strings num1 and num2, return their product as a string. You cannot convert the inputs to integers directly (numbers can be very large).
leetcodemediumstringmathsimulation

[Hard] 42. Trapping Rain Water

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
leetcodehardtwo-pointersstackdp

[Medium] 38. Count and Say

The count-and-say sequence is a sequence of digit strings defined by the recursive formula:
leetcodemediumstringsimulation

[Hard] 23. Merge k Sorted Lists

You are given an array of k linked lists, each sorted in ascending order. Merge all the linked lists into one sorted linked list and return it.
leetcodehardlinked-listdivide-and-conquerheap

[Easy] 893. Groups of Special-Equivalent Strings

Two strings are special-equivalent if you can swap characters at even indices among themselves and swap characters at odd indices among themselves, any number of times. Return the number of...
leetcodeeasystringhash

[Medium] 36. Valid Sudoku

Determine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:
leetcodemediummathbit-manipulation

[Medium] 29. Divide Two Integers

Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator. Return the quotient after dividing dividend by divisor. The integer division should truncate toward...
leetcodemediummathbit-manipulation

[Medium] 416. Partition Equal Subset Sum

Given an integer array nums, return true if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or false...
leetcodemediumdynamic-programming

[Medium] 155. Min Stack

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
leetcodemediumstack

[Hard] 44. Wildcard Matching

44. Wildcard Matching
leetcodehardstringdynamic-programminggreedytwo-pointers

[Hard] 1136. Parallel Courses

1136. Parallel Courses
leetcodehardgraphtopological-sortdfsdynamic-programming

[Medium] 209. Minimum Size Subarray Sum

209. Minimum Size Subarray Sum
leetcodemediumarraysliding-windowbinary-searchprefix-sum

[Medium] 354. Russian Doll Envelopes

354. Russian Doll Envelopes
leetcodemediumarraydynamic-programmingbinary-searchsorting

[Medium] 213. House Robber II

213. House Robber II
leetcodemediumarraydynamic-programming

[Medium] 622. Design Circular Queue

622. Design Circular Queue
leetcodemediumarraylinked-listdesignqueue

[Medium] 63. Unique Paths II

63. Unique Paths II
leetcodemediumarraydynamic-programmingmatrix

Algorithm Templates: Search

Minimal, copy-paste C++ for binary search, rotated arrays, 2D search, and answer-space search. Matches Data Structures lower/upper bound style.
leetcodetemplatessearchbinary-search

[Hard] 327. Count of Range Sum

327. Count of Range Sum
leetcodehardarraydivide-and-conquer

[Easy] 645. Set Mismatch

645. Set Mismatch
leetcodeeasyarrayhash-tablemath

[Easy] 409. Longest Palindrome

409. Longest Palindrome
leetcodeeasystringhash-tablegreedy

[Easy] 409. Longest Palindrome

409. Longest Palindrome
leetcodeeasystringhash-tablegreedy

[Hard] 732. My Calendar III

732. My Calendar III
leetcodehardarraybinary-searchdesignsegment-treeordered-set

[Medium] 729. My Calendar I

729. My Calendar I
leetcodemediumarraybinary-searchdesignordered-set

[Hard] 315. Count of Smaller Numbers After Self

315. Count of Smaller Numbers After Self
leetcodehardarraybinary-searchdivide-and-conquerbinary-indexed-treesegment-treemerge-sort

[Hard] 315. Count of Smaller Numbers After Self

315. Count of Smaller Numbers After Self
leetcodehardarraybinary-searchdivide-and-conquerbinary-indexed-treesegment-treemerge-sort

[Medium] 79. Word Search

79. Word Search
leetcodemediumarraybacktrackingmatrixdfs

[Hard] 51. N-Queens

51. N-Queens
leetcodehardarraybacktrackingrecursion

[Medium] 721. Accounts Merge

721. Accounts Merge
leetcodemediumarrayhash-tablestringunion-finddfs

[Medium] 64. Minimum Path Sum

64. Minimum Path Sum
leetcodemediumarraydynamic-programmingmatrix

[Hard] 1340. Jump Game V

1340. Jump Game V
leetcodehardarraydynamic-programmingdfsmemoization

Algorithm Templates: Heap

Minimal, copy-paste C++ for min/max heap, K-way merge, top K, and two heaps. See also Data Structures for heap patterns.
leetcodetemplatesheappriority-queue

Algorithm Templates: Greedy

Minimal, copy-paste C++ for interval scheduling, activity selection, and greedy on arrays/strings with sorting.
leetcodetemplatesgreedy

[Easy] 67. Add Binary

[Easy] 67. Add Binary
leetcodealgorithmeasycppstringmathbit-manipulationproblem-solving

[Medium] 146. LRU Cache

[Medium] 146. LRU Cache
leetcodealgorithmmediumcppdesigndata-structureshash-maplinked-listproblem-solving

[Medium] 146. LRU Cache

[Medium] 146. LRU Cache
leetcodealgorithmmediumcppdesigndata-structureshash-maplinked-listproblem-solving

[Medium] 647. Palindromic Substrings

[Medium] 647. Palindromic Substrings
leetcodealgorithmmediumcppstringtwo-pointersproblem-solving

[Medium] 56. Merge Intervals

[Medium] 56. Merge Intervals
leetcodealgorithmmediumcpparraysortingintervalproblem-solving

[Medium] 528. Random Pick with Weight

[Medium] 528. Random Pick with Weight
leetcodealgorithmmediumcppdesignbinary-searchprefix-sumproblem-solving

[Medium] 398. Random Pick Index

[Medium] 398. Random Pick Index
leetcodealgorithmmediumcpphash-tablereservoir-samplingproblem-solving

[Medium] 277. Find the Celebrity

[Medium] 277. Find the Celebrity
leetcodealgorithmmediumcppgraphtwo-pointersproblem-solving

[Hard] 489. Robot Room Cleaner

[Hard] 489. Robot Room Cleaner
leetcodealgorithmhardcppdfsbacktrackingproblem-solving

[Hard] 32. Longest Valid Parentheses

[Hard] 32. Longest Valid Parentheses
leetcodealgorithmhardcppstringdynamic-programmingstackproblem-solving

[Easy] 938. Range Sum of BST

[Easy] 938. Range Sum of BST
leetcodealgorithmeasycpptreebstdfsproblem-solving

Algorithm Templates: String Processing

Minimal, copy-paste C++ for sliding window, two pointers, string matching, manipulation, and parsing. See also Arrays & Strings for KMP and rolling hash.
leetcodetemplatesstring

Algorithm Templates: Queue

Minimal, copy-paste C++ for BFS queue, monotonic queue, priority queue, circular queue, and deque. See also Graph and Data Structures (monotonic queue).
leetcodetemplatesqueue

Algorithm Templates: Math & Bit Manipulation

Minimal, copy-paste C++ for bit operations, fast exponentiation, GCD/LCM, primes, and number theory. See also Math & Geometry.
leetcodetemplatesmathbit-manipulation

Algorithm Templates: Linked List

Minimal, copy-paste C++ for traversal, two pointers, dummy node, reversal, merge, cycle detection, and circular list.
leetcodetemplateslinked-list

Algorithm Templates: DFS

Minimal, copy-paste C++ for graph DFS, grid DFS, tree DFS, memoization, and iterative DFS. See also Graph and Backtracking.
leetcodetemplatesdfsgraph

Algorithm Templates: Data Structure Design

Minimal, copy-paste C++ for LRU/LFU cache, Trie, time-based key-value store, and common design patterns.
leetcodetemplatesdesign

Algorithm Templates: BFS

Minimal, copy-paste C++ for graph and grid BFS, multi-source BFS, shortest path, and level-order traversal. See also Graph for Dijkstra and 0-1 BFS.
leetcodetemplatesbfsgraph

Algorithm Templates: Backtracking

Minimal, copy-paste C++ for permutations, combinations, subsets, combination sum, grid pathfinding, and constraint satisfaction (N-Queens, Sudoku).
leetcodetemplatesbacktracking

Algorithm Templates: Array & Matrix

Minimal, copy-paste C++ for two pointers, sliding window, prefix sum, binary search, and matrix operations. See also Arrays & Strings and Search.
leetcodetemplatesarraymatrix

[Medium] 200. Number of Islands

[Medium] 200. Number of Islands
leetcodealgorithmmediumcppdfsgraphmatrixproblem-solving

[Medium] 969. Pancake Sorting

[Medium] 969. Pancake Sorting
leetcodealgorithmmediumcpparraysortingproblem-solving

[Medium] 49. Group Anagrams

[Medium] 49. Group Anagrams
leetcodealgorithmmediumcppstringhash-tableproblem-solving

[Medium] 45. Jump Game II

[Medium] 45. Jump Game II
leetcodealgorithmmediumcpparraygreedyproblem-solving

[Medium] 2. Add Two Numbers

[Medium] 2. Add Two Numbers
leetcodealgorithmmediumcpplinked-listrecursionproblem-solving

[Medium] 198. House Robber

[Medium] 198. House Robber
leetcodealgorithmmediumcppdynamic-programmingdpproblem-solving

[Easy] 509. Fibonacci Number

[Easy] 509. Fibonacci Number
leetcodealgorithmeasycppdynamic-programmingrecursionproblem-solving

[Medium] 146. LRU Cache

[Medium] 146. LRU Cache
leetcodealgorithmmediumcppdesigndata-structureshash-maplinked-listproblem-solving

[Hard] 460. LFU Cache

[Hard] 460. LFU Cache
leetcodealgorithmhardcppdesigndata-structureshash-maplinked-listproblem-solving

Algorithm Templates: Stack

Minimal, copy-paste C++ for parentheses matching, expression evaluation, nested structures, and monotonic stack.
leetcodetemplatesstackdata-structures

Algorithm Templates: Calculator

Minimal, copy-paste C++ for expression evaluation with +, −, ×, ÷ and parentheses. See also Stack for RPN and nested expressions.
leetcodetemplatescalculatorexpression-evaluation

[Medium] 224. Basic Calculator

[Medium] 224. Basic Calculator
leetcodealgorithmmediumcppstringstackexpression-evaluationproblem-solving

[Hard] 772. Basic Calculator III

[Hard] 772. Basic Calculator III
leetcodealgorithmhardcppstringstackrecursionexpression-evaluationproblem-solving

[Medium] 227. Basic Calculator II

[Medium] 227. Basic Calculator II
leetcodealgorithmmediumcppstringstackexpression-evaluationproblem-solving

[Medium] 324. Wiggle Sort II

[Medium] 324. Wiggle Sort II
leetcodealgorithmmediumcpparraysnth-elementthree-way-partitionindex-mappingproblem-solving

[Easy] 20. Valid Parentheses

[Easy] 20. Valid Parentheses
leetcodealgorithmeasycppstringstackproblem-solving

[Medium] 525. Contiguous Array

[Medium] 525. Contiguous Array
leetcodealgorithmmediumcpparrayshash-mapprefix-sumproblem-solving

[Hard] 480. Sliding Window Median

[Hard] 480. Sliding Window Median
leetcodealgorithmhardcpparraysmultisetsliding-windowtwo-heapsproblem-solving

[Hard] 239. Sliding Window Maximum

[Hard] 239. Sliding Window Maximum
leetcodealgorithmhardcpparraysdequesliding-windowmonotonic-queueproblem-solving

[Easy] 485. Max Consecutive Ones

[Easy] 485. Max Consecutive Ones
leetcodealgorithmeasycpparrayssliding-windowproblem-solving

[Medium] 18. 4Sum

[Medium] 18. 4Sum
leetcodealgorithmmediumcpparraystwo-pointerssortingproblem-solving

Algorithm Templates: Trees

Minimal, copy-paste C++ for tree traversals, LCA (binary lifting), segment tree, Fenwick tree, and HLD skeleton.
leetcodetemplatestrees

Algorithm Templates: Math & Geometry

Minimal, copy-paste C++ for combinatorics (nCk mod P) and 2D geometry primitives (cross product, point on segment).
leetcodetemplatesmathgeometry

Algorithm Templates: Graph

Minimal, copy-paste C++ for graph traversal, shortest paths, and topological sort. 0-indexed unless noted.
leetcodetemplatesgraph

Algorithm Templates: Data Structures & Core Algorithms

Minimal, copy-paste C++ templates for common structures and patterns. Each snippet is self-contained and uses standard indexing.
leetcodetemplatesdata-structuresalgorithms

Algorithm Templates: Arrays & Strings

Minimal, copy-paste C++ for sliding window, two pointers, prefix sum, KMP, Manacher, and rolling hash.
leetcodetemplatesarraysstrings

Algorithm Templates: Advanced Techniques

Minimal, copy-paste C++ for coordinate compression, meet-in-the-middle, Manacher, Z-algorithm, and bitwise trie (max XOR).
leetcodetemplatesadvanced

[Medium] 494. Target Sum

[Medium] 494. Target Sum
leetcodealgorithmmediumcppdynamic-programmingdpsubset-sumproblem-solving

[Medium] 912. Sort an Array

[Medium] 912. Sort an Array
leetcodealgorithmmediumcppsortingmerge-sortheap-sortcounting-sortdata-structuresdivide-conquerproblem-solving

[Medium] 96. Unique Binary Search Trees

[Medium] 96. Unique Binary Search Trees
leetcodealgorithmdynamic-programmingdata-structuresmathcatalan-numbersmediumcppbinary-search-treesproblem-solving

[Medium] 77. Combinations

[Medium] 77. Combinations
leetcodealgorithmbacktrackingdata-structuresrecursionmediumcppcombinationsdfsproblem-solving

[Medium] 89. Gray Code

[Medium] 89. Gray Code
leetcodealgorithmbacktrackingdata-structuresrecursionbit-manipulationmediumcppgray-codeproblem-solving

[Medium] 54. Spiral Matrix

[Medium] 54. Spiral Matrix
leetcodealgorithmmatrixdata-structuressimulationtraversalmediumcppspiral-matrixproblem-solving

[Medium] 50. Pow(x, n)

[Medium] 50. Pow(x, n)
leetcodealgorithmmathdata-structuresrecursionbit-manipulationmediumcpppowproblem-solving

[Medium] 62. Unique Paths

[Medium] 62. Unique Paths
leetcodealgorithmdynamic-programmingdata-structuresgridcombinatoricsmediumcppunique-pathsproblem-solving

[Hard] 25. Reverse Nodes in k-Group

[Hard] 25. Reverse Nodes in k-Group
leetcodealgorithmlinked-listrecursivedata-structurespointershardcppreverse-nodesk-grouprecursionproblem-solving

[Medium] 48. Rotate Image

[Medium] 48. Rotate Image
leetcodealgorithmmatrixdata-structures2d-arraytransformationmediumcpprotate-imagein-placeproblem-solving

[Medium] 1242. Web Crawler Multithreaded

[Medium] 1242. Web Crawler Multithreaded
leetcodealgorithmmultithreadingconcurrencydata-structuressynchronizationmediumcppweb-crawlerconcurrent-programmingproblem-solving

[Medium] 794. Valid Tic-Tac-Toe State

[Medium] 794. Valid Tic-Tac-Toe State
leetcodealgorithmsimulationdata-structuresgame-logicvalidationmediumcpptic-tac-toegame-validationproblem-solving

Meta‑Style LeetCode Question List

Meta‑Style LeetCode Question List
leetcodealgorithmmetainterview-preparationpractice-listfaangcoding-interviewproblem-solvingcompetitive-programmingdata-structures

Hash Table Mastery List

🧩 Hash Table Mastery List
leetcodealgorithmhashdata-structuresinterview-preparationpractice-listhash-tablehash-mapproblem-solvingcompetitive-programming

LeetCode Linked List Mastery List

LeetCode Linked List Mastery List
leetcodealgorithmlinked-listdata-structuresinterview-preparationpractice-listproblem-solvingcompetitive-programmingpointerstraversal

[Medium] 24. Swap Nodes in Pairs

[Medium] 24. Swap Nodes in Pairs
leetcodealgorithmlinked-listrecursivedata-structurespointersmediumcppswap-nodesrecursioniterativeproblem-solving

C++ STL Quick Reference for LeetCode

📚 C++ STL Quick Reference for LeetCode
leetcodealgorithmcppdata-structuresreferencecheat-sheetprogrammingstlcontainersiteratorsalgorithmscompetitive-programming
← Back to Home