LeetCode Question · Jul 2021 · Bangalore

Linkedin SDE - Reject

SWE Phone Screen Easy
5 upvotes 2,549 views 3 replies

Question Details

2 YOE, Bangalore Phone Screening: Basic OS, networks, OSI layer questions. ended with a coding question: Find the max product subsequence in an array (0,+,-) On-site (Zoom) 1. Coding: Given an n-ary tree, reconstruct...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Arrays Binary Tree Dynamic Programming Graph Greedy Os Queue Stack System Design