hims & hers | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The interview process included a technical phone screen focused on complex graph algorithms. The candidate was asked to solve problems involving Dijkstra’s algorithm and dynamic programming rerooting methods.
Technical Questions
-
Graph Algorithms
- Dijkstra’s Algorithm
- Depth-First Search (DFS)
-
Dynamic Programming
- Tree-based DP
- Recursion
Tips & Insights
Focus on understanding graph traversal techniques and dynamic programming concepts, as they are commonly tested in technical interviews. Practice solving problems using these algorithms to gain confidence.