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

29 Questions




Kth Largest Element in an Array

medium

arrays


heaps

Kth Largest Element in a Stream

easy

arrays


heaps

Merge K Sorted Lists

hard

linked
lists



heaps

Meeting Rooms II

medium

heaps




Kth Smallest Element in a Sorted Matrix

medium

heaps


binary
search


Furthest Building You Can Reach

medium

greedy


heaps

Find K Pairs with Smallest Sums

medium

heaps




Top K Frequent Elements

medium

heaps




Sort Characters By Frequency

medium

heaps




Reorganize String

medium

greedy


heaps

K Closest Points to Origin

medium

heaps




Employee Free Time

hard

heaps


greedy

Rearrange String K Distance Apart

hard

greedy


heaps

Find Median from Data Stream

hard

heaps




Top K Frequent Words

medium

heaps




Maximum Units on a Truck

easy

greedy


heaps

Minimum Cost to Connect Sticks

medium

greedy


heaps

Least Number of Unique Integers after K Removals

medium

heaps


greedy

Maximum Number of Events That Can Be Attended

medium

greedy


heaps

Connecting Cities With Minimum Cost

medium

graphs


heaps

Min Cost to Connect All Points

medium

arrays


heaps

Swim in Rising Water

hard

BFS


heaps

Path With Maximum Minimum Value

medium

BFS


heaps

Design Search Autocomplete System

hard

tries


heaps

Car Fleet

medium

greedy


heaps

Distant Barcodes

medium

greedy


heaps

Minimum Number of Refueling Stops

hard

greedy


heaps

Divide Array in Sets of K Consecutive Numbers

medium

hashmaps


heaps

Single-Threaded CPU

medium

greedy


heaps








Share AlgoNinjutsu on social media
Connect with me