SDE - 1

You are given an integer W representing a total number of wheels. You have an infinite supply of two-wheeled and four-wheeled vehicles.

Your task is to find the number of different ways to choose a fleet of vehicles such that the total number of wheels is exactly W. Two ways are considered different if they use a different number of two-wheeled vehicles or a different number of four-wheeled vehicles.

You will be given T independent queries, each with a different value for W.

You are given a binary string s of length N, where s[i] = '0' represents an office and s[i] = '1' represents a restaurant.

Your task is to find the number of ways to select three buildings at indices i, j, and k such that i < j < k, and the types of the selected buildings are alternating. This means the selected sequence of building types must be either "010" or "101".

You are given two binary arrays, a1 and a2, of the same size N. A binary array is one that contains only 0s and 1s.

Your task is to find the length of the longest contiguous subarray (span) [i...j] where the sum of its elements in a1 is equal to the sum of its elements in a2.

Two friends, Alice and Bob, are playing a game with N stacks of chocolates arranged in a circle. The stacks are numbered 0 to N-1 clockwise.

The rules of the game are as follows:

1) Alice always goes first.

2) The game starts with a pointer at stack 0.

3) On a player's turn, they must take exactly one chocolate from the stack indicated by the pointer.

4) After their turn, the pointer moves one position clockwise to the next stack.

5) If a player's turn begins and the pointer is at a stack that is already empty, that player has no valid move and loses the game immediately.

Given the initial number of chocolates in each stack, and assuming both Alice and Bob play optimally, your task is to determine the winner.

You are given 'N' Amazon distribution hubs, labeled from 0 to N-1, and a list of existing transport routes. Each route[i] = [u, v] represents a direct, bi-directional route between hub u and hub v.

You are allowed to add at most one new transport route between any two hubs that are not already connected.

Your task is to determine if it is possible to make the entire network of hubs fully connected by adding at most one new route. A network is fully connected if every hub is reachable from every other hub through some path of routes. Return true if it's possible, and false otherwise.