## Leetcode - 33. Search In Rotated Sorted Array

Algorithms, Array, Binary Search

This is straight up Binary Search problem with some modifications. When we find the mid point of the given array, one of two things will hold true:

Read MoreRamblings and teachings on topics of interest to me.

Algorithms, Array, Binary Search

This is straight up Binary Search problem with some modifications. When we find the mid point of the given array, one of two things will hold true:

Read MoreAlgorithms, Backtracking, Recursion, String, Leetcode

Before we start solving this problem, let’s do some math first. The problem statement clearly states that we have *N* pairs of parentheses to work with. That means for a string to be considered as part of the solution, it must be of size *2N*.