Programmer Analyst Trainee

You are given an array 'ARR' of integers of length N. Your task is to find the first missing positive integer in linear time and constant space. In other words, find the lowest positive integer that does not exist in the array. The array can have negative numbers as well.

For example, the input [3, 4, -1, 1] should give output 2 because it is the smallest positive number that is missing in the input array.

You are given a circular array of integers ‘NUMS’ of length ‘N’. You need to choose some elements from the array in such a way that between every pair of adjacent elements you have chosen at least one of them.

Choose the elements optimally and return the minimum sum of the chosen elements.

Example:

Input: ‘N’ = 5,  ‘NUMS’ = {1, 2, 3, 5, 2}.

Output: 6.

The indices of the chosen elements are [0, 2, 4], hence sum = 1 + 3 + 2 = 6.
Note: Some of the invalid ways to choose the elements are: 
Choose the elements with indices (0, 4), it is invalid because, among the pair of indices (1, 2) none of them were chosen. 
Choose the elements with indices (0, 2), it is invalid because, among the pair of indices (3, 4) none of them were chosen. 
Choose the elements with indices (1, 2), it is invalid because, among the pair of indices (0, 4) none of them were chosen. 

Find artist_id where group_name = 'ECSTASY'.

Create a search bar that shows a list of suggestions as the user types. The suggestions should match the input text and update dynamically.

Given an integer ‘n’, return first n Fibonacci numbers using a generator function.

Example:

Input: ‘n’ = 5

Output: 0 1 1 2 3

Explanation: First 5 Fibonacci numbers are: 0, 1, 1, 2, and 3.

Note:

You don't need to print anything. Just implement the given function.

Explain the four pillars of OOPS. (Learn)

Explain access modifiers in Java. (Learn)