Given a string S, remove consecutive duplicates from it recursively.
Given a string S, remove consecutive duplicates from it recursively.
Given a string S, remove consecutive duplicates from it recursively.
GIVEN AN INPUT STRING S AND TWO CHARACTERS C1 AND C2, YOU NEED TO REPLACE EVERY OCCURRENCE OF CHARACTER C1 WITH CHARACTER C2 IN THE GIVEN STRING. DO THIS RECURSIVELY.
YOU HAVE BEEN GIVEN AN INTEGER ARRAY/LIST(ARR) OF SIZE N. IT HAS BEEN SORTED(IN INCREASING ORDER) AND THEN ROTATED BY SOME NUMBER ‘K’ IN THE CLOCKWISE DIRECTION. YOUR TASK IS TO WRITE A FUNCTION THAT RETURNS THE VALUE OF ‘K’, THAT MEANS, THE INDEX FROM WHICH THE ARRAY/LIST HAS BEEN ROTATED.
YOU HAVE BEEN GIVEN A RANDOM INTEGER ARRAY/LIST(ARR) OF SIZE N. WRITE A FUNCTION THAT ROTATES THE GIVEN ARRAY/LIST BY D ELEMENTS(TOWARDS THE LEFT).You have been given a random integer array/list(ARR) of size N. Write a function that rotates the given array/list by D elements(towards the left).
GIVEN A RANDOM INTEGER ARRAY AND A NUMBER X. FIND AND PRINT THE TRIPLETS OF ELEMENTS IN THE ARRAY THAT SUM TO X. WHILE PRINTING A TRIPLET, PRINT THE SMALLEST ELEMENT FIRST. THAT IS IF A VALID TRIPLET IS (6, 5, 10) PRINT “5 6 10”. THERE IS NO CONSTRAINT THAT OUT OF 5 TRIPLETS WHICH HAVE TO BE PRINTED ON 1ST LINE. YOU CAN PRINT TRIPLETS IN ANY ORDER, JUST BE CAREFUL ABOUT THE ORDER OF ELEMENTS IN A TRIPLET.
GIVEN A RANDOM INTEGER ARRAY A AND A NUMBER X. FIND AND PRINT THE PAIR OF ELEMENTS IN THE ARRAY THAT SUM TO X.Given a random integer array A and a number x. Find and print the pair of elements in the array which sum to x.
GIVEN TWO RANDOM INTEGER ARRAYS, PRINT THEIR INTERSECTION. THAT IS, PRINT ALL THE ELEMENTS THAT ARE PRESENT IN BOTH THE GIVEN ARRAYS. INPUT ARRAYS CAN CONTAIN DUPLICATE ELEMENTS.
Given an array of integers of size n which contains numbers from 0 to n – 2. Each number is present at least once. That is, if n = 5, numbers from 0 to 3 is present in the given array at least once and one number is present twice. You need to find and return that duplicate number present in the array.
GIVEN AN INTEGER ARRAY OF SIZE 2N + 1. IN THIS GIVEN ARRAY, N NUMBERS ARE PRESENT TWICE AND ONE NUMBER IS PRESENT ONLY ONCE IN THE ARRAY.
Given an integer array A of size N, check if the input array can be splitted in two parts such that – – Sum of both parts is equal
– All elements in the input, which are divisible by 5 should be in the same group.
– All elements in the input, which are divisible by 3 (but not divisible by 5) should be in another group.
– Elements that are neither divisible by 5 nor by 3, can be put in any group.