Category: Uncategorized

Problem Detail: I am currently learning how randomised Hashing works. So, you have a class (aka family) $H$ of hash functions, each of which maps the universe $U$ to the hash table $N$. That class is called “strongly universal” or “pairwise Read More …

Problem Detail: We have two integers $z, k$ We form a sequence now of first z natural numbers. i.e. $1, 2, 3, 4, ldots z$. Now we have to find total number of permutations of this sequence such that the sum Read More …

Problem Detail: I have been cracking my head over the following question – You are given an undirected connected graph with an even number of edges. Half of the edges have weight less than C (possibly with repetitions), and the other Read More …

Problem Detail: I am studying game theory and I am wondering how many winning combinations are possible for Nim game? Suppose, stones = 500 and piles = 5. With these number, there are many initial game positions are possible. like [1, Read More …

Problem Detail: Had a question about the following: $$log (n+1) in O(log n)$$ Can the left side be simplified any further or do I need to just go ahead and find a c and n that hold? Asked By : TacoB0t Answered Read More …

Problem Detail: I need to find the substring that is from a 100,000 characters this substring must be most repeated and it need to be longest substring for example TYUFRIETEYM0SQZLHBCTN0W1KA9HELAT4LTQ14W7ZW484GSK1XTNOBJ2R6AMGW9KU36G7ITMPF315Y7ESYPR1XE2C1953J0DXUNBJLNTDG7IHS63854SGSS7YDEFJYSFP0DLL54GK6NUZ5UU5FRIETEYCPNGHIJOX23QOVSCBYHKE7HRIETEYV0H49I5SX9CW967CDGKX3TYCVNVBNCFGGDGDGDDFIIPGDSDVGDDSRGDGVCZAQRIOPKLMVFGCDGDTYGSDCBGDUSLVAQEFCGDGRIETEYDGDFG In above character set there is two substring one is GD Read More …

Problem Detail: I’ve just read about R-Trees: The key idea of the data structure is to group nearby objects and represent them with their minimum bounding rectangle in the next higher level of the tree; the “R” in R-tree is for Read More …

Problem Detail: I would like to know if it is possible that two functions $f(n), g(n)$ can exist such that both of the following conditions are met: $g(n) = o(1)$ $f(n-g(n)) neq Theta (f(n))$ I though I found $1/n$ and $1/n^2$ Read More …