docusign logo
Docusign· Software Engineer Internship

DocuSign Software Engineer Internship - Summer 2025

Posted
15 May 2025
464 reads

Summary

I interviewed for a Software Engineer Internship position at DocuSign for Summer 2025. The process included a Hackerrank Online Assessment with two specific coding problems, followed by two interview rounds focused on algorithmic problems, projects, and behavioral questions.

How it went

Compensation : 1.2 lpm

Type : On-site

Hackerrank OA :

  • Given total no of wheels $$n$$, determine how many distinct combinations of 4 wheeler and 2 wheeler vehicles can be formed.
  • SQL qsn based on joins
  • Given a grid with empty and blocked cells, find path which maximizes the minimum distance to a blocked cell from cells of the path and return the maximized minimum distance.

Interview Round 1 :

  • Given an array $$arr$$, find no of distinct ways to partition the array into 3 consecutive non-empty subarrays such that : S2<=S1+S3
    S1 = sum of 1st subarray (left)
    S2 = sum of 2nd subarray (center)
    S3 = sum of 3rd subarray (right)
  • Given an array $$transactions$$, find longest subsequence of transactions such that when performed in order (summation) the amount in your account never goes negative.

Interview Round 2 :

  • Based on projects and behavioral qsns

Questions asked (4)

  1. 01

    Combinations of 4-wheeler and 2-wheeler vehicles

    Data Structures & Algorithms

    Given total no of wheels $$n$$, determine how many distinct combinations of 4 wheeler and 2 wheeler vehicles can be formed.

  2. 02

    Maximize Minimum Distance to Blocked Cell in Grid Path

    Data Structures & Algorithms

    Given a grid with empty and blocked cells, find path which maximizes the minimum distance to a blocked cell from cells of the path and return the maximized minimum distance.

  3. 03

    Partition Array into 3 Subarrays with Sum Condition

    Data Structures & Algorithms

    Given an array $$arr$$, find no of distinct ways to partition the array into 3 consecutive non-empty subarrays such that : S2<=S1+S3
    S1 = sum of 1st subarray (left)
    S2 = sum of 2nd subarray (center)
    S3 = sum of 3rd subarray (right)

  4. 04

    Longest Subsequence of Transactions with Non-Negative Balance

    Data Structures & Algorithms

    Given an array $$transactions$$, find longest subsequence of transactions such that when performed in order (summation) the amount in your account never goes negative.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Docusign 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!