SDE - Intern

Started with linear search approach. After one hint from the interviewer, I came up with a writing approach using binary search. 
Start with the entire array.
At each step of the binary search:
a. Calculate the middle index of the current search space.
b. Check if the element at the middle index is equal to both its adjacent elements.
c. If it is equal to both adjacent elements, then that element is the one that appears three times, so return it.
d. If it's not equal to both adjacent elements:
i. Determine which side of the array has an odd number of elements.
ii. If the left side has an odd number of elements, update the search space to the left half of the array.
iii. If the right side has an odd number of elements, update the search space to the right half of the array.
Repeat the process until the element that appears three times is found.

First, I came up with the basic recursive solution. Then, upon considering the problem from a different angle, instead of transforming A to B, I devised a greedy approach to solve it by transforming B to A.

-> Create a grid using nested elements for rows and cells.
-> Apply CSS to define grid layout, cell size, and any desired styling.
->Use margin: 0 auto; on the grid container to horizontally center it.
-> Wrap the grid container in a flexbox wrapper and use justify-content: center; align-items: center; to vertically center it.
-> Apply both horizontal and vertical centering techniques to the grid container and its wrapper to center it both horizontally and vertically on the page.