Find min element in Sorted Rotated Array (With Duplicates)

Problem: Find the minimum element in a sorted and rotated array if duplicates are allowed:
Example: { 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 1, 1, 2}   output: 0
Algorithm:

Printing each word in string backwards

Below is the code to print each word backward
Example if Input is "This is Sparta"
Out put should be  "sihT si atrapS"

Length of the longest substring without repeating characters

Length of the longest substring without repeating characters

Method 1 (Brute Force Method)
We can consider all substrings.
One by one and check for each substring whether it contains all unique characters or not. 
There will be n*(n+1)/2 substrings. 

IBM DB2 LUW Database Administrator (Linux/Unix/Windows)

IBM DB2 LUW Database Administrator (Linux/Unix/Windows)

Primary responsibilities & mandatory skills:

At least 0- 12 months DBA experience of DB2 LUW Version 8 & 9 support in a business critical production environment.