data structure - java

Write an algorithm for the question below that runs O(N). What are the changes to the algorithm that make it run faster?

5. Your cat has run away again and is hiding outside in an area with strange plants. You need to find her so you have to search through the plants. Well the funny thing is you can't e the cat legs from the plants casily. It looks like an array N of parentheses. So you might see: You know your cat's legs look like a pair of parentheses. The front legs look like and the back pair look like ) . Your cat's location is a pair of indices a