User user1675999

user1675999

Member for 11 years, 2 months
Last seen more than 10 years ago

Network profile

Stats

1,027

reputation

136k

reached

answers

questions

Loading…

Communities

View all

Badges

View all badges

gold badges

Famous Question

× 5

Oct 26, 2021

silver badges

Notable Question

× 10

Oct 22, 2019
Yearling

× 5

Jun 15, 2021

bronze badges

Curious

Jul 2, 2014
Nice Question

× 3

Nov 12, 2018
Commentator

Nov 4, 2012

Top tags

View all tags

data-structures

Score

Posts

Posts %

binary-trees

Score

Posts

Posts %

np-complete

Score

Posts

Posts %

search-trees

Score

Posts

Posts %

complexity-theory

Score

Posts

Posts %

algorithms

Score

Posts

Posts %

Top posts

View all questions and answers

All Questions Answers

Score Newest

Bellman-Ford algorithm - Why can edges be updated out of order?

Nov 25, 2012

Proof that a randomly built binary search tree has logarithmic height

Oct 27, 2012

Modifying Dijkstra's algorithm for edge weights drawn from range $[1,…,K]$

Nov 21, 2012

Every simple undirected graph with more than $(n-1)(n-2)/2$ edges is connected

Nov 21, 2012

Maximum number of nodes with height h

Oct 31, 2012

What is an instance of NP complete problem?

Nov 29, 2012

Simple proof that circuit satisfiability problem is NP-Hard

Nov 30, 2012

Adjacent house , dynamic programming problem

Oct 25, 2012

What is the time complexity of calling successor $n$ times during tree traversal?

Oct 30, 2012

Why can't we use a hash tables for collision resolving in hash tables?

Oct 28, 2012