Given three points a(x1, y1), b(x2, y2), and c(x3, y3), determine if they form a non-degenerate triangle. Then, check if two points, p(xp, yp) and q(xq, yq), are inside or on the triangle.

Return the corresponding scenario number:
0. The lines do not form a valid non-degenerate triangle.
1. Point p is inside the triangle, but point q is not.
2. Point q is inside the triangle, but point p is not.
3. Both points p and q are inside the triangle.
4. Neither point p nor point q is inside the triangle.

Note: A triangle is considered non-degenerate if it meets the following conditions, where |ab| denotes the length of the line segment between points a and b:
· |ab| + |bc| > |ac|
· |bc| + |ac| > |ab|
· |ab| + |ac| > |bc|

Example
1 = a(x1, y1) : (2, 2)
2 = b(x2, y2) : (7, 2)
3 = c(x3, y3) : (5, 4) Show More

Vowel SubString

Given a string composed of lowercase letters within the ASCII range 'a'-'z', determine the number of substrings that consist solely of vowels, where each vowel appears at least once. The vowels are ['a', 'e', 'i', 'o', 'u']. A substring is defined as a contiguous sequence of characters within the string.
Example
s = 'aeioaexaaeuiou'

There is a substring to the left that is made of vowels, 'aeioae', which is followed by an 'x'. Since 'x' is not a vowel, it cannot be included in the substring, and this substring does not contain all of the vowels. It is not a qualifying substring. Moving to the right, there are four substrings that do qualify: 'aaeuiou', 'aaeuid', 'aeuiou', and 'aeuio'.

Function Description
Complete the function vowelSubstring in the editor with the following parameter(s):
string s: a string
Returns
int: the number of substrings that consist of vowels only ('a', 'e', 'i', 'o', 'u') where every vowel appears at least once.

Constraints
1 ≤ size_of(s) ≤ 10^5
s[i] is in the range ascii['a'-'z'] (where 0 ≤ i < size_of(s)) Show More

Take it apart

Given an array A of length N, Alex and Bob have decided to play a game called "Take it apart." At the beginning of the game, players pick a side of the array, either the start (S) or the end (E), and it's fixed for the rest of the game. Then, they start playing in turns. Alex goes first. They pick a number from their side and remove the number from the array. This number is cons idered collected by the respective player.

Task
Your task is to calculate the minimum absolute difference between the sum of collected numbers by Alex and Bob.

Function description
Complete the function solve provided in the editor. This function takes the following two parameters and returns the required answer:
- N: Represents the size of the array A.
- A: Represents the numbers in the array A.

Input format
Note: This is the input format that you must use to provide custom input.
- The first line contains T, denoting the number of test cases. T also specifies the number of times you have to run the solve function on a different set of inputs. Show More

A number x is called beautiful if the bitwise XOR of all elements from 0 to x is equal to x.

Task
Given an array A of N integers, find the number of beautiful elements in it.

Function Description
Complete the function solve() provided in the editor. This function takes the following parameters and returns the required answer:

- N: Represents the number of elements in the array .
- A: Represents the array containing integer elements.

Input Format
Note: This is the input format that you must use to provide custom input.

- The first line contains T, denoting the number of test cases. T also specifies the number of times you have to run the solve function on a different set of inputs.
- For each test case:
- The first line contains N, denoting the size of array A.
- The second line contains N space-separated integers A[i]. Show More

The city of Hackerland can be represented using a grid with n rows and m columns containing an empty cell represented by a '*' and a blocked cell represented by a #. Traveling is allowed only through empty cells. The people of Hackerland are required to travel from a starting cell defined by the character 'S' to an ending cell represented by a character 'E'.

The people can jump a length of any integer k in all four directions from a given cell i.e. up, down, left, and right. However, if the jump length kis greater than 1, the next jump must be made in the same direction, For example, a hacker is allowed to jump 3 units towards the right, followed by 1 unit towards the right, and then 3 units towards the left. They however cannot jump 3 units towards the right followed by 1 unit towards the left as direction change is not allowed if the previous jump was of length greater than 1. Note that the last jump in any jump sequence is always of length 1.

The jump can be made over a blocked cell as well as long as both starting and ending cells are empty.

Given the map of Hackerland as a 2g matrix grid, that contains exactly one 'S' and 'E' each, find the minimum number of jumps required to travel from Sto E. Report -1 if it is not possible to reach E from S.

Example
Suppose n = 5, m = 6 and grid = ["S **** #". ******** ******* ******** " ***** E") Show More

Given an array of strings, each of the same length, and a target string, construct the target string using characters from the strings in the given array such that the indices of the characters in the order in which they are used form a strictly increasing sequence. Here the index of a character is the
position at which it appears in the string. Note that it is acceptable to use multiple characte rs from the same string.

Determine the number of ways to construct the target string. One construction is different from another if either the sequences of indices they use are different or the sequences are the same but there exists a character at some index such that it is chosen from a different string in these constructions. Since the answer can be very large, return the value modulo (10^9 + 7).

Consider an example with n = 3 strings, each of length 3. Let the array of strings be words = ["adc", "aec", "efg"], and the target string target = "ac". There are 4 ways to reach the target:

1. Select the 15t character of "adc" and the 3rd character of "adc".
2. Select the 1st character of "adc" and the 3rd character of "aec".
3. Select the 15t character of "aec" and the 3rd character of "adc".
4. Select the 1st character of "aec" and the 3rd character of "aec". Show More

A pixel color RGB is defined as a 24 bit integer. Each 8 bit integer (1 byte) represents either red, green or blue color. Each 8 bit integer has an integer value between 0 (Low intensity) and 255 (High intensity)

For the distance between two pixels having RGB values (r1, g1, b1) and (r2, 82, b2), it is calculated as follows:

d = square_root( (r1-r2)^2+ (g1-g2)^2+ (b1- b2)^2)

Given a 24-bi t binary string describing a pixel, identify which of these five colors the pixel is closest to using the Euclidean distance calculation. Then return the closest pure color: Red, Green, Blue, Black, White. Show More