* Given a number N, find the first N Fibonacci numbers. The first two number of the series are 1 and 1. */

* A series with same common difference is known as arithmetic series. The first term of series is 'a' and common difference is d. The series looks lik

* Given a single integer N, your task is to find the sum of the square of first N odd natural Numbers. */

* Given an array nums of positive integers of size N. Find all distinct digits present in nums. */

* Given a number N. The task is to print a series of asterisk(*) from 1 till N terms with increasing order and difference being 1. */

* Split the given string into Alphabets and numbers */

* Given a string. Count the number of Camel Case characters in it. */

* Given a string S of length N, find the pattern of the strings. Decrease one character */

* Write a program to calculate nPr. nPr represents n permutation r and value of nPr is (n!) / (n-r)!. */

* Given a matrix Grid[][] of size NxN. Calculate the absolute difference between the sums of its diagonals. */

* Given a number N. The task is to print Floyd's triangle with N lines. */

* Given a non null integer matrix Grid of dimensions NxM.Calculate the sum of its elements. */

* Find Factorial of a given number N. */

* Given an array of size N containing only 0s, 1s, and 2s; sort the array in ascending order. */

to sort stack

Link list Node struct Node { int data; struct Node *next; Node(int x) { data = x; next = NULL; } }; */ Function to merge two9 sorte

* Given a square of matrix M of size N*N. You task is to compute and return sum of principal diagonal elements of matrix. Your have to complete the fu

Function to find sum of series.

* Given an integer N and a matrix A of dimensions NxN.Swap the values of the triangle above the primary diagonal with the values of the triangle below

Function to perform Ternary Search

Function to partition the array around the range such that array is divided into three parts.

Tim Sort function

find top item

Function to return a list of nodes visible from the top view from left to right in Binary Tree.

The function to do Topological Sort. It uses recursive topologicalSortUtil()

* Write a program to find the transpose of a square matrix of size N*N. Transpose of a matrix is obtained by changing rows to columns and columns to r

Function to update a range of values in segment tree us and eu -> starting and ending indexes of update query ue -> ending index of update query dif

si -> index of current node in segment tree ss and se -> Starting and ending indexes of elements for which current nodes stores sum. us and ue -

Adj list

Straightforward extension of the solution for problem #44. (Wildcard Matching) more on: https://github.com/pakosel/leetcode-solutions/tree/master/44.%