These are a collection of some interesting problems that I came up while reading CS. I'll be adding more.
- Given any 2 Rubik's Cube configurations, find out the minimum distance between them (open problem).
- Given any matrix, a legal move defined as performing a cyclic shift on a column or a row. Given two matrices with exactly the same elements, find the minimum legal moves required to obtain second matrix from the first one.
- There are M shoppers and C counters at hyper mall. kth shopper takes tk time to shop and bk time to complete the billing process. Given the values ti and bi, find an way to arrange the shoppers at the counters such that the last shopper leaves as early as possible.
- You are given the rates of stocks for the next 30 days and while you can buy and sell multiple times, you can only hold at most one position at any time. Determine the maximum profit which you can make.
- For any set K={a1,a2,…,an} of integers, SXOR(K)=a1 XOR a2 XOR … XOR an. Given any set S, find the set A such that A⊆S and SXOR(A) is maximal.
Published Problems
- Hunting in Von Neumann Universe
If you have any problem understanding the statement or require some input for a particular problem, please comment below.
#ComputerScience
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.