Adobe’s internship process (₹115K stipend) began with an in-campus online assessment on HackerRank. Candidates had to solve 37 questions in 90 minutes out of a total of 63 questions across 6 sections.

• Sections A, B, and F were compulsory.
• Candidates had to choose one section from C, D, and E.

The paper included core CS subjects:

• OS questions covered page replacement (LRU/MRU), threads/processes, and TLB formulas.
• CN questions were tricky, featuring protocol and command-based problems.
• DBMS was largely code-driven.

Another section covered NALR aptitude, including number systems, probability, directions, ratios, and graphs.

Candidates also faced 13 questions each in C++, Java, and Python, mostly predicting code outputs. C++ was easier, while Java was tougher, incorporating Spring-Boot/Servlets.

Finally, there were 2 DSA problems:

• Computing the total XOR sum of all subarrays (optimized using prefix XOR).
• Finding the longest subsequence with total AND > 0 (best solved with DP tabulation).

Wrong MCQs carried a ¼ mark penalty, making accuracy as important as speed.

1. Total XOR Sum of All Subarrays – Compute the XOR of every possible subarray and return the total sum. A prefix-XOR approach is needed to optimize beyond the brute force O(n²) solution.

2. Longest Subsequence with AND > 0 – Find the maximum-length subsequence such that the bitwise AND of all its elements remains greater than zero, best solved using a DP/tabulation approach.