Facebook Coding Interview: Array Partition I (LeetCode)

preview_player
Показать описание
Get the best Daily Planner to maximize productivity:
Looking to land your dream software engineering job? Check out this explanation and solution for this popular Leetcode question!

#codinginterview #softwareengineer #leetcode #pythonprogramming

Problem: 561. Array Partition I

Questions like these are crucial to understand for programming interviews! Almost every tech interview will have algorithm and data structure questions, so practicing these is an important part of the process! Leetcode problems are popular at Google, Facebook, Amazon, Netflix, and most other mid-size/large tech companies!

If you want more help on becoming a software engineer, join our fast-growing Discord community!

I'm currently a web developer (mainly JavaScript and Python) in Silicon Valley. I went to a coding bootcamp over a year ago, after wanting to make a career change. It was one of the best decisions I've ever made!

Intro (00:00)
Conceptual Overview (00:20)
Pseudocoding (02:55)
Coding(03:18)
Time & Space Complexity (04:36)
Outro (04:56)

Helpful tools I use:

⚙️ My Tech Gear

🤖 Automate your life with Integromat (try it free!)

technical interview,leetcode problems,leetcode python,software engineering,amazon interview,facebook coding interview,google coding interview,google interview,facebook interview,computer science,leetcode solutions,coding questions,coding interviews,data structures,cracking the coding interview,python,technical interview example,technical interview software engineer,technical interview preparation,technical interview questions,technical interview python
Комментарии
Автор

Great video Matt! Hope you keep posting more videos like this, I’m joining a boot camp next month and I really could use some problem solving techniques!

Corgislife
Автор

100% watched the whole video. This is exactly what should be uploaded. Thinking like a engineer, sorting the problem, them writing code. I have a TAA Wednesday and have trouble doing those steps, see how that goes. THANKS FOR THE VIDEO, it showed me how to walk through a problem vs spaghetti coding it. Can you do more vids like this, shows how to walk through them.

g_cxl
Автор

Great stuff man, looking forward to the next one!

javilionaire
Автор

Great solution - just a question. Is it possible to sort using two pointers? I think the python sort method has Time Complexity of O(n log n) and I'm wondering if this can be brought down to O(n)?

Super_Shaq
welcome to shbcf.ru