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

28 Questions




Generate Parentheses

medium

strings

aabb123



back
tracking


Word Search

medium

back
tracking





Letter Case Permutation

medium

strings

aabb123



back
tracking


Subsets

medium

arrays


back
tracking


Subsets II

medium

arrays


back
tracking


Permutations

medium

arrays


back
tracking


Permutations II

medium

arrays


back
tracking


Beautiful Arrangement

medium

back
tracking





Generalized Abbreviation

medium

arrays


back
tracking


Combinations

medium

back
tracking





Combination Sum

medium

arrays


back
tracking


Combination Sum II

medium

arrays


back
tracking


Combination Sum III

medium

back
tracking





Letter Combinations of a Phone Number

medium

strings

aabb123



back
tracking


Palindrome Partitioning

medium

strings

aabb123



back
tracking


Path Sum II

medium

trees


back
tracking


Path Sum III

medium

trees


back
tracking


Partition to K Equal Sum Subsets

medium

back
tracking





Word Search II

hard

tries


back
tracking


N-Queens

hard

back
tracking





Restore IP Addresses

medium

strings

aabb123



back
tracking


Word Break II

hard

back
tracking





All Paths From Source to Target

medium

back
tracking





Path with Maximum Gold

medium

back
tracking





Matchsticks to Square

medium

back
tracking





Sum Root to Leaf Numbers

medium

trees


back
tracking


Sudoku Solver

hard

back
tracking





Reconstruct Itinerary

hard

graphs


back
tracking









Share AlgoNinjutsu on social media
Connect with me