Given an array of integers, in one operation a length x ( x >= 1 && x < n) can be chosen and the prefix of x length is sorted and then the suffix of (n – x) length is sorted independently of each other. The task is to check if the given array can be made unsorted… Read More »
You have a Restaurant and there is a Array nums [ ] of N people outside your restaurant. Your, waiter found out that for each valid i, the i-th person gave Ai Tip. Waiter treats person based on their Tip. I.e., a person with a higher Tip is always treated before any person with a lower Tip, waiter… Read More »
Given an array Arr[ ] that consists of N distinct integers. Check that if it is possible to sort the array in ascending order by reversing a specific segment of the array. If it is possible then print the starting and the ending position of the segment. If it is not possible then print -1. Given that the… Read More »
Given a weighted directed graph consisting of N nodes and M edges, the task is to find the first K shortest distances between two nodes A and B. (Assuming there are k distinct routes between nodes A and B). Example: Input: A=1 , B=4, K=3, Below is the graph :- Output: 4 4 7 Explanation : The shortest… Read More »
Given an array of positive integers, find the maximum product difference. The product difference between the two pairs is defined as taking the product of two pairs, followed by taking their difference. We have to maximize the product difference. Examples: Input: arr[] = {1, 4, 3, 6, 7, 0} Output: 39 Input: arr[] = {1, 3, 4, 2,… Read More »
You are given an binary array (i.e., containing 0 and 1 as a element). Here, 0 means a straight path and 1 means zigzag path. Add one to score when zero appears otherwise do nothing. Find the contiguous maximum score that you can achieve from binary array. Calculate all ways of unique arrangement that you can achieve same… Read More »
Given an array of N size denotes number of students and element of array denotes marks of students. Marks belongs between 1 to 100, where A[i] is less or equal to 32 denotes that student was fail and A[i] grater or equal to 91 denotes it was passed with hons. The task is to find minimum number of… Read More »
You are given n strings. You have to print them in lexicographical increasing order. Also, ensure that all of the strings should be distinct. Examples: Input: {“Aarav”, “Arjun”, “Rahul”, “Rishabh”, “Kunal”} Output: {“Aarav”, “Arjun”, “Kunal”, “Rahul”, “Rishabh”} Input: {“Vikram”, “Rajat”, “Abhishek”, “Suresh”, “Rajat”} Output: {“Abhishek”, “Rajat”, “Suresh”, “Vikram”} Recommended: What is Algorithm | Introduction to Algorithms Approach: Actually… Read More »
Given an array arr[] consisting of binary digits 0 and 1, determine the minimum number of swaps to push 0s towards one end and 1s to the other end of the array. Swapping of only adjacent elements is allowed. Examples: Input : arr={0, 1, 0, 1} Output : 1 We can get {0, 0, 1, 1} by swapping… Read More »
Given an array containing weights of gifts, and an integer representing maximum weight a box can contain. Each box carries at most 2 gifts at the same time, provided the sum of the weight of those gifts is at most limit of box. The task is to find the minimum number of boxes required to carry all gifts.… Read More »
