HashedIn by Deloitte SDE-1 OA 28th Jan 2025
Question Details
There were three coding question and you have to solve them in 1.5hr (offline - In the office) Q.1 The problem presents us with a list of strings called words, and...
Full Details
There were three coding question and you have to solve them in 1.5hr (offline - In the office)
Q.1 The problem presents us with a list of strings called words, and another string s. We are asked to determine if s is an acronym for the words. An acronym in this context is defined as a string that can be formed by taking the first character of each string in words, in their respective order. For instance, given words = ["keep", "it", "simple", "stupid"], the string s = "kiss" would be an acronym of words because taking the first letter of each word in order produces "kiss" but if the s="kis" then its false beacuse both are not equal.
constraints: pretty low around 100
Q.2 Suppose you have n integers from 1 through n. A permutation of those n integers is considered a Divisible Permutation if for every i, where 1 <= i <= n, either of the following is true:
\tperm[i] is divisible by i.
\ti is divisible by perm[i].
\t
Given an integer n, find the total number of the valid Divisible Permutations.
Example 1:
Input: n = 2
Output: 2
Explanation:
The first Divisible Permutation is [1,2]:
permutation[1] = 1 is divisible by i = 1
permutation[2] = 2 is divisible by i = 2
The second Divisible Permutation is [2,1]:
permutation[1] = 2 is divisible by i = 1
i = 2 is divisible by permutation[2] = 1
constraints: 1<=n<=15
UPD: Found the exact question on leetcode(https://leetcode.com/problems/beautiful-arrangement/description/)
Q.3 https://leetcode.com/problems/chalkboard-xor-game/description/
constraints: same as leetcode
About This Question
This is a reported interview question from a deloitte interview for a swe role during the oa round reported in 2025.
It covers the following topics: Backtracking, Bit Manipulation, Strings .
Difficulty rating: Easy
Topics
More Deloitte Interview Questions
About Deloitte Interview Reports
This question was reported by a candidate who interviewed at Deloitte. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Deloitte are the higher-signal extractions to take from this report.
For broader preparation context, the Deloitte interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Deloitte reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Deloitte Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Deloitte reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.