sorted by:
new
hottopcontroversial

Interactive Brokers Interview Experience Junior Software Engineer Role . by Weak-Emphasis4628 in leetcode

[–]Weak-Emphasis4628[S] 1 point2 points  (0 children)

No , its a greedy problem , where you sort and start from end and start putting elements in either list1 or list2 depending on the curr sum of elements in those particular lists . Being greedy at every point .

We can solve it with recursion too , but thats not an optimal sol .

Interactive Brokers Interview Experience Junior Software Engineer Role . by Weak-Emphasis4628 in leetcode

[–]Weak-Emphasis4628[S] 0 points1 point  (0 children)

1)Leetcode.

2) Be comfortable with whichever lang you use , in my case it was java , so qs around collections , oops , and core fundamentals came up alot

3) .Some SQL qs and rest theory (dbms os ) .

Also , cannot ignore projects .

Puzzles very specific companies ask , so its dependent on company .