Skip to main content
Share Your Experience: Take the 2024 Developer Survey
Navjot Singh's user avatar
Navjot Singh's user avatar
Navjot Singh's user avatar
Navjot Singh
  • Member for 6 years, 2 months
  • Last seen more than a month ago
  • Germany
16 votes
Accepted

What's the Big O runtime of a DFS word search through a matrix?

7 votes
Accepted

what is actually a circular array and representation

5 votes

Why is Binary Heap never unbalanced?

3 votes

How to solve Tower of Hanoi iteratively?

3 votes
Accepted

is a deterministic algorithm for breadth-first traversal possible (binary heap)

3 votes

Calculation of Inorder Traversal Complexity

2 votes
Accepted

Technique for converting recursive DP to iterative DP

1 vote
Accepted

Prooving by Pigeonhole principle

1 vote
Accepted

Minimizing sum of recursive pairwise sums

1 vote
Accepted

how to find a node that is known to everyone but doesn't know anyone?

1 vote
Accepted

A question about linked list

1 vote
Accepted

In Breadth-first search and depth-first search what is the purpose of visited flag

1 vote

Which one is the correct way to change functional notation while solving recurrence relation?

1 vote

Asymptotic bound of a heap's height

1 vote
Accepted

Proving Postorder Traversal's Time Complexity

1 vote

Big O notation for Sorting Algorithm

1 vote
Accepted

Master's theorem

1 vote

Can the pre-order traversal of two different trees be the same even though they are different?

0 votes

RSA cryptosystem: Encrypting a signed message

0 votes

Variation of knapsack problem

0 votes
Accepted

why not just one header in TCP/IP?

0 votes

Complexity of forming a min heap out of a given array with k inversions