Hey, I am playing with some CS use case and I need a little bit help or confirmation.

I am having a list of data entities which can be compared between each other by multiple criteria. What I need is to expose an interface that allows you to get the top entities by a single or multiple criteria (all or a subset).

In my current prove of concept, the data entities live in a hash table and I have multiple priority queues in the form of balanced binary trees for each individual criteria. For simplicity, lets say that each entity exists in each priority queue. So far so good, I know the top entities for each individual criteria.

What I am still missing is a way to get the top results by multiple criteria. I am thinking about a weight function that can be used to compute a new single priority queue where the input is multiple priority queues (representing the different criteria).

The way I was considering to "merge" the priority queues is by computing a normalized weight for each criteria and for each entity, i.e. multiple weight per entity for each of the criteria. Then to compute a single normalized weight for each entity as a function of the individual entity weights.

It would probably work if I handle the corner cases like 0 weight and such but for some reason it doesn't feel like the right approach and rather like I am reinventing the wheel for an already known issue.

Do you have some better ideas on what structure I could use for prioritizing entities by multiple criteria? Or if the multiple priority queues approach is fine, do you have a better idea how I could merge them info a single priority queue when each entity exists in each of the individual queues?

Hello everyone ,I am a cs undergraduate .I am looking for a partner in Competitive Programming in C++ to solve codeforces problems together and enhance problem solving skills together .If anyone is interested message me or comment below . Language of discussion will be English.

J'ai besoin de quelqun qui est bon avec les structures de donnees et algorithme.

Binary search tree, AVL, graphes, dictionnary, complexity algorithms, pile file, min heap, max heap.

Hmu as soon as possible. Speaking french is required.

Thank you

J'ai besoin de quelqun qui est bon avec les structures de donnees et algorithme.

Binary search tree, AVL, graphes, dictionnary, complexity algorithms, pile file, min heap, max heap.

Hmu as soon as possible.

Thank you

Adjacency List or Adjacency matrix which one to follow for solving problems ? Any suggestions are welcomed

https://www.wellhow.online/2021/12/find-largest-second-largest-and-average.html

https://www.wellhow.online/2021/12/find-kth-smallest-element-in-cross.html

Take this array challenge

https://www.wellhow.online/2021/12/array-challenge.html

https://www.wellhow.online/2021/12/well-how-to-detect-cycle-in-given.html

This is a list of 4 5 questions that were asked in some of the companies lately

Have a look and see if you can solve these

https://www.wellhow.online/search/label/practice

Thanks

Can you solve this?

https://www.wellhow.online/2021/11/well-how-to-remove-duplicates-from.html?m=1

Thanks

Checkout here

https://www.wellhow.online/2021/11/well-how-to-find-n-th-node-from-end-of.html

Also do let me know if you want to cover specific stuff