for(int i = 0; i < n; i++) { for(int j = 0; j < i; j++){ // do swap stuff, constant time } } I read that single for loop is O(N) and trav
Given a self-indexing (not sure if this is the correct term) numpy array, for example: a = np.array([3, 2, 0, 1]) This represents this permutation (=> is
I'm a bit lost here, some help is welcomed. The idea is to find a matching substring from a list of strings. It doesn't has to be perfect. Let's explain this wi
What is meant by k-anonymity and l-diversity, and what is difference between them? This concept is used in the following IEEE paper.
In two choice hashing(with chaining), two random hash functions h1, h2 are selected to hash n keys to m positions. The process goes like this: Insert all n key
I have been stuck on a problem for quite a few days. My end goal is to perform preorder, inorder, and postorder traversals on a general tree. The problem I am h
Given a set of intervals, we can efficiently merge the overlapping intervals using this algorihtm: http://www.geeksforgeeks.org/merging-intervals/ However, if
I had one coding round where question statement was like this *You have a given number of friends and seating capacity of their cars now you need to find minimu
I have a set of prime numbers and I have to generate integers using only those prime factors in increasing order. For example, if the set is p = {2, 5} then my
I'm going through the question below. The sequence [0, 1, ..., N] has been jumbled, and the only clue you have for its order is an array representing whether e
I want to make a dynamic minimum spanning tree. I have an existing MS tree over n vertices and I add one more vertex and edges to all the existing vertices from
Summary Below is the full question (a bit complicated in its full form) here's a super simplified version (which is the heart of what I'm asking). If I told you
You probably know the problem with the two robots dropped on a line when you need to program them to meet. Two robots are dropped from an airplane and land
I have been searching a source code for generating combination using c++. I found some advanced codes for this but that is good for only specific number predefi
I just bombed an interview and made pretty much zero progress on my interview question. Given a number, find the next higher number which has the exact same se
So, I have this algorithm to calculate cross-section of 3D shape with plane given with normal vector. However, my current problem is, that the cross-section is
Mega Sena is Brazil's most famous lottery. The number set ranges from 1 to 60 and a single bet can contain each from 6 to 15 numbers selected (the more numbers
I'm stuck with a simple task. What I want to do is to transform Map<K,Set<V>> into the List<Map<K,V>> getting all possible combinations:
Given 2 strings s and t. I need to find for each substring in s edit distance(Levenshtein distance) to t. Actually I need to know for each i position in s what
I'm creating a falling sand game and would like to implement velocity so elements can travel in different directions at varying speeds. Games such as Noita use