Try it on GfG Practice Given a large number (represented as a string) which has to divide by another number (represented as int data type). The large number can be very large which does not even fit in long long in C++. The task is to find the division of these numbers. Examples: Input : number =…

Given n binary strings, the task is to find their sum which is also a binary string. Examples: Input: arr[] = ["1101", "111"] Output: "10100" Explanation: Input : arr[] = ["1", "10", "11"] Output : "110" [Approach] Bit-by-bit addition with carry A simple idea is to initialise res = "0" and preform…

Try it on GfG Practice Given a string s, the task is to find the longest substring which is a palindrome. If there are multiple answers, then return the first appearing substring. Examples: Input: s = "forgeeksskeegfor" Output: "geeksskeeg" Explanation: There are several possible palindromic…

Try it on GfG Practice Given a positive integer n, the task is to count all possible distinct binary strings of length n such that there are no consecutive 1's. Examples: Input: n = 3 Output: 5 Explanation: 5 strings are ("000", "001", "010", "100", "101"). Input: n = 2 Output: 3 Explanation: 3…

Given a string of lower alphabet characters, count total substring of this string which are anagram to each other. Examples: Input : str = “xyyx” Output : 4 Total substrings of this string which are anagram to each other are 4 which can be enumerated as, {“x”, “x”}, {"y", "y"}, {“xy”, “yx”}, {“xyy”,…

Given a string s, we create an infinitely repeating string t by appending s to itself multiple times. We are given a 2D array queries[][], where each row contains two indices i and j. Or we can say, each row queries[k] contains two indices queries[k][0] = i and queries[k][1] = j. For each query, we…

Try it on GfG Practice An encoded string s is given, the task is to decode it. See examples to understand the pattern in which string is encoded . Examples: Input: s = "3[b2[ca]]" Output: "bcacabcacabcaca" Explanation: 1. inner substring "2[ca]" breakdown into "caca". 2. now , new string becomes…

Try it on GfG Practice Given an array arr[] of size n, where arr[i] denotes the number of characters in one word. Let k be the limit on the number of characters that can be put in one line (line width). Put line breaks in the given sequence such that the lines are printed neatly. Assume that the…

Try it on GfG Practice Given an expression with only '}' and '{'. The expression may not be balanced. Find minimum number of bracket reversals to make the expression balanced. Examples: Input: s = "}{{}}{{{" Output: 3 Explanation: We need to reverse minimum 3 brackets to make "{{{}}{}}". Input: s =…

Given a string s, break s such that every substring of the partition can be found in the dictionary. Return the minimum break needed. Examples: Given a dictionary ["Cat", "Mat", "Ca", "tM", "at", "C", "Dog", "og", "Do"] Input : Pattern "CatMat" Output : 1 Explanation: we can break the sentences in…

Try it on GfG Practice Given two strings s1 and s2 of equal length and containing lowercase characters, the task is to find the minimum number of manipulations required to make two strings anagram without deleting any character. In each modification, we can change any one character from either…

Try it on GfG Practice Given two strings in lowercase, the task is to make them anagrams. The only allowed operation is to remove a character from any string. Find the minimum number of characters to be deleted to make both the strings anagram. Two strings are called anagrams of each other if one of…

Try it on GfG Practice Given an array of strings words[], sorted in an alien language. Your task is to determine the correct order of letters in this alien language based on the given words. If the order is valid, return a string containing the unique letters in lexicographically increasing order as…

Try it on GfG Practice Given an array of strings, find if the given strings can be chained to form a circle. A string X can be put before another string Y in a circle if the last character of X is the same as the first character of Y. Examples: Input: arr[] = {"geek", "king"} Output: Yes, the given…

Given a string, we need to find the minimum number of rotations required to get the same string. Examples: Input : s = "geeks" Output : 5 Input : s = "aaaa" Output : 1 The idea is based on below post. A Program to check if strings are rotations of each other or not Step 1 : Initialize result = 0…

Try it on GfG Practice Given two strings consisting of lowercase characters, the task is to find the number of ways to insert a character in the first string such that the length of LCS of both strings increases by one. Examples: Input : s1 = “abab”, s2 = “abc” Output : 3 Explanation: LCS length of…

Given a string s and an integer k. The task is to perform a mirror transformation on the substring starting from the k-th position to the end of the string. In this transformation, each letter is replaced by its corresponding mirrored letter in the English alphabet ('a' -> 'z', 'b' -> 'y', 'c' ->…

Try it on GfG Practice Given a 5x5 grid containing alphabets from A-Z and a string str. The task is to find the shortest path to type all characters of str in order. The starting position is at A (top-left corner). Rules for Movement: You can move left, right, up, or down while staying inside the…

Try it on GfG Practice Auxiliary Given a pattern containing only I's and D's. I for increasing and D for decreasing. Device an algorithm to print the minimum number following that pattern. Digits from 1-9 and digits can’t repeat. Examples: Input: D Output: 21 Input: I Output: 12 Input: DD Output:…

Try it on GfG Practice Given a sentence in the form of a string, convert it into its equivalent mobile numeric keypad sequence. Examples : Input: GEEKSFORGEEKS Output: 4333355777733366677743333557777 Explanation: For obtaining a number, we need to press a number corresponding to that character for a…

Given a string str, find the length of the longest balanced subsequence in it. A balanced string is defined as a string sequence that can form a valid balanced expression, consisting of matching opening and closing brackets. A null string is a balanced string.If X and Y are balanced strings, then…

Given a string, find lexicographically next string. Examples: Input : geeks Output : geekt The last character 's' is changed to 't'.Input : raavz Output : raawz Since we can't increase last character, we increment previous character.Input : zzz Output : zzza If string is empty, we return 'a'. If…

Try it on GfG Practice Given a string, the task is to check if we can split it into 4 strings such that each string is non-empty and different from the other. Examples: Input : str[] = "geeksforgeeks" Output : Yes "geeks", "for", "gee", "ks" are four distinct strings that can form from given string.…

Last Updated : DiscussComments Question 1 What is the return value of following function for arr[] = {9, 12, 2, 11, 2, 2, 10, 9, 12, 10, 9, 11, 2} and n is size of this array. C++ int fun(int arr[], int n) { int x = arr[0]; for (int i = 1; i < n; i++) x = x ^ arr[i]; return x; } C int fun(int arr[],…

Try it on GfG Practice Given an array of integers arr[], the task is to move all the zeros to the end of the array while maintaining the relative order of all non-zero elements. Examples: Input: arr[] = [1, 2, 0, 4, 3, 0, 5, 0] Output: arr[] = [1, 2, 4, 3, 5, 0, 0, 0] Explanation: There are three 0s…

Try it on GfG Practice You are given an array of n-elements, you have to find the number of operations needed to make all elements of array equal. Where a single operation can increment an element by k. If it is not possible to make all elements equal print -1. Example : Input : arr[] = {4, 7, 19,…

Try it on GfG Practice Rotations in the array is defined as the process of rearranging the elements in an array by shifting each element to a new position. This is mostly done by rotating the elements of the array clockwise or counterclockwise. Table of Content Types of Rotations in Array 1. Right…

Try it on GfG Practice Given an array arr[] of size n, the task is to find all the Leaders in the array. An element is a Leader if it is greater than or equal to all the elements to its right side. Note: The rightmost element is always a leader. Examples: Input: arr[] = [16, 17, 4, 3, 5, 2] Output:…

Try it on GfG Practice Given a sorted array arr[] of size n, the goal is to rearrange the array so that all distinct elements appear at the beginning in sorted order. Additionally, return the length of this distinct sorted subarray. Note: The elements after the distinct ones can be in any order and…

Try it on GfG Practice Given an array arr[], the task is to reverse the array. Reversing an array means rearranging the elements such that the first element becomes the last, the second element becomes second last and so on. Examples: Input: arr[] = {1, 4, 3, 2, 6, 5} Output: {5, 6, 2, 3, 4, 1}…

Try it on GfG Practice Given an array arr[], the task is to generate all the possible subarrays of the given array. Examples: Input: arr[] = [1, 2, 3] Output: [ [1], [1, 2], [2], [1, 2, 3], [2, 3], [3] ] Input: arr[] = [1, 2] Output: [ [1], [1, 2], [2] ] Iterative Approach To generate a subarray, we…

Try it on GfG Practice Given an array arr[], the task is to print every alternate element of the array starting from the first element. Examples: Input: arr[] = [10, 20, 30, 40, 50] Output: 10 30 50 Explanation: Print the first element (10), skip the second element (20), print the third element…

In JavaScript, an array is an ordered list of values. Each value is called an element, and each element has a numeric position in the array, known as its index. Arrays in JavaScript are zero-indexed, meaning the first element is at index 0, the second at index 1, and so on. Array in JavaScript Why…

An array is a group of like-typed variables that are referred to by a common name. And each data item is called an element of the array. The data types of the elements may be any valid data type like char, int, float, etc. and the elements are stored in a contiguous location. Length of the array…

In Python, a list is a built-in dynamic sized array (automatically grows and shrinks). We can store all types of items (including another list) in a list. A list may contain mixed type of items, this is possible because a list mainly stores references at contiguous locations and actual items maybe…

Try it on GfG Practice Java ArrayList is a part of the collections framework and it is a class of java.util package. It provides us with dynamic-sized arrays in Java. The main advantage of ArrayList is that, unlike normal arrays, we don't need to mention the size when creating ArrayList. It…

Try it on GfG Practice Arrays in Java are one of the most fundamental data structures that allow us to store multiple values of the same type in a single variable. They are useful for storing and managing collections of data. Arrays in Java are objects, which makes them work differently from arrays…

C++ vector is a dynamic array that stores collection of elements same type in contiguous memory. It has the ability to resize itself automatically when an element is inserted or deleted. Create a Vector Before creating a vector, we must know that a vector is defined as the std::vector class template…

An array in C is a fixed-size collection of similar data items stored in contiguous memory locations. It can be used to store the collection of primitive data types such as int, char, float, etc., as well as derived and user-defined data types such as pointers, structures, etc. Creating an Array in…

Array is a linear data structure that is a collection of data elements of same types. Arrays are stored in contiguous memory locations. It is a static data structure with a fixed size. Applications of Array Data Structure: Arrays mainly have advantages like random access and cache friendliness over…