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.
Full Experience
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
Interview Questions (4)
Given total no of wheels $$n$$, determine how many distinct combinations of 4 wheeler and 2 wheeler vehicles can be formed.
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.
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.
Summary
I recently had a machine coding round for a Senior Frontend Developer role at DocuSign in Bangalore after a recruiter reached out via LinkedIn. The interview, conducted by an interviewer based in Seattle, involved explaining a product I'm proud of and then coding a solution to find a string in a large file using a character-by-character API.
Full Experience
Hello Everyone,
I was recently contacted by a DocuSign recruiter via LinkedIn, which led to a machine coding round for a Senior Frontend Developer position. The interviewer was based in Seattle, so the interview took place late in the evening IST time.
After we introduced ourselves, I was asked to describe a product or feature I had built that I was particularly proud of. Following my explanation, the interviewer asked specific follow-up questions about that feature. Afterwards, I was given a coding problem to solve.
I wrote my solution in a Hackerrank notepad. The requirement was not to execute the code, so I just submitted the written solution. I noticed there wasn't much information about DocuSign's interview process, so I wanted to share my experience. I hope this helps others! I'm happy to assist if anyone has questions.
Interview Questions (1)
Find input string in a file. The file is large that we cannot fit in memory. You have an API to access the file character by character.
API
char getChar(); // returns null when emptyExample:
input: bca
file: abcabe
return true
Example:
input: cba
file: abcabe
result: false
Example:
input: ababc
file: abababc
return: true
bool findString(input);