clean up

Author: shreymehul

Diff for: 238.ProductExceptSelf.cs

@@ -1,19 +1,15 @@
 // 238. Product of Array Except Self
 
-// Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
+// Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of
+// nums except nums[i].
 
 // The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.
-
 // You must write an algorithm that runs in O(n) time and without using the division operation.
 
- 
-
 // Example 1:
-
 // Input: nums = [1,2,3,4]
 // Output: [24,12,8,6]
 // Example 2:
-
 // Input: nums = [-1,1,0,-3,3]
 // Output: [0,0,9,0,0]
 

Diff for: 239.MaxSlidingWindow.cs

@@ -1,7 +1,8 @@
 // 239. Sliding Window Maximum
 
-// You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position.
-
+// You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the
+// array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one
+// position.
 // Return the max sliding window.
 
 //Deque implementation via List

Diff for: 242.IsAnagram.cs

@@ -2,7 +2,8 @@
 
 // Given two strings s and t, return true if t is an anagram of s, and false otherwise.
 
-// An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.
+// An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all
+// the original letters exactly once.
 
 public class Solution {
     public bool IsAnagram(string s, string t) {

Diff for: 275.HIndex.cs

@@ -8,16 +8,12 @@
 
 // You must write an algorithm that runs in logarithmic time.
 
- 
-
 // Example 1:
-
 // Input: citations = [0,1,3,5,6]
 // Output: 3
 // Explanation: [0,1,3,5,6] means the researcher has 5 papers in total and each of them had received 0, 1, 3, 5, 6 citations respectively.
 // Since the researcher has 3 papers with at least 3 citations each and the remaining two with no more than 3 citations each, their h-index is 3.
 // Example 2:
-
 // Input: citations = [1,2,100]
 // Output: 2
 

Diff for: 278.FirstBadVersion.cs

@@ -1,7 +1,11 @@
 //278. First Bad Version
-//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. Since each version is developed based on the previous version, all the versions after a bad version are also bad.
-//Suppose you have n versions[1, 2, ..., n] and you want to find out the first bad one, which causes all the following ones to be bad.
-//You are given an API bool isBadVersion(version) which returns whether version is bad.Implement a function to find the first bad version.You should minimize the number of calls to the API.
+//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. Since each version is developed based on the previous version, all the versions after
+// a bad version are also bad.
+//Suppose you have n versions[1, 2, ..., n] and you want to find out the first bad one, which causes all the following ones to
+// be bad.
+//You are given an API bool isBadVersion(version) which returns whether version is bad.Implement a function to find the first
+// bad version.You should minimize the number of calls to the API.
 
 //The isBadVersion API is defined in the parent class VersionControl.
 //bool IsBadVersion(int version);

Diff for: 286.MissingNumber.cs

@@ -1,16 +1,13 @@
 // 268. Missing Number
 
-// Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.
-
- 
+// Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing
+// from the array.
 
 // Example 1:
-
 // Input: nums = [3,0,1]
 // Output: 2
-// Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums.
-
-
+// Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range
+// since it does not appear in nums.
 
 public class Solution {
     public int MissingNumber(int[] nums) {

Diff for: 287.FindDuplicate.cs

@@ -6,10 +6,7 @@
 
 // You must solve the problem without modifying the array nums and uses only constant extra space.
 
- 
-
 // Example 1:
-
 // Input: nums = [1,3,4,2,2]
 // Output: 2
 

Diff for: 326.IsPowerOfThree.cs

@@ -3,16 +3,12 @@
 // Given an integer n, return true if it is a power of three. Otherwise, return false.
 
 // An integer n is a power of three, if there exists an integer x such that n == 3x.
-
- 
-
 // Example 1:
 
 // Input: n = 27
 // Output: true
 // Explanation: 27 = 33
 // Example 2:
-
 // Input: n = 0
 // Output: false
 // Explanation: There is no x where 3x = 0.

Diff for: 328.OddEvenList.cs

@@ -1,5 +1,6 @@
 // 328. Odd Even Linked List
-// Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and return the reordered list.
+// Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with even
+// indices, and return the reordered list.
 // The first node is considered odd, and the second node is even, and so on.
 // Note that the relative order inside both the even and odd groups should remain as it was in the input.
 // You must solve the problem in O(1) extra space complexity and O(n) time complexity.

Diff for: 342.IsPowerOfFour.cs

@@ -4,18 +4,13 @@
 
 // An integer n is a power of four, if there exists an integer x such that n == 4x.
 
- 
-
 // Example 1:
-
 // Input: n = 16
 // Output: true
 // Example 2:
-
 // Input: n = 5
 // Output: false
 // Example 3:
-
 // Input: n = 1
 // Output: true
 

Diff for: 349.Intersection.cs

@@ -1,5 +1,6 @@
 // 349. Intersection of Two Arrays
-// Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.
+// Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique
+// and you may return the result in any order.
 
 // Example 1:
 // Input: nums1 = [1,2,2,1], nums2 = [2,2]

Diff for: 350.Intersect.cs

@@ -1,5 +1,6 @@
 // 350. Intersection of Two Arrays II
-// Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays and you may return the result in any order.
+// Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear
+// as many times as it shows in both arrays and you may return the result in any order.
 
 // Example 1:
 

Diff for: 374.GuessNumber.cs

@@ -41,7 +41,7 @@ public int GuessNumber(int n) {
             }
             else if (res == -1 )  
             {
-                 high = mid -1;
+                high = mid -1;
             }
             else if(res == 1) 
             {

Diff for: 392.IsSubsequence.cs

@@ -1,6 +1,8 @@
 // 392. Is Subsequence
 // Given two strings s and t, return true if s is a subsequence of t, or false otherwise.
-// A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., "ace" is a subsequence of "abcde" while "aec" is not).
+// A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the
+// characters without disturbing the relative positions of the remaining characters. (i.e., "ace" is a subsequence of "abcde"
+// while "aec" is not).
 
 public class Solution
 {