The interview went online with some behavioral and tech questions. Following this interview I had to wait for almost a week and half to hear their answer regarding my candidacy status.
JavaScript questions about currying. E.g. write a function that can be run like this fooFunc(3)(2); // gives 5
Lowest common ancestor (LCA) You are given references to two nodes in a binary tree. Find the root of the smallest subtree that contains both nodes. (one node may be an ancestor of another, in which case this node is the solution) Please do it in O(h), where h is the height of the tree (and please use O(1) in space)
The following metrics were computed from 19 interview experiences for the Wix Full Stack Engineer role in Tel Aviv-Yafo.
Wix's interview process for their Full Stack Engineer roles in Tel Aviv-Yafo is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Wix's Full Stack Engineer interview process in Tel Aviv-Yafo.