Search for a command to run...
Today I went over the algorithms for binary search tree insertions and removals, noting that the time complexity would be O(logn) if the binary search tree is balanced or O(n) in the worst case if the BST is left or right skewed (unbalanced) due to its height.
No comments yet. Be the first to comment.
More interviews with more recruiters, and looking forward to next steps.
Received feedback, talked to more recruiters, and scheduling interviews again.
Went through more interviews, again technical and system design. More product based interviews. Still will be applying and continuing in the process.
Had more interviews, online assessments, and holidays during this time. Looking forward to continue in the upcoming new year as well.
Received some updates from the interviews, still searching and in the process, and talking to more recruiters.