All Question are +1 and -0.25

20 — Aptitude Questions ( 30 minutes)

20 — Software C Language Specific Snippets ( 40 minutes )

1 Coding Question ( 5 points) ( 20 minutes)

C language Specific Question:

A subarray is considered compromised if the bitwise OR of all elements in any subarray is present in the subarray itself. Find the number of compromised subarrays in a given array of positive integers.

A subarray is defined as any contiguous segment of the array.

Example arr = [2, 4, 7] Answer = 5

Please help with the processing idea?

More Questions: Given an alphabet of size m, find the number of passwords of length n such that no character appears k or more times consecutively.(hard)

Given a graph, perform DFS traversal and output all distinct valid outputs (such as all unique DFS traversal paths or orders depending on the specific constraint). (Medium)