Embedded Software mostly requires knowledge in C/OS, memory management , data structures and algorithms. In my experience as an embedded software engineer I have never had to use more fancy data structures like hash maps trees, graphs nor have I have the need to use recursion and solve graph traversal problems . With that being said do FANG companies ask these high level object oriented concepts when interviewing candidates for low level driver/firmware/embedded Software positions? I would like this info to prepare accordingly for interviews. Assume i am interested to apply only to embedded software positions at FANG. Yoe: 10
Health & Wellness
1h
291
Loneliness poll
Personal Finance
Yesterday
1438
Thank you AAPL and NVDA
World Conflicts
Yesterday
517
Why I Find Free Palestine Inspiring
World Conflicts
Yesterday
683
Israeli precision-guided munition likely killed group of children playing foosball in Gaza, weapons experts say
World Conflicts
Yesterday
586
Is "From the River to the Sea" So Wrong?
Yes they do.
They gon f u up
Have a ques among similar lines ... I I do see that asking all kinds of algo/ coding problems will be same for every interviewee .. but what about system design?
Op any updates on your findings? Have you interviewed with FAANG? How was your experience?
Following
Aren’t maps and sets common even in C programming? Trees and Graphs arent that common, but things like the DOM / XML naturally map to a Tree-like DS, so they’re not that rare either. Re: recursion, in practical terms, iterative approaches are more efficient so I don’t know if they’re used a lot, but writing recursive code is expected atleast for interviews. Re: Graph traversal, you’re expected to write it in interviews but I’ve never implemented BFS / DFS professionally.
Maps aren’t native but certainly can be implemented in C. But it’s not commonly used in embedded software.
The rule of thumb when doing embedded programming is if new is called, you are doing it wrong.