Let suppose that for a given set of natural numbers we found the subset with maximum possible elements sum. There is only one limitation for a subset: sum of the two smallest elements must be greater that the maximal element. Write a function to calculate the sum of that subset that maximizes elements sum according to limitation. Estimate algorithmic complexity of your solution.
Do I require sponsorship for work in US?
Data structures and stack programs
Take home coding challenge. It was an in-house written coding challenge about writing a class of an interface which needs to pass all of their tests.
What ORMs have you used, and can you explain their differences?
Collection Framework
SQL nested query
Questions on arrays and trees in the hackerrank test,
Experience with frameworks
Core fundamental concepts on Java/Spring, Javascript/React.
Viewing 5981 - 5990 interview questions