Contributing Please see CONTRIBUTING.md for getting started with the contribution. Make sure that you follow CODE_OF_CONDUCT.md while contributing and engaging in the discussions. When contributing, please first discuss the change you wish to make via an issue on this repository before making the actual change.

Raise an issue to join the GitHub organisation

BinarySearch -> Algorithm with O(log n) runtime complexity.

FirstBadVersion -> You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Suppose you have n versions [1, 2, ..., n] and you want to find out the first bad one, You are given an API bool isBadVersion(version) Implement a function to find the first bad version. You should minimize the number of calls to the API.

--------------------------DAY- 02-------------------------

RotateArray -> Given an array, rotate the array to the right by k steps, where k is non-negative.

Squares of a Sorted Array -> Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.

--------------------------DAY- 03-------------------------

MoveZero -> Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. Input: nums = [0,1,0,3,12] Output: [1,3,12,0,0]

Sum Of Two Numbers: Input: numbers = [2,7,11,15], target = 9 Output: [1,2] Explanation: The sum of 2 and 7 is 9.
Therefore, index1 = 1, index2 = 2. We return [1, 2].

--------------------------DAY- 04-------------------------

Reverse String : Write a function that reverses a string. The input string is given as an array of characters s. You must do this by modifying the input array in-place with O(1) extra memory.

Reverse Words in a S Input: s = "Let's take LeetCode contest" Output: "s'teL ekat edoCteeL tsetnoc"

--------------------------DAY- 05-------------------------

Remove Duplicate Letters : Given a string s, remove duplicate letters so that every letter appears once and only once.
You must make sure your result is the smallest in lexicographical order among all possible results.

                       Note: This question is the same as 1081: https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/

--------------------------DAY- 06-------------------------

Roman to Integer : Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 Input: s = "LVIII" Output: 58 Explanation: L = 50, V= 5, III = 3.

Middle of the Linked List: Input: head = [1,2,3,4,5,6] Output: [4,5,6] Explanation: Since the list has two middle nodes with values 3 and 4, we return the second one.

--------------------------DAY- 07-------------------------