🎆THE BEST PROGRAMMING CHALLENGES USED IN BIG TECHS FOR YOU TO TRAIN IN 2024🎆
Published: 2024-03-28 00:05:13

# ⭐- WHAT WILL I SHOW?

In this post, I will show you REAL programming challenges used by VARIOUS BIG TECHS in job interviews!

From simpler challenges to more complex ones, including PicPay, Google, Uber, Amazon, Netflix, and MORE!

Enjoy the post!

# ✅ 1 - Back-end Challenge by PicPay

This challenge, as the title says, has already been used by PicPay for a Backend position.

Your challenge? Develop a simplified system inspired by PicPay.

The system should allow two types of users, regular users, and merchants, to transfer money between them.

To see the details and solve the challenge, just go to [this GitHub repository!](https://github.com/PicPay/picpay-desafio-backend)

And if you want to see a resolution video, I highly recommend [@kipperdev's on YouTube!](https://youtube.com/watch?v=QXunBiLq2SM&t=621s)

I HIGHLY recommend you try it out!

![](https://pbs.twimg.com/media/GJtooeIW0AA3IKL?format=png&name=small)

# ✅ 2 - First Missing Positive by Google

This is a hard-level challenge that has been used by GOOGLE itself.

Here, you'll receive an unordered array of INTs `nums` and need to return the smallest integer not present in the array.

To do this, you must implement an algorithm that runs in O(n) time and uses O(1) auxiliary space.

Sounds easy? [Here's the challenge on LeetCode for you to try!](https://leetcode.com/problems/first-missing-positive/description/)

And if you want to see a resolution video, [@phenpessoa's on YouTube is GREAT!](https://youtube.com/watch?v=DsG617OTdhs)

This one's good! I recommend it!

![](https://pbs.twimg.com/media/GJtqx2TXAAAG9_w?format=png&name=small)

# ✅ 3 - Backend Challenge by Uber

Here's another challenge for BackEnds, this time from Uber!

Here, you should create a prototype of one of the following projects:

- Departure Times
- SF Movies
- Email Service
- Food Trucks

The design is up to you, and you should deploy it as if it were in production!

To see more details, [just go to this GitHub repo!](https://github.com/uber-archive/coding-challenge-tools/blob/master/coding_challenge.md)

And if you want to see any resolution videos, [@kipperdev's is ideal!](https://youtube.com/watch?v=eFgeO9M9lLw&list=PLNCSWIsR6ADKaT1cO6XUJkRy0_v9p-h0Z)

![](https://pbs.twimg.com/media/GJttLwJWcAAApgK?format=png&name=small)

# ✅ 4 - Product of Array Except Self by Amazon

This is a medium-level challenge, but still, it's interview level!

Here, you receive an array `nums` and need to return an array `answer` where `answer[i]` is equal to the product of the elements of `nums` MINUS `num[i]`.

Additionally, the product of any prefix or suffix of `nums` must be a 32-bit integer.

If you want to try it yourself, [just go to this LeetCode challenge!](https://leetcode.com/problems/product-of-array-except-self/description/)

And if you want to see a resolution video, [Vamos Codar's is quick, practical, and efficient!](https://youtube.com/watch?v=2sM68Rxr950)

![](https://pbs.twimg.com/media/GJtuwJAXsAAO3d_?format=png&name=small)

# ✅ 5 - First Unique Character in a String by Netflix

LOOK, this one is EASY level on LeetCode and has been USED IN NETFLIX!

In this challenge, you receive a string `s` and need to return the index of the first character that does not repeat!

If this character does not exist, just return `-1`.

Seriously, this is one of the EASIEST, but still, it can be a great challenge!

To try to solve it, [just go to this challenge on LeetCode!](https://leetcode.com/problems/first-unique-character-in-a-string/description/)

And if you want to see a resolution video, [@phenpessoa's is THE BEST!](https://youtube.com/watch?v=XIvgNQdTcn4)

Of all on this list, this is the one I most recommend you try!

![](https://pbs.twimg.com/media/GJtwfF-WQAElaT2?format=png&name=small)

# ⭐- BONUS - Uber Archives

If you want to see other challenges that have been used in Uber interviews in the past, the [Uber Archives repository](https://github.com/uber-archive) has MANY of these challenges in an Open Source format!

I HIGHLY recommend checking it out!

# 😄 - THANK YOU!

Of all on this profile, without a doubt, this is one of the best in my opinion!

Took me a while to post it precisely because I researched a lot and wasn't very free, but still, I hope you liked it!

If you have any suggestions, just send me a [DM on Twitter!](https://twitter.com/Luciano655dev) I always want to bring the best content here.

My recent posts didn't reach many people, and even if it continues like this, I'll never stop posting!

Finally, Thank you for reading this far!

[Also, check out other projects of mine on my GitHub!](https://github.com/luciano655dev)

### Thank you!