Problem Detail: A simple game usually played by children, the game of War is played by two people using a standard deck of 52 playing cards. Initially, the deck is shuffled and all cards are dealt two the two players, so Read More …
Category: Uncategorized
[Solved]: Shortest sub-sequence of one string, that’s not a sub-sequence of another string
Problem Detail: Given two strings $x$ and $y$ over the alphabet ${A,C,G,T}$, I’m trying to determine a shortest string $z$ such that $z$ is a subsequence of $x$ and not a subsequence of $y$. Example: a shortest string that is a Read More …
[Solved]: Minimum distance between start and end by going through must visit points in a maze
Problem Detail: So, suppose i have a maze, which has a start point and an end point, marked with Orange and red respectively and my goal is to find the minimum distance between them. The blocked path is represented by black Read More …
[Solved]: Given two heuristic values how do I tell which one is admissible?
Problem Detail: I am given 2 list of admissible values for a graph, and the graph with the real cost to each of the nodes. Am I correct in thinking the way to see which one is admissible is add up Read More …
[Solved]: When is the minimum spanning tree for a graph not unique
Problem Detail: Given a weighted, undirected graph G: Which conditions must hold true so that there are multiple minimum spanning trees for G? I know that the MST is unique when all of the weights are distinct, but you can’t reverse Read More …
[Solved]: FFT-less $O(nlog n)$ algorithm for pairwise sums
Problem Detail: Suppose we are given $n$ distinct integers $a_1, a_2, dots, a_n$, such that $0 le a_i le kn$ for some constant $k gt 0$, and for all $i$. We are interested in finding the counts of all the possible Read More …
[Solved]: Can we make a problem harder than NP and coNP if they are not equal?
Problem Detail: Let us assume that $mathsf{NP} neq mathsf{coNP}$. Consider the graph 3-colorability problem. Since $mathsf{NP} neq mathsf{coNP}$ implies $mathsf{P} neq mathsf{NP}$ and 3-coloribility is $mathsf{NP}$-complete and its complement is $mathsf{coNP}$-complete , we have: 3-coloribility is not in $mathsf{P}$, i.e. there Read More …
[Solved]: Fast algorithm for interpolating data from polar coordinates to cartesian coordinates
Problem Detail: I have a set of solution nodes generated over a polar grid. I would like to convert / interpolate these solution nodes onto a Cartesian grid: That is, using the image above, for each node in the Cartesian grid Read More …
[Solved]: Running time of a nested loop with $sum i log i$ term
Problem Detail: So I have the following pseudo-code: Function(n): for (i = 4 to n^2): for (j = 5 to floor(3ilog(i))): // Some math that executes in constant time So far, I know that to find this i will be calculating Read More …
[Solved]: What are some problems which are easily solved by human brain but which would take more time computers?
Problem Detail: Are there any problems which can be solved by human brain in a very less time but a computer may take a lot of time or a computer could never solve it ? Asked By : avi Answered By : vzn Read More …
