Panda Guru LogoPanda
Guru

Hashedin (by Deloitte) Online Assessment Questions 2024

Round 1

Questions:

  1. Replace Words
    Given two strings, sentence and dictionary. Replace all words in the sentence string with ### if they are not included in the dictionary.

    • Type: String Manipulation
  2. Minimum WiFi Radius
    Houses and routers were placed at certain points on a 1D plane (e.g., houses: [2, 3, 6], routers: [4, 5]). Determine the minimum radius required for routers to ensure all houses have WiFi coverage.

    • Type: Binary Search or Greedy
  3. Russian Doll Envelopes
    A variation of the Russian Doll Problem (LeetCode #354). The goal is to maximize the number of envelopes you can nest inside one another based on their dimensions.

    • Type: Dynamic Programming
Candidate's Approach

No approach provided.

Interviewer's Feedback

No feedback provided.


Round 2

Questions:

  1. Staircase Problem
    Classic DP problem: Find the number of ways to reach the top of a staircase with n steps, taking 1 or 2 steps at a time.

    • Type: Dynamic Programming
  2. Kadane's Algorithm
    Maximum subarray sum problem. Use Kadane’s Algorithm to solve efficiently.

    • Type: Dynamic Programming
  3. Wildcard Pattern Matching
    Match a string with a pattern containing * and ? characters. Implement efficient pattern-matching logic.

    • Type: Dynamic Programming
Candidate's Approach

No approach provided.

Interviewer's Feedback

No feedback provided.


Round 3

Questions:

  1. Palindrome Formation
    Given a string containing ? characters, replace the ? with appropriate letters to form a palindrome.

    • Type: String Manipulation
  2. Unknown Question
    Unfortunately, I didn’t get to see the second problem in this set.

  3. Strong Password Checker
    Solve LeetCode 420: Implement a strong password checker that ensures passwords meet specific character and length requirements.

    • Type: String Manipulation
Candidate's Approach

No approach provided.

Interviewer's Feedback

No feedback provided.