Given a huge list of Investors with id,
name, net worth, etc... Write an efficient
code for printing top k investors in the
list.
For example, if given list is - [Investor
A: (networth:20L), Investor B:
(networth:25L), Investor C:(networth: 10L),
Investor D:(networth:50L). Investor E:
(networth:30L)] and you are asked for the
largest 3 investors i.e., k = 3 then your
program should display Investors D, E and
B data.
Note: Using OOPs concept, proper data
structures, comments, logs, design
patterns or any other best practices to
make a readable and mantainable code would
be used for evaluation.
please replay
Answers
Answered by
1
Answer:
i cant understand your question , sorry.
Explanation:
plz follow me , and like my answer , and mark my answer as a brainlyist.
Answered by
0
Answer:
I can't understand your question.
Similar questions