### Problem Statement :

```A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result.

Example:
d=2
arr=[1,2,3,4,5]

After 2 rotations, arr'=[3,4,5,1,2].

Function Description:

Complete the rotateLeft function in the editor below.

rotateLeft has the following parameters:
1. int d: the amount to rotate by
2. int arr[n]: the array to rotate

Returns
1. int[n]: the rotated array

Input Format:

The first line contains two space-separated integers that denote n, the number of integers, and d, the number of left rotations to perform.
The second line contains n space-separated integers that describe arr[].

Constraints:
1. 1<=n<=10^5
2. 1<=d<=n
3. 1<=a[i]<=10^6```

### Solution :

```                            ```Solution in C :

In C:

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {

int N;
int d;
scanf("%d %d", &N, &d);
int A[N];
for (int i = 0; i < N; i++)
{
scanf("%d", &A[i]);
}
for (int i = 0; i < N; i++)
{
printf("%d ", A[(i + d) % N]);
}
puts("");

return 0;
}

In C++:

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
int N, d, i;
cin >> N >> d;
int start = N - d;
int *arr = new int[N];
for (i=0; i<N; ++i) {
if (start == N) start = 0;
cin >> arr[start++];
}
for (i=0; i<N; ++i) cout << arr[i] << " ";
return 0;
}

In Java:

import java.io.*;
import java.util.*;

public class Solution {

public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int N = scan.nextInt();
int n = scan.nextInt();
int[] A = new int[N];
for (int i=0; i<N; ++i) {
A[i] = scan.nextInt();
}
for (int i=0; i<n; ++i) {
rotateArray(A);
}
for (int a : A) {
System.out.print(a+" ");
}
System.out.println("");
}

private static void rotateArray(int[] A) {
int t = A;
for (int i=0; i<A.length-1; ++i) {
A[i] = A[i+1];
}
A[A.length-1] = t;
}
}

In Python 3:

n, d = map(int, input().split())
arr = [int(x) for x in input().split()]

for i in range(d):
arr.append(arr[i])

for x in arr[d:]:
print(x, end=' ')```
```

## Tree: Level Order Traversal

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F

## Binary Search Tree : Insertion

You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <

## Tree: Huffman Decoding

Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t

## Binary Search Tree : Lowest Common Ancestor

You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b

## Swap Nodes [Algo]

A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from

## Kitty's Calculations on a Tree

Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a