InterviewDigestOnline Assessment2026-08-16
Coding questions: 1 easy hashmap problem and 1 hard DP problem involving bit manipulation
AI-Expanded — inferred from the question title, not from the original candidate report
Given an array of integers, write a function that returns the first element that appears exactly once, or -1 if no such element exists. Then, solve the "Maximum Number of Groups" problem where you are given an array of integers and must partition them into the maximum number of non-empty subsets such that the bitwise AND of each subset is greater than zero, using dynamic programming with bitmasking to optimize the state transitions.
Context & Summary
Online Assessment conducted on HackerRank platform with a mix of coding and MCQ questions.
💻 Coding practice works best on desktop.
Code editors are too cramped on mobile screens.
Loading editor...
AI can automatically infer and generate example test cases for this question based on standard algorithmic constraints.