Software Developer Internship applicants have rated the interview process at Freddie Mac with 2.5 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 63% positive. To compare, the company-average is 64% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Developer Internship roles take an average of 35 days to get hired, when considering 8 user submitted interviews for this role. To compare, the hiring process at Freddie Mac overall takes an average of 27 days.
Common stages of the interview process at Freddie Mac as a Software Developer Internship according to 8 Glassdoor interviews include:
Group panel interview: 21%
Background check: 16%
Drug test: 16%
Skills test: 11%
Presentation: 11%
One on one interview: 11%
Personality test: 11%
Phone interview: 5%
Here are the most commonly searched roles for interview reports -
I applied online. The process took 2 weeks. I interviewed at Freddie Mac in Apr 2026
Interview
First round is a hirevue type interview with 5 basic questions asked and recorded responses. Final interview is with a team member and it's resume review with deep dive on experiences and a couple of technical questions related to your resume or basic DSA.
Other Software Developer Internship Interview Reviews for Freddie Mac
I applied through an employee referral. I interviewed at Freddie Mac (McLean, VA)
Interview
First round HireVue, typical situational questions and a couple behavioral. Second round interview is with two team members who will ask you about your resume. They'll also ask typical Behaviorals like "tell me about a time you resolved a conflict"
I applied online. I interviewed at Freddie Mac (Washington, DC)
Interview
This position had a remote interview that started with a pre-recorded video. Then, there was an invitation to a technical interview that tested things such as leetcode type problems in a virtual environment.
Interview questions [1]
Question 1
Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and return the reordered list.
The first node is considered odd, and the second node is even, and so on.
Note that the relative order inside both the even and odd groups should remain as it was in the input.
You must solve the problem in O(1) extra space complexity and O(n) time complexity.