Technical Background and Programming Skills Questions
Clearly communicate your programming experience, including languages you're proficient in (C#, C++, JavaScript, Python). Mention any relevant coursework in data structures, algorithms, computer graphics, or physics simulation. Be honest about knowledge gaps while showing willingness to learn.
MediumTechnical
0 practiced
You need to update 10 parts of a large web page with 10,000 DOM nodes simultaneously each frame. Describe strategies to apply updates efficiently to minimize reflows and repaints, covering batching, document fragments, requestAnimationFrame, virtual DOM diffing, and trade-offs between approaches.
MediumTechnical
0 practiced
Given this C++ multi-threaded snippet 'int counter = 0; void worker() { for (int i = 0; i < 10000; i++) ++counter; }', identify why it has a data race and propose fixes using C++11 atomics or mutexes. Discuss trade-offs between atomics and mutex locks in this context.
MediumTechnical
0 practiced
Write a parser/evaluator in Python for arithmetic expressions containing +, -, *, / and parentheses. You may use recursive descent or the shunting-yard algorithm. Provide code that parses a string and returns the numeric result honoring operator precedence and associativity.
EasyTechnical
0 practiced
In Python, implement 'reverse_linked_list(head)' that reverses a singly linked list in-place and returns the new head. Use the ListNode definition 'class ListNode: def __init__(self, val=0, next=None): self.val=val; self.next=next'. Your solution should run in O(n) time and O(1) extra space. Mention edge cases (empty list, single node).
EasyTechnical
0 practiced
Write a function 'is_balanced(s)' in JavaScript or Python that returns true if string s has balanced brackets, supporting '()', '[]', and '{}' and ignoring non-bracket characters. The solution should run in O(n) time and O(n) space. Show sample cases, e.g., '([]){}' -> true, '([)]' -> false.
Unlock Full Question Bank
Get access to hundreds of Technical Background and Programming Skills interview questions and detailed answers.
Sign in to ContinueJoin thousands of developers preparing for their dream job.