Solution

Rahul has an integer array called 'arr' of length N containing unique values. He wants to create a balanced tree where each parent node has
smaller valued nodes on its left and larger valued nodes on its right. This balanced tree should ensure that the depth of the two subtrees for every
node doesn't differ by more than one.

Your task is to assist him in creating this type of tree .

The output contains N lines denoting the pre-order traversal of nodes. If the left child of the node contains a non-null value, then print the value;
otherwise, print a dot (.). A similar process for the right child also. Each right child value is separated from the node by a ">" sign, and each left
child by a left arrow sign.

Input Format:

- First line contains an integer N representing the size of the array arr.
- The second line contains N unique space-separated integers representing the elements of the array arr.

Output Format:

The output contains N lines denoting the pre-order traversal of nodes. If the left child of the node contains a non-null value, then print the value;
otherwise, print a dot (.). A similar process for the right child also. Each right child value is separated from the node by a "-" sign, and each left child
by a left arrow sign.

Constraints:
1 <= N <= 10^5
1 <= arr[i] <= 10^19 Show More

Problem Statement

You have a budget of x coins each day to buy beer, and your goal is to buy as many bottles of beer as possible before the price of beer in all shops exceeds your daily budget.
There are N shops, and each shop sells one bottle of beer per day. The price of beer in each shop increases by 1 coin per day after each purchase.
You can visit multiple shops in a single day, but you can buy only one bottle per shop per day.

Your task is to determine the total number of beer bottles you can buy before the prices at all shops exceed your daily budget.

Input Format

The first line contains two space-separated integers N, X. The number of shops and everyday budget.
The second line contains N space-separated integers, representing the cost of one bottle in each shop.

Output Format
Print one integer representing the total number of beer bottles you can buy before prices exceed your daily budget. Show More

A substring is a group of contiguous characters in a string. For instance, all substrings of abc are [a, b, c, ab, bc, abc].

Given a binary representation of a number, determine the total number of substrings present that match the following conditions:

1. The 0s and 1s are grouped consecutively (e.g., 01, 10, 0011, 1100, 000111, etc.).
2. The number of 0s in the substring is equal to the n umber of 1s in the substring.

Example:
s = 001101

The 4 substrings matching the two conditions include [0011, 01, 10, 01]. Note that 01 appears twice, from indices 1-2 and 4-5. There are other substrings, e.g., 001 and 011 that match the first condition but not the second.

Function Description:
Complete the function `counting` in the editor below.

counting has the following parameter(s):
string s: a string representation of a binary integer Show More

How to Attempt?
Chocolate Arrangement
Alex loves chocolate a lot. His brother Sam gifts him 2^N boxes of chocolate. These boxes are arranged in 2 rows denoted by 2 arrays A and B both of size N. Each box of chocolate contains some number of chocolates which is represented by A[i] and B[i] (for 1 <= i <= N).
Alex wants the boxes of chocolate in those 2 rows to be arranged in such a way that the boxes containing an equal number of chocolates are placed at the same index i.e. if A[x] and B[y] are equal, then x should be equal to y. You have to help Alex arrange the rows of boxes such that the maximum number of pairs of equal boxes can be placed at the same index, in the manner that Alex wants.
Return the maximum number of pairs of boxes that can be successfully arranged in the manner specified above.
Note: You can rearrange the row only by cyclically shifting the row to the left or to the right. A single cyclic shift to the left is an operation that sets A[0] = A[1], A[1] = A[2], ..., A[N-1] = A[0] simultaneously, and a single Show More

In order to ensure maximum security, the developers at Company employ multiple encryption methods to keep user data protected.
In one method, numbers are encrypted using a scheme called 'Pascal Triangle'. When an array of digits is fed to this system, it sums the adjacent digits. It then takes the rightmost digit (least significant digit) of each addition for the next step. Thus, the number of di gits in each step is reduced by 1. This procedure is repeated until there are only 2 digits left, and this sequence of 2 digits forms the encrypted number.
Given the initial sequence of the digits of numbers, find the encrypted number. You should report a string of digits representing the encrypted number.
Example: numbers = [4, 5, 6, 7] Show More

In this problem, you are given an integer array, and you need to perform some operations on the array to make all the elements equal to 0. In one operation, you can select a prefix of the given array and increment or decrement all the elements of the prefix by 1.

You have an array, arr, consisting of n integers. Find the minimum number of operations required to convert every element of this arr ay to 0.
A prefix is a contiguous group of items that includes the first element in the array. For example, [1], [1, 2], [1, 2, 3], etc., are prefixes of [1, 2, 3, 4, 5].

Note: It is guaranteed that it is always possible to convert every element of the array to 0.

Example:
arr = [3, 2, 1] Show More

Prime Jumps

There is a game that is played as follows:

There is a pawn located at cell 0, and its score is 0.
There is a row of n cells numbered from 0 to n-1 from left to right.
Each cell has a value, and the first cell always has a value of 0.
In a single move, the pawn can move either:
one cell to the right, or
some number p cells to the right where p is a prime number ending in 3, e .g., 3 and 13.
The pawn cannot move beyond the last cell.
When the pawn enters a cell, its value is added to the score.
The game ends after the pawn lands on the last cell at n-1.
Determine the maximum possible score.

Example
cell = [0, -10, -20, -30, 50]

There are n = 5 cells in the array, with cells numbered from 0 to 4. Show More

2. SQL: Ecommerce Deal Report

An online shop needs a new deal history feature. Create a query that returns a list of the top three seller profiles with the highest total deals in June, 2022.

The result should have the following columns:
first_name / last_name | email | total.

total - the total amount of all deals for a specific profile
The result should be sorted in descending order by total.

The result should be limited to the first three records.

Note:

Only deals for June 2022 should be included in the report. Show More

Delete Even

Given a linked list of integers, return a linked list containing only nodes having odd integers in their node->data field.

Example
n=3

listHead=1->4->7

The linked list containing only nodes having odd integers is 1 -> 7.

Function Description
Complete the function deleteEven in the editor below.

deleteEven has the following parameter(s):
list listHead: a reference t o the Show More

String Subarrays

Problem Statement
Aarav, an aspiring linguist and programming enthusiast, enjoys finding patterns in words and letters. One day, while reading about the importance of vowels in the English language, he stumbles upon an interesting problem that blends his love for both linguistics and coding.

He is given an array of size N, where each element is a single English alphabet. As he examines the array, he wonders if he can identify meaningful sequences within it. He comes up with an interesting challenge:

A continuous subarray is considered good if it consists of only vowels (A, E, I, O, U). His task is to count the number of good subarrays in the given sequence.

At first, Aarav begins by manually identifying such subarrays in small test cases. He picks out sequences of vowels and counts them one by one. However, as the array size increases, he quickly realizes that a brute-force approach—checking every possible subarray—is inefficient and impractical.

Determined to crack the problem optimally, Aarav starts exploring different strategies. He recalls how subarray problems can often be solved efficiently using sliding window techniques, prefix sums, or mathematical observations. He wonders if there's a way to leverage these methods to quickly count the valid subarrays. Show More