D2L interview questions

Tech / SWE · 7 questions · last reported Apr 2026
Report an interview →

Browse 7 D2L interview questions for software engineering and software development interview preparation. Questions in this collection are tagged for internship, full-time roles. Explore the topics and stages below and filter the collection to plan your practice.

Interview stages in this collection
Phone screen
Practice topics
Coding (5), Arrays (3), Code Review (3), Strings (2), Behavioral (1), Communication (1), HashSet (1), Lists (1)

Questions come from candidate contributions and online research. Reports reflect past experiences and do not guarantee what D2L will ask. Locked question details require points. Public examples below are free to read.

Read 3 free D2L interview question examples

Browse all D2L questions

7 questions

Free D2L interview question examples

Read the full problem statements and use the links to revisit or share a specific example.

Common Strings

Easy · Phone screen · Internship

The coding question was about an array of arrays where each inner array had random strings. I had to find the strings that appeared in every inner array and return those strings in an array. They mentioned that duplicates could appear inside the sub-arrays, so I had to be careful about how I checked membership. The round started with code review and debugging, then moved into this LeetCode-style string or array problem.

Grade Partition

Easy · Phone screen · Full-time

They gave me a coding question with a list of student grades from 0 to 100. I had to return a new list where all passing grades came first and all failing grades, anything under 50, came last. The grades didn't need to be sorted beyond that, so the main thing was separating the two groups correctly. I made a tiny syntax mistake during the round, but the actual logic was pretty easy.

Threshold Sort

Easy · Phone screen · Full-time

I got an array partitioning question in the senior software engineer process. The input was something like [30,45,50,80,40,90], and I had to rearrange it around the value 50 while keeping the original relative order within each group. The example output they gave was [50,80,90,30,45,40], so the important part was preserving order, not fully sorting the array. It was an easy coding challenge, but the wording around the threshold was a little confusing.