Hello everyone
We have started this interesting and challenging journey of solving at least one DSA problem each day. It may be more exciting and interesting with your support and involvement.
Thanks & Regards, GFG at BTI
Challenges:
-
Given a Binary Tree, print Left view of it.
-
Given an array of size N-1 such that it only contains distinct integers in the range of 1 to N. Find the missing element.
-
Given an array A of integers of length N. You need to calculate factorial of each number.
-
Smallest positive integer that cannot be represented as sum.
-
Square root of a number: Given an integer x, find the square root of x. If x is not a perfect square, then return floor(√x).
-
Count Inversions : Given an array of integers. Find the Inversion Count in the array.
-
Search in a row-column sorted Matrix : Given a matrix of size n x m, where every row and column is sorted in increasing order, and a number x. Find whether element x is present in the matrix or not.
-
Next higher palindromic number using the same set of digits : Given a palindromic number N in the form of string. The task is to find the smallest palindromic number greater than N using the same set of digits as in N.
-
Is Sudoku Valid : Given an incomplete Sudoku configuration in terms of a 9x9 2-D square matrix(mat[][]) the task is to check if the current configuration is valid or not where a 0 represents an empty block.
-
Gray Code : Given a number N, generate bit patterns from 0 to 2^N-1 such tha successive patterns differ by one bit. A Gray code sequence must begin with 0.
-
Merge Sort for Linked List : Given Pointer/Reference to the head of the linked list, the task is to Sort the given linked list using Merge Sort. Note: If the length of the linked list is odd, then the extra node should go in the first list while splitting.
-
Neeman's Shoes
-
Maximum of all subarrays of size k: Given an array arr[] of size N and an integer K. Find the maximum for each and every contiguous subarray of size K.
-
Find median in a stream: Given an input stream of N integers. The task is to insert these numbers into a new stream and find the median of the stream formed by each insertion of X to the new stream.