Search for a command to run...
Today I went over binary search trees. I found it interesting how binary search trees are more efficient with O(logn) runtime for inserting and deleting whereas using an array instead would be O(n) runtime for the same operations. For both sorted arrays and binary search trees, binary search will yield O(logn) runtime for search. Main advantages of BST compared to sorted arrays are insert, delete, and search on O(logn) time.
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.