Como se preparar para entrevistas na Canva

+1

Leetcode 236. Lowest Common Ancestor of a Binary Tree

Given a binary tree and two nodes p and q, find their lowest common ancestor — the deepest node that has both p and q as descendants (a node can be a descendant of itself). The tree can be large (up to 2e5 nodes), nodes are unique and p and q are guaranteed to exist.

Tell me about a time when you spot an opportunity to improve your company, and you drive that

Implement Collaborative Document Editing

Design and implement a collaborative editing system similar to Google Docs or Canva where multiple users can simultaneously edit the same document. Focus on document storage architecture and real-time change management including conflict resolution.