Waste less time on Facebook — follow Brilliant.

CS Problems

These are a collection of some interesting problems that I came up while reading CS. I'll be adding more.

  1. Given any 2 Rubik's Cube configurations, find out the minimum distance between them (open problem).
  2. 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.
  3. There are \(M\) shoppers and \(C\) counters at hyper mall. \(k^\text{th}\) shopper takes \(t_k\) time to shop and \(b_k\) time to complete the billing process. Given the values \(t_i\) and \(b_i\), find an way to arrange the shoppers at the counters such that the last shopper leaves as early as possible.
  4. 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.
  5. For any set \(K = \{a_1, a_2, \dots, a_n\}\) of integers, \(\text{SXOR}(K) = a_1 \text{ XOR } a_2 \text{ XOR } \dots \text{ XOR } a_n\). Given any set \(S\), find the set \(A\) such that \(A \subseteq S\) and \(\text{SXOR}(A)\) is maximal.

Published Problems

  1. Hunting in Von Neumann Universe

If you have any problem understanding the statement or require some input for a particular problem, please comment below.

Note by Arulx Z
10 months, 1 week ago

No vote yet
1 vote


There are no comments in this discussion.


Problem Loading...

Note Loading...

Set Loading...