Matt Timmermans questions

Matt Timmermans answers

• Fastest way to determine if a uint64 has been "seen" already
• Minimum length subarray such that it has a subsequence with an xor sum of 0
• What is the complexity of path compression technique for disjoint set algorithm?
• Calculate the amount of water a tool described by an array can contain
• How to calculate the length of cycles in a graph using parallel algorithms in C?
• How to prove a problem is unsolvable in a certain Time Complexity?
• Rank of Partition with specific length
• bitwise array manipulation
• What does composition mean in the composition vs inheritance debate?
• What is the time complexity of retainAll and removeAll of ArrayList in Java.