Panda Guru LogoPanda
Guru

HashedIn by Deloitte SDE-1 OA 28th Jan 2025

Round 1

Questions:

Question

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 because both are not equal.

Constraints: pretty low around 100.


Question

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:

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 here.


Question

Chalkboard XOR Game
Constraints: same as Leetcode.

Candidate's Approach

No approach provided.

Interviewer's Feedback

No feedback provided.