FAILED my technical interview but still got hired!

@rprincev.ai

2.1K followers · usually 1.1K views a post

Views

7.2K

Likes

210

Comments

1

Shares

3

SoundTikTok sound · original sound - rprincev.ai

Promoted product

Agent Rise Mentorship Programhttps://www.becomeabotdeveloper.com/ ↗

Why it worked

The video likely performed well because it addresses a common fear among job seekers: failing a technical interview. By sharing a success story and a practical strategy for overcoming such a challenge, it offers relatable advice and a hopeful outcome.

Summary

The creator shares how they were hired for a software engineering role despite failing the technical interview. They explain that by breaking down a difficult LeetCode problem into smaller parts and demonstrating a problem-solving mindset, they were able to impress the interviewer and secure the job.

Structure

1Failed technical interview but got hired
2Faced a difficult LeetCode problem
3Broke the problem down into smaller parts
4Demonstrated problem-solving skills
5Secured the job offer

Product placement

The video promotes the 'Agent Rise Mentorship Program' via the creator's bio link. The creator discusses their experience with a technical interview, specifically a LeetCode problem, and how their approach to problem-solving led to them being hired.

Original caption

was i a personality hire? Chat am i cooked? #coding #technicalinterview #jobs #softwaredeveloper #fyp

More from @rprincev.ai

On-screen text

FAILED my technical interview but still got hired! They added something else on top of this! 25. Reverse Nodes in k-Group Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list. Description Editorial Solutions Submissions k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k, then left-out nodes, in the end, should remain as it is. You may not alter the values in the list's nodes, only nodes themselves may be changed. Example 1: 1 -> 2 -> 3 -> 4 -> 5 Input: head = [1,2,3,4,5], k = 2 Output: [2,1,4,3,5] Example 2: 1 -> 2 -> 3 -> 4 -> 5

Transcript

I failed my technical interview but still got hired! Here's how. I got a LeetCode Hard+ as my technical interview and I knew I was cooked when I saw it. So as any good programmer would do, I stayed calm and did not panic. I broke the problem down into sub-problems. The first being to actually reverse the link list since that was a part of the bigger problem. By doing this, I show my interviewer that I still have a problem solving mindset. I'm able to break the problem down into bits and parts and work on those bits and parts even though I can't figure out the entire thing. This is crucial for software engineering because what your interviewer is really looking for is for you to be able to break down a problem and have that problem solving mindset that is required in software engineering. And with that and my behavioral interview going well, I was able to land the job even though I failed.