DealShare | Online Assessment Questions

Result
Ongoing
Posted
19 Oct 2022
288 reads

Summary

I recently took the DealShare Online Assessment and wanted to share the questions I encountered. The assessment included two primary coding challenges, one of which required a Trie-based solution while the other was similar to the 'Remove Boxes' problem on LeetCode.

How it went

During my online assessment for DealShare, I faced two distinct coding challenges. The first problem, which I initially approached with brute force, resulted in a Time Limit Exceeded error. I found that a Trie-based solution was accepted as the optimal approach. The second question immediately reminded me of the 'Remove Boxes' problem often found on LeetCode. I've shared the problem statements as images for reference.

Questions asked (2)

  1. 01

    String Processing with Trie

    Data Structures & Algorithms

    The first problem involved processing strings where a naive brute-force method proved inefficient, leading to a Time Limit Exceeded error. The optimal solution required leveraging a Trie data structure for efficient operations, suggesting a problem related to prefix searching, dictionary lookups, or similar string-based operations.

  2. 02

    Box Removal Maximization

    Data Structures & Algorithms · Hard

    This problem was highly similar to the LeetCode problem 'Remove Boxes' (LeetCode 546). It likely involved a game or puzzle where one must strategically remove contiguous groups of boxes of the same 'color' or value to maximize a score, typically where removing 'k' boxes yields 'k*k' points. This class of problems usually points towards a dynamic programming approach.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Dealshare recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!