kilimchoi / technical_interview_questions Goto Github PK

The first question asks us to find the most frequent integer in an array, but an array can have multiple integers with the same highest frequency e.g. [1 1 2 2 3]. What should we do in that case?

It seems that "moreEfficient" function is not working.
If I change the "main" to this:
if name == "main":
print testb
print pairsEqualToK(testb, 10)
print moreEfficient(testb, 10)

The output is:

~/GIT/tmp/technical_interview_questions/python_solutions>python PairsEqualToTen.py
[2, 5, 3, 2, -1, 5, 11, 7]
[(5, 5), (7, 3), (11, -1), (5, 5), (-1, 11), (3, 7)]
[(8, 2), (6, 4), (5, 5)]

i.e. wrong number for the moreEfficient algorithm.

As I said I like the idea, but the questions are a bit odd. Not all but some of them.

Instead to create a per code ("python" for example) directory, I would create a per question folder
where we can store notes in md format and multiple code examples. Notes might clarify the question.

Getting the original list of questions, we might need to index them. Like Q.01 ...

Beside the interview process this might become a list of interesting algorithms
and more interesting solutions. The important step might be to keep it code free.

I mean to be able to keep the questions without a coding constraint.

The issue!

We cannot track the question with the solution. We need an index.

Hey!

Did you use https://www.reddit.com/r/cscareerquestions/comments/20ahfq/heres_a_pretty_big_list_of_programming_interview/ to help create this list? If so you might want to credit /u/dandr01d or vise versa :)

I see your list has more questions regardless.

If anyone is interested in solutions, or assistance i have done a fair amount of these in js https://github.com/MichaelNeas/laboratory/tree/master/practice/BigListOfInterviewQs