someone12321

### Questions (70)

 7 Check if there is only one simple path in graph between nodes x and y` 6 Can we create faster sort algorithm than O(N log N) 5 Is it possible to reconstruct graph if we have given matrix of shortest pairs 5 Building segment tree without adding extra elements to its size 4 Prove that if we take all the edges in directed graph that are on some shortest path from 1 to N we will get a DAG

### Reputation (1,378)

 +20 Building segment tree without adding extra elements to its size +10 Find the first integer with exactly $n$ divisors +20 Is it possible to make data structure that will find MEX and support modification queries +10 Count minimum number of steps to destroy all blocks

 2 Time complexity of Prim's algorithm 1 I want to find the Time Complexity of the following code 1 In counting sort time complexity notation O(n+k), k is number of distinct elements? 0 How to find 5 repeated values in O(n) time? 0 What is the tightest asymptotic bound for this recurrence?

### Tags (51)

 3 algorithm-analysis × 2 1 sorting × 4 2 runtime-analysis 1 complexity-theory × 2 2 prims-algorithm 0 graphs × 18 2 adjacency-matrix 0 algorithms × 15 1 time-complexity × 6 0 counting × 11

### Bookmarks (0)

This user has no bookmarked questions.