Implement an algorithm to determine if a string has all unique characters Given an input string, we have to check if all characters in the string is unique and if there is a duplicate return false We can iterate through the array and consider one character at a time and…

Given an array return an element that repeats more than n/2 times / n/3 times (Full Question more than n/2 times, Full Question more than n/3 times) The task is to find elements that repeates more than n/2 times or n/3 times Both the questions mention that there would always…

Given an unsorted array, one has to return the length of the array subset with consecutive elements(Full Question) The first approach would be to iterate through the array and check for each element if the element+1 exists in the array if the element+1 number does exist we keep increasing a…

Given an array that contains n integers that could be positive, negative, or zero, return the product returned by the subarray with the maximum product (Full Question) The problem is similar to the Maximum sum Subarray Problem Brute force would be to iterate through the array with two pointers i…

Given an array of positive integers of size n, where each value represents the number of chocolates in a packet. Each packet can have a variable number of chocolates. …

Given an array of size n, return the array with the index of the pair that would give the sum k. …

You are given an integer array nums and an integer k. The score of nums is the difference between the maximum and minimum elements in nums. Return the minimum score of nums after changing the values at each index. (Question 1, Question 2) The first question is to add and…

Given an array of non-negative integers nums, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps. (Full Question) The number of…

Given an array of size n with negative and positive elements, the task is to place all negative elements to the end keeping all positive elements in the beginning(Full Question) Take two pointers start and last initially pointing to 0 and n-1 respectively We come across four scenarios while we…