Skip to main content

Explore our questions

0 votes
1 answer
182 views

Finding Sum(F(i)) where F(i) = min(⌈ Ai / B1 ⌉ * C1, ⌈ Ai / B2 ⌉ * C2, ⌈ Ai / B3 ⌉ * C3, .... ,⌈ Ai / Bm ⌉ * Cm)

-1 votes
0 answers
13 views

Swap function in Time Complexity

2 votes
1 answer
49 views

DFS (Depth-first search) vs BFS (Breadth-first search) Space Optimizations

0 votes
1 answer
96 views

Two Questions About Fibonacci Heaps

2 votes
2 answers
3k views

Interval tree: find all intervals containing a given interval

0 votes
2 answers
147 views

Why finding the largest element in a min-heap using a comparison-based algorithm takes Ω(logn) time?

7 votes
3 answers
4k views

Find k nearest neighbors on a sphere

2 votes
0 answers
40 views

Online Pareto Front data structure for sparse high dimensional space

1 vote
0 answers
27 views

Datastructures for finding unifiable terms

0 votes
1 answer
59 views

Find a substring length $k$ with maximum occurrences

0 votes
1 answer
19 views

Unique Tree using Inorder & Postorder traversals

0 votes
1 answer
49 views

Trying to understand the time complexity of IDDFS

2 votes
1 answer
180 views

Design a data structure with constant insertion and sublinear range maximum query

0 votes
1 answer
56 views

Memory allocation algorithm over a growing storage

Browse more Questions