Pattern: 3 DSA + MCQS

1. Question 1

During recess in a school garden, a group of children are playing a unique game called "Lookout Triangle" using ropes. The ropes are laid out in the garden, forming straight lines on a 2D grid. Each rope has two endpoints with integer coordinates. Some ropes may intersect. The children can stand either at the rope endpoints, or at a point of intersection of the ropes.

The objective of the game is for the children to stand in a "Lookout Triangle" which is formed when each pair of the three children can 'see' each other. Two children can see each other only if they stand on points that lie on a single straight line formed by connected ropes, without changing direction in between. A child blocks the view if they are standing directly between two other children along the same line.

Your task is to determine the number of distinct ways to place three children on the ropes such that they form a valid Lookout Triangle.

Read the input from STDIN and print the output to STDOUT. Do not print arbitrary strings anywhere in the program, as these contribute to the output and test cases will fail.

Constraints: 1<=N<=20, the number of ropes The garden 2D grid is represented by coordinates

Problem 2

A tech company has implemented a drone surveillance system to enhance airspace safety. Using a 2D GPS coordinate system, they have mapped a triangular no-fly zone that includes their data center. Any unauthorized drone entering this area is considered a potential threat.The system continuously tracks all drones in the vicinity and logs their real-time GPS coordinates. Drones located within the triangular no-fly zone, or precisely on its border are considered to have violated the no-fly zone.Your task is to write a program that takes the three coordinates of the no-fly zone, followed by the coordinates of $N$ drones flying, and prints the area of the no-fly zone and the number of drones violating the no-fly zone.The following formula can be used to calculate the area of a triangle with its coordinates as $(X_A, Y_A), (X_B, Y_B), (X_C, Y_C)$:

Problem 3

You are tasked with building a program that takes a date string in various formats and converts it into a standardized format.

The program should recognize the input format, extract the month, day, and year, and output them in the format:

MM DD YYYY

where:

• MM is the month (01–12),
• DD is the day (01–31),
• YYYY is the four-digit year (e.g., 2019).

The input date can be in any one of the following five formats:

1. "January 9, 2019" - Full month name
2. "Jan 9, 2019" - Abbreviated month name
3. "MM/DD/YYYY" - Slash-separated format
4. "MM-DD-YYYY" - Dash-separated format
5. "MM.DD.YYYY" - Dot-separated format

Read the input from STDIN and print the output to STDOUT. Do not print any extra text.

Constraints

1 <= MM (month) <= 12 1 <= DD (day) <= 31 1900 <= YYYY (year) <= 2100

For month names (full or abbreviated), the first letter will always be uppercase. Examples: "Jan", "February", "Dec", "March".

Input Format

The input consists of a single string representing a date in one of the following formats:

• MMMM D, YYYY (Full month name)
• MMM D, YYYY (Abbreviated month name)
• MM/DD/YYYY (Slash-separated format)
• MM-DD-YYYY (Dash-separated format)
• MM.DD.YYYY (Dot-separated format)

Output Format

Print the month, day, and year separated by a single space in the format:

MM DD YYYY

Month (MM) and day (DD) must always be printed as two digits, regardless of the input format.

Sample Input 1

February 9, 2019

Sample Output 1

02 09 2019

Sample Input 2

01-09-2019

Sample Output 2

01 09 2019

MCQS: