Given a statement(string), the task is to check if that string contains any word which contains ‘a’ in it then print that word otherwise print no any word containing ‘a’ in the inputed string. Examples : Input: “W3Colleges provides excellent tutorials” Output: tutorials Input: “Python is fun” Output: no any word containing ‘a’ in the inputed string Input:… Read More »
Given an array containing n numbers. The problem is to find the length of the longest zigZag subarray such that every element in the subarray should be in form a < b > c < d > e < f.. Time Complexity should be O(n). Examples: Input : arr[] = {1, 5, 0, 4, 3} Output : 5… Read More »
Given a binary tree and two nodes a and b, the task is to print the maximum node value that lies in the path connecting the nodes a and b. If either of the two nodes are not present in the tree then print -1. Examples: Input : 1 / \ 2 3 / \ \ 4 5… Read More »
In a prison, there are N cells. The positions of the cells are given in an array. The Jailer has to place all the prisoners in the cells in an ordered manner such that minimum distance between any two prisoners is as large as possible. You have to find that distance. Note: The cells are in a straight… Read More »
Given an infinite stream of integers, find the k’th largest element at any point of time. It may be assumed that 1 <= k <= n. Example: Input: stream[] = {10, 20, 11, 70, 50, 40, 100, 5, …} k = 3 Output: {-1, -1, 10, 11, 20, 40, 50, 50, …} Extra space allowed is O(n).… Read More »
You are given two strings string1 and string2. Your task is to find length of longest consecutive occurrences of second string that occurs in first string. Examples: Input: string1=”AAACBBAAAA”, string2=”A” Output: 4 Explanation: We will get AAA(0:3) and then AAAA(6:10) as 4 is greater than 3, answer is 4. Input: string1=”ABBABBABBAAAA”, string2=”ABB” Output: 9 Approach: Initially find length… Read More »
Given an array of size N. The task is to find the maximum and the minimum element of the array using the minimum number of comparisons. Examples: Input : A[]={4,2,-1,5,0,-5,7,3,6} Output : Min Element -5 Max Element 7 Input : A[]={3,8,4,2,6,9} Output : Min Element 2 Max Element 9 Approach: The idea is to use the Two Pointer… Read More »
Given an array A[ ] of N segments find any point common to maximum number of segments and also find the number of segments which it is common to. The segments are in the form [L, R]. Examples: Input: N = 3, A[ ] = {{2, 4}, {-1, 3}, {-5, 1}} Output: Point 0 is common to 2… Read More »
You have to paint n boards of length {L1, L2, L3,…,Ln-1}. There are k painters available and each painter takes t time to paint 1 unit of board. You have to get this job done as soon as possible under the constraints that any painter will paint only contiguous sections of boards. 2 painters cannot share a board… Read More »
Given an array A[] and size of array is N. The task is to replace element of array A[] are in given range L to R both are included. Element replace by one another Array B[] size of N. Examples: Input : N = 8 A[] = { 3, 5, 3, 4, 9, 3, 1, 6 } B[]… Read More »
