Full Stack Engineer

You are given an integer array 'A' of size 'N', sorted in non-decreasing order. You are also given an integer 'target'. Your task is to write a function to search for 'target' in the array 'A'. If it exists, return its index in 0-based indexing. If 'target' is not present in the array 'A', return -1.

Note:

You must write an algorithm whose time complexity is O(LogN)

Design a system architecture for a School's Bus Management System.

Discussion on my Web Development Project (MERN Stack):

I was asked to briefly explain my entire project (Finance Tracker), covering both the front end and backend.
Next, I was asked why I chose MongoDB over MySQL for database management.
I was also asked to explain the reasons behind using the MERN stack.
Additionally, they inquired about my motivation for undertaking this particular project.
I was asked how I structured the backend in Node.js and how I handled authentication and authorization in the project.