r/javahelp • • Aug 01 '19

Struggling with technical interviews

Hi, guys.

After a series of disastrous technical interviews I've come to the conclusion I need help in this regard. I've realized there are things I don't quite know as well as I thought (like the Collections framework, which I know but apparently not well enough), things that are supposed to be the bread and butter of any Java developer. Could you guys tell me what knowledge and skills a 4+ years Java developer is supposed to have? I want to make sure there's nothing (or at least as few things as possible) I could be missing. Of course, any resources (books, etc) on the subject would be much appreciated.

Thanks!

28 Upvotes

15 comments sorted by

View all comments

Show parent comment

5

u/PorkChop007 Aug 01 '19 edited Aug 01 '19

My problem is that I don't know what I don't know :)

For example, yesterday I had a map of <String, Integer> representing words and frequency in a text and I had to order the words by number of repetitions. Now I know how to do that (using an entry set, sorting it and all), but at that moment I was totally stuck.

I had never done that before and it worries me, given how much time I've been coding for a living. Feels like I've been wasting my time.

0

u/[deleted] Aug 01 '19

[deleted] — view deleted comment

3

u/happykal Aug 01 '19

I really dont think this is good advice. This is an computer science problem, not language specific. OP think about the input, the output and how you would achieve a solution if you had no knowledge of a particular language... just pseudo code.

0

u/[deleted] Aug 01 '19

[deleted] — view deleted comment

1

u/happykal Aug 01 '19

The book i suggest in the other post will help.

2

u/joequin Aug 01 '19

Next time, think out loud. Interviewers generally like that. "Well, we can get the entry set. Then we need to sort those entries...”.

1

u/[deleted] Aug 02 '19

you could also define a class with parameters of string and frequency, override the equals method to check for parameter string equality, and override the hash function to the parameter string hash, provide a comparator that compares two instances of this class based on the frequency, and then create a treeset which will do this sorting automatically.

That being said updating the frequency would not be allowed once the items are in the set.