Finexta InfoTech Interview Questions and Answers

The problem is to find the maximum number of fruits the Ninja can put in both baskets after satisfying given conditions.

• The Ninja can start at any tree and end at any tree, but cannot skip a tree.

• He can pick one fruit from each tree until he cannot, i.e., when he has to pick a fruit of the third type.

• The restriction is that each basket can have only one type of fruit.

• We need to find the maximum number of fruits that can be put in both baskets.

The problem requires sorting an array of 0s, 1s, and 2s in a single scan.

• Use three pointers to keep track of the positions of 0s, 1s, and 2s.

• Initialize the low pointer at the beginning of the array and the high pointer at the end.

• Iterate through the array using a current pointer and swap elements based on their values.

• Move the pointers accordingly until the array is sorted.

• The time complexity of this solution is O(N) as we only iterate through the array once.

TreeSet is a sorted set implementation in Java. WeakHashMap is a hash table-based Map implementation with weak keys.

• TreeSet is implemented using a tree structure and maintains elements in sorted order.

• WeakHashMap is a Map implementation that allows keys to be garbage collected when they are no longer referenced.

• WeakHashMap is useful for caching or memoization where the keys are not always needed and can be garbage collected to free up memory.

Comparable and Comparator are interfaces used for sorting objects in Java.

• Comparable interface is used to define the natural ordering of objects based on their own class.

• Comparator interface is used to define the ordering of objects based on a separate class.

• Comparable interface has compareTo() method while Comparator interface has compare() method.

• Comparable interface is implemented by the class whose objects need to be sorted while Comparator interface is implemented by a s...read more

Object-oriented programming concepts that help in organizing and structuring code.

• Encapsulation: Bundling data and methods that operate on the data into a single unit (class).

• Inheritance: Allowing a class to inherit properties and behavior from another class.

• Polymorphism: Ability to present the same interface for different data types.

• Abstraction: Hiding the complex implementation details and showing only the necessary features of an object.