Frontliner interview questions shared by candidates
How does indexing work in a database? How is it implemented? what happens when user types ABC?
Implemented as a tree, When user types ABC, the db will return all matches/subtrees below C - all ABCD's, ABCE's, etc. If there are multiple ABCD's, then the lowermost node-leaf-D-will point to all the ABCD locations.
Recursive algorithm for Fibonacci sequence is not nlog(n), it must be ~1.6^n, i.e. very bad, hm..
See Interview Questions for Similar Jobs
- Truck Driver
- Social Worker
- Administrative Assistant
- Account Executive
- Human Resource
- Sales Associate
- Graphic Designer
- Registered Nurse