AlgoNinjutsu
  • Difficulty
    • Easy
    • Medium
    • Hard
  • Categories
    • Arrays
    • Strings
    • Linked Lists
    • Hashmaps
    • Hashsets
    • Graphs
    • Tries
    • Heaps
    • Trees
    • Stacks
    • Queues
    • DP
    • Backtracking
    • Math
    • Binary
    • Binary Search
    • DFS
    • BFS
    • Two Pointers
    • Sliding Window
    • Prefix Sum
    • Topological Sort
  • Random
  • All Questions

30 Questions




Candy

hard

arrays




First Missing Positive

hard

arrays




Longest Consecutive Sequence

hard

arrays


hashsets

Reverse Nodes in K-Group

hard

linked
lists





Edit Distance

hard

strings

aabb123



DP

Merge K Sorted Lists

hard

linked
lists



heaps

Find Minimum in Rotated Sorted Array II

hard

arrays


binary
search


Employee Free Time

hard

heaps


greedy

Word Ladder

hard

BFS




Trapping Rain Water

hard

arrays


two
pointers


Word Search II

hard

tries


back
tracking


Rearrange String K Distance Apart

hard

greedy


heaps

Sliding Window Maximum

hard

queues




N-Queens

hard

back
tracking





Find Median from Data Stream

hard

heaps




Shortest Path in a Grid with Obstacles Elimination

hard

BFS




Alien Dictionary

hard

topological
sort





Swim in Rising Water

hard

BFS


heaps

Subarrays with K Different Integers

hard

sliding
window



math

Word Break II

hard

back
tracking





Design Search Autocomplete System

hard

tries


heaps

Integer to English Words

hard

DFS


math

Median of Two Sorted Arrays

hard

binary
search





Concatenated Words

hard

DP


BFS

Binary Tree Maximum Path Sum

hard

trees


DP

Minimum Number of Refueling Stops

hard

greedy


heaps

Sudoku Solver

hard

back
tracking





Longest Increasing Path in a Matrix

hard

topological
sort





Reconstruct Itinerary

hard

graphs


back
tracking


Text Justification

hard

strings

aabb123



greedy








Share AlgoNinjutsu on social media
Connect with me