diff --git a/.vscode/launch.json b/.vscode/launch.json new file mode 100644 index 0000000..de04c67 --- /dev/null +++ b/.vscode/launch.json @@ -0,0 +1,26 @@ +{ + "version": "0.2.0", + "configurations": [ + { + // Use IntelliSense to find out which attributes exist for C# debugging + // Use hover for the description of the existing attributes + // For further information visit https://github.com/dotnet/vscode-csharp/blob/main/debugger-launchjson.md + "name": ".NET Core Launch (console)", + "type": "coreclr", + "request": "launch", + "preLaunchTask": "build", + // If you have changed target frameworks, make sure to update the program path. + "program": "${workspaceFolder}/ISM6225_Fall_2023_Assignment_2/bin/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.dll", + "args": [], + "cwd": "${workspaceFolder}/ISM6225_Fall_2023_Assignment_2", + // For more information about the 'console' field, see https://aka.ms/VSCode-CS-LaunchJson-Console + "console": "internalConsole", + "stopAtEntry": false + }, + { + "name": ".NET Core Attach", + "type": "coreclr", + "request": "attach" + } + ] +} \ No newline at end of file diff --git a/.vscode/tasks.json b/.vscode/tasks.json new file mode 100644 index 0000000..cfc9329 --- /dev/null +++ b/.vscode/tasks.json @@ -0,0 +1,41 @@ +{ + "version": "2.0.0", + "tasks": [ + { + "label": "build", + "command": "dotnet", + "type": "process", + "args": [ + "build", + "${workspaceFolder}/ISM6225_Fall_2023_Assignment_2.sln", + "/property:GenerateFullPaths=true", + "/consoleloggerparameters:NoSummary;ForceNoAlign" + ], + "problemMatcher": "$msCompile" + }, + { + "label": "publish", + "command": "dotnet", + "type": "process", + "args": [ + "publish", + "${workspaceFolder}/ISM6225_Fall_2023_Assignment_2.sln", + "/property:GenerateFullPaths=true", + "/consoleloggerparameters:NoSummary;ForceNoAlign" + ], + "problemMatcher": "$msCompile" + }, + { + "label": "watch", + "command": "dotnet", + "type": "process", + "args": [ + "watch", + "run", + "--project", + "${workspaceFolder}/ISM6225_Fall_2023_Assignment_2.sln" + ], + "problemMatcher": "$msCompile" + } + ] +} \ No newline at end of file diff --git a/DIS Assignment 2 Output Screenshot.png b/DIS Assignment 2 Output Screenshot.png new file mode 100644 index 0000000..dee3b08 Binary files /dev/null and b/DIS Assignment 2 Output Screenshot.png differ diff --git a/ISM6225_Fall_2023_Assignment_2/DIS Assignment 2 Output Screenshot.png b/ISM6225_Fall_2023_Assignment_2/DIS Assignment 2 Output Screenshot.png new file mode 100644 index 0000000..dee3b08 Binary files /dev/null and b/ISM6225_Fall_2023_Assignment_2/DIS Assignment 2 Output Screenshot.png differ diff --git a/ISM6225_Fall_2023_Assignment_2/Program.cs b/ISM6225_Fall_2023_Assignment_2/Program.cs index 803afb3..f04a022 100644 --- a/ISM6225_Fall_2023_Assignment_2/Program.cs +++ b/ISM6225_Fall_2023_Assignment_2/Program.cs @@ -82,6 +82,46 @@ static void Main(string[] args) Console.WriteLine(); } + private static string RemoveVowels(string longString) + { + throw new NotImplementedException(); + } + + private static string ConvertIListToArray(IList combinations) + { + throw new NotImplementedException(); + } + + private static IList GeneratePossibleNextMoves(string currentState) + { + throw new NotImplementedException(); + } + + private static int ThirdMax(int[] maximum_numbers) + { + throw new NotImplementedException(); + } + + private static int NumIdenticalPairs(int[] numbers) + { + throw new NotImplementedException(); + } + + private static bool IsStrobogrammatic(string s1) + { + throw new NotImplementedException(); + } + + private static int MaxProfit(int[] prices_array) + { + throw new NotImplementedException(); + } + + private static string ConvertIListToNestedList(IList> missingRanges) + { + throw new NotImplementedException(); + } + /* Question 1: @@ -111,321 +151,481 @@ All the values of nums are unique. public static IList> FindMissingRanges(int[] nums, int lower, int upper) { try + IList> result = new List>(); + long prev = (long)lower - 1; // To handle integer overflow while finding missing ranges + + for (int i = 0; i <= nums.Length; i++) { - // Write your code here and you can modify the return value according to the requirements - return new List>(); + long curr = (i == nums.Length) ? (long)upper + 1 : nums[i]; // Upper Range Cases + + if (prev + 1 <= curr - 1) + { + if (prev + 1 == curr - 1) + { + result.Add(new List { (int)(prev + 1) }); // What if the range is a single number? + } + else + { + result.Add(new List { (int)(prev + 1), (int)(curr - 1) }); // What are range start and end values? + } + } + prev = curr; + } + return result; } catch (Exception) { throw; } - } - /* - - Question 2 + /* - Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.An input string is valid if: - Open brackets must be closed by the same type of brackets. - Open brackets must be closed in the correct order. - Every close bracket has a corresponding open bracket of the same type. - - Example 1: + Question 2 - Input: s = "()" - Output: true - Example 2: + Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.An input string is valid if: + Open brackets must be closed by the same type of brackets. + Open brackets must be closed in the correct order. + Every close bracket has a corresponding open bracket of the same type. - Input: s = "()[]{}" - Output: true - Example 3: + Example 1: - Input: s = "(]" - Output: false + Input: s = "()" + Output: true + Example 2: - Constraints: + Input: s = "()[]{}" + Output: true + Example 3: - 1 <= s.length <= 104 - s consists of parentheses only '()[]{}'. + Input: s = "(]" + Output: false - Time complexity:O(n^2), space complexity:O(1) - */ + Constraints: - public static bool IsValid(string s) - { - try - { - // Write your code here and you can modify the return value according to the requirements - return s.Length == 0; - } - catch (Exception) + 1 <= s.length <= 104 + s consists of parentheses only '()[]{}'. + + Time complexity:O(n^2), space complexity:O(1) + */ + + public static bool IsValid(string s) { - throw; + try + { + // Input length is odd or even? + if (s.Length % 2 != 0) + { + return false; // Odd length is invalid, so returning false + } + + // Loop until there are no occurrences of '()', '[]', or '{} left' + while (s.Contains("[]") || s.Contains("()") || s.Contains("{}")) + { + // Replace '()', '[]', and '{}' with an empty string to eliminate valid pairs + s = s.Replace("()", "").Replace("[]", "").Replace("{}", ""); + } + + // If the string length is equal to 0 after removing valid pairs, it is a valid string + return s.Length == 0; + } + catch (Exception) + { + throw; // If any exception occurs during the execution, throw the exception + } } - } - /* + /* - Question 3: - You are given an array prices where prices[i] is the price of a given stock on the ith day.You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. - Example 1: - Input: prices = [7,1,5,3,6,4] - Output: 5 - Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5. - Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell. + Question 3: + You are given an array prices where prices[i] is the price of a given stock on the ith day.You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. + Example 1: + Input: prices = [7,1,5,3,6,4] + Output: 5 + Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5. + Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell. - Example 2: - Input: prices = [7,6,4,3,1] - Output: 0 - Explanation: In this case, no transactions are done and the max profit = 0. - - Constraints: - 1 <= prices.length <= 105 - 0 <= prices[i] <= 104 + Example 2: + Input: prices = [7,6,4,3,1] + Output: 0 + Explanation: In this case, no transactions are done and the max profit = 0. - Time complexity: O(n), space complexity:O(1) - */ + Constraints: + 1 <= prices.length <= 105 + 0 <= prices[i] <= 104 - public static int MaxProfit(int[] prices) - { - try - { - // Write your code here and you can modify the return value according to the requirements - return 1; - } - catch (Exception) + Time complexity: O(n), space complexity:O(1) + */ + + public static int MaxProfit(int[] prices) { - throw; + + try + { + if (prices.Length == 0) // Empty Array Case + return 0; + + int minPrice = prices[0]; // First price is the minimum price + int maxProfit = 0; // Creating a blank variable for maximum profit. + + for (int i = 1; i < prices.Length; i++) + { + if (prices[i] < minPrice) // If smaller price found, update the minimum proce + minPrice = prices[i]; + else if (prices[i] - minPrice > maxProfit) // If better price found, update the max price + maxProfit = prices[i] - minPrice; + } + return maxProfit; // Returning the max profit + } + catch (Exception) + { + throw; // Exception handling within the catch block + } } - } - /* - - Question 4: - Given a string num which represents an integer, return true if num is a strobogrammatic number.A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down). - Example 1: + /* - Input: num = "69" - Output: true - Example 2: + Question 4: + Given a string num which represents an integer, return true if num is a strobogrammatic number.A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down). + Example 1: - Input: num = "88" - Output: true - Example 3: + Input: num = "69" + Output: true + Example 2: - Input: num = "962" - Output: false + Input: num = "88" + Output: true + Example 3: - Constraints: - 1 <= num.length <= 50 - num consists of only digits. - num does not contain any leading zeros except for zero itself. + Input: num = "962" + Output: false - Time complexity:O(n), space complexity:O(1) - */ + Constraints: + 1 <= num.length <= 50 + num consists of only digits. + num does not contain any leading zeros except for zero itself. - public static bool IsStrobogrammatic(string s) - { - try - { - // Write your code here and you can modify the return value according to the requirements - return false; - } - catch (Exception) + Time complexity:O(n), space complexity:O(1) + */ + + public static bool IsStrobogrammatic(string s) { - throw; + try + { + // Initializing two pointers at two ends, left and right + int left = 0; + int right = s.Length - 1; + + // Till the two pointers meet in the middle, while loop will run + while (left <= right) + { + // Invalid combinations will not be a part of strobogrammatic number + if (!("00 11 88 696".Contains(s[left].ToString() + s[right]))) + { + return false; + } + + // Mirror image combination check + if (s[left] == '6' && s[right] != '9' || s[left] == '9' && s[right] != '6') + { + return false; + } + + // Checking for same conditions for 0, 1, and 8 + if (s[left] == '0' && s[right] != '0' || s[left] == '1' && s[right] != '1' || s[left] == '8' && s[right] != '8') + { + return false; + } + + // Moving the pointers to each other + left++; + right--; + } + + // If all conditions satisfied, the string is strobogrammatic + return true; + } + catch (Exception) + { + throw; + } } - } - /* - Question 5: - Given an array of integers nums, return the number of good pairs.A pair (i, j) is called good if nums[i] == nums[j] and i < j. + /* - Example 1: + Question 5: + Given an array of integers nums, return the number of good pairs.A pair (i, j) is called good if nums[i] == nums[j] and i < j. - Input: nums = [1,2,3,1,1,3] - Output: 4 - Explanation: There are 4 good pairs (0,3), (0,4), (3,4), (2,5) 0-indexed. - Example 2: + Example 1: - Input: nums = [1,1,1,1] - Output: 6 - Explanation: Each pair in the array are good. - Example 3: + Input: nums = [1,2,3,1,1,3] + Output: 4 + Explanation: There are 4 good pairs (0,3), (0,4), (3,4), (2,5) 0-indexed. + Example 2: - Input: nums = [1,2,3] - Output: 0 + Input: nums = [1,1,1,1] + Output: 6 + Explanation: Each pair in the array are good. + Example 3: - Constraints: + Input: nums = [1,2,3] + Output: 0 - 1 <= nums.length <= 100 - 1 <= nums[i] <= 100 + Constraints: - Time complexity:O(n), space complexity:O(n) + 1 <= nums.length <= 100 + 1 <= nums[i] <= 100 - */ + Time complexity:O(n), space complexity:O(n) - public static int NumIdenticalPairs(int[] nums) - { - try - { - // Write your code here and you can modify the return value according to the requirements - return 0; - } - catch (Exception) + */ + + public static int NumIdenticalPairs(int[] nums) { - throw; + try + { + // Checking if array has less than 2 numbers or has any nulls + if (nums == null || nums.Length < 2) + { + return 0; // If there are less than 2 elements, there cannot be any pair + } + + int count = 0; + int[] frequency = new int[101]; // Max value is 100 + + // Iterate over the array to count the frequency of element and calculate the number of good pairs + foreach (var num in nums) + { + count += frequency[num]; // Increment count by the frequency of current number + frequency[num]++; // Frequency array update + } + + return count; // Return total count of good pairs + } + catch (Exception ex) + { + Console.WriteLine("An error occurred: " + ex.Message); + throw; // Re-throw the exception + } } - } - /* - Question 6 + /* + Question 6 - Given an integer array nums, return the third distinct maximum number in this array. If the third maximum does not exist, return the maximum number. + Given an integer array nums, return the third distinct maximum number in this array. If the third maximum does not exist, return the maximum number. - Example 1: + Example 1: - Input: nums = [3,2,1] - Output: 1 - Explanation: - The first distinct maximum is 3. - The second distinct maximum is 2. - The third distinct maximum is 1. - Example 2: + Input: nums = [3,2,1] + Output: 1 + Explanation: + The first distinct maximum is 3. + The second distinct maximum is 2. + The third distinct maximum is 1. + Example 2: - Input: nums = [1,2] - Output: 2 - Explanation: - The first distinct maximum is 2. - The second distinct maximum is 1. - The third distinct maximum does not exist, so the maximum (2) is returned instead. - Example 3: - - Input: nums = [2,2,3,1] - Output: 1 - Explanation: - The first distinct maximum is 3. - The second distinct maximum is 2 (both 2's are counted together since they have the same value). - The third distinct maximum is 1. - Constraints: + Input: nums = [1,2] + Output: 2 + Explanation: + The first distinct maximum is 2. + The second distinct maximum is 1. + The third distinct maximum does not exist, so the maximum (2) is returned instead. + Example 3: - 1 <= nums.length <= 104 - -231 <= nums[i] <= 231 - 1 + Input: nums = [2,2,3,1] + Output: 1 + Explanation: + The first distinct maximum is 3. + The second distinct maximum is 2 (both 2's are counted together since they have the same value). + The third distinct maximum is 1. + Constraints: - Time complexity:O(nlogn), space complexity:O(n) - */ + 1 <= nums.length <= 104 + -231 <= nums[i] <= 231 - 1 - public static int ThirdMax(int[] nums) - { - try - { - // Write your code here and you can modify the return value according to the requirements - return 0; - } - catch (Exception) + Time complexity:O(nlogn), space complexity:O(n) + */ + + public static int ThirdMax(int[] nums) { - throw; + try + { + if (nums.Length < 3) + { + Array.Sort(nums); // Sorting array in ascending order + return nums[nums.Length - 1]; // If the length > 3, return maximum number + } + + Array.Sort(nums); // Sort array in ascending order + Array.Reverse(nums); // Reverse array to order in descending manner + + int distinctCount = 1; + int thirdMax = nums[0]; + + for (int i = 1; i < nums.Length; i++) + { + if (nums[i] != nums[i - 1]) + { + distinctCount++; // Increasing distinct count when new distinct number is found + } + + if (distinctCount == 3) + { + thirdMax = nums[i]; // Storing third distinct maximum number + break; + } + } + + return distinctCount < 3 ? nums[0] : thirdMax; // Returning third maximum if it exists, else return the maximum + } + catch (Exception ex) + { + Console.WriteLine("An error occurred: " + ex.Message); // Print the error message + throw; // Re-throw the exception + } } - } - /* - - Question 7: + /* - You are playing a Flip Game with your friend. You are given a string currentState that contains only '+' and '-'. You and your friend take turns to flip two consecutive "++" into "--". The game ends when a person can no longer make a move, and therefore the other person will be the winner.Return all possible states of the string currentState after one valid move. You may return the answer in any order. If there is no valid move, return an empty list []. - Example 1: - Input: currentState = "++++" - Output: ["--++","+--+","++--"] - Example 2: + Question 7: - Input: currentState = "+" - Output: [] - - Constraints: - 1 <= currentState.length <= 500 - currentState[i] is either '+' or '-'. + You are playing a Flip Game with your friend. You are given a string currentState that contains only '+' and '-'. You and your friend take turns to flip two consecutive "++" into "--". The game ends when a person can no longer make a move, and therefore the other person will be the winner.Return all possible states of the string currentState after one valid move. You may return the answer in any order. If there is no valid move, return an empty list []. + Example 1: + Input: currentState = "++++" + Output: ["--++","+--+","++--"] + Example 2: - Timecomplexity:O(n), Space complexity:O(n) - */ + Input: currentState = "+" + Output: [] - public static IList GeneratePossibleNextMoves(string currentState) - { - try - { - // Write your code here and you can modify the return value according to the requirements - return new List() { }; - } - catch (Exception) - { - throw; - } - } + Constraints: + 1 <= currentState.length <= 500 + currentState[i] is either '+' or '-'. - /* + Timecomplexity:O(n), Space complexity:O(n) + */ - Question 8: + public static IList GeneratePossibleNextMoves(string currentState) + { + try + { + IList result = new List(); + + // Checking all the character of string + for (int i = 0; i < currentState.Length - 1; i++) + { + // Check if current and next character are '+' + if (currentState[i] == '+' && currentState[i + 1] == '+') + { + // Converting string to a character array to manipulate it + char[] currentStateArray = currentState.ToCharArray(); + + // Replacing consecutive "++" with "--" + currentStateArray[i] = '-'; + currentStateArray[i + 1] = '-'; + + // Adding modified string to result list + result.Add(new string(currentStateArray)); + } + } + + // Returning list of possible next moves + return result; + } + catch (Exception ex) + { - Given a string s, remove the vowels 'a', 'e', 'i', 'o', and 'u' from it, and return the new string. - Example 1: + Console.WriteLine("An error occurred: " + ex.Message); // Print the error and throw the exception + throw; + } + } - Input: s = "leetcodeisacommunityforcoders" - Output: "ltcdscmmntyfrcdrs" + /* - Example 2: + Question 8: - Input: s = "aeiou" - Output: "" + Given a string s, remove the vowels 'a', 'e', 'i', 'o', and 'u' from it, and return the new string. + Example 1: - Timecomplexity:O(n), Space complexity:O(n) - */ + Input: s = "leetcodeisacommunityforcoders" + Output: "ltcdscmmntyfrcdrs" - public static string RemoveVowels(string s) - { - // Write your code here and you can modify the return value according to the requirements - return ""; - } + Example 2: - /* Inbuilt Functions - Don't Change the below functions */ - static string ConvertIListToNestedList(IList> input) - { - StringBuilder sb = new StringBuilder(); + Input: s = "aeiou" + Output: "" - sb.Append("["); // Add the opening square bracket for the outer list + Timecomplexity:O(n), Space complexity:O(n) + */ - for (int i = 0; i < input.Count; i++) + public static string RemoveVowels(string s) { - IList innerList = input[i]; - sb.Append("[" + string.Join(",", innerList) + "]"); - - // Add a comma unless it's the last inner list - if (i < input.Count - 1) + try { - sb.Append(","); + // Checking if the string is empty + if (string.IsNullOrEmpty(s)) + { + return ""; // Return an empty string + } + + // Remove vowels i.e. 'a', 'e', 'i', 'o', and 'u' from the string + string result = ""; + foreach (char c in s) + { + if (!"aeiou".Contains(c)) + { + result += c; + } + } + return result; // Returning new string without vowels + } + catch (Exception ex) + { + Console.WriteLine("An error occurred: " + ex.Message); + throw; // Re-throw the exception } } - sb.Append("]"); // Add the closing square bracket for the outer list + /* Inbuilt Functions - Don't Change the below functions */ + static string ConvertIListToNestedList(IList> input) + { + StringBuilder sb = new StringBuilder(); - return sb.ToString(); - } + sb.Append("["); // Add the opening square bracket for the outer list + for (int i = 0; i < input.Count; i++) + { + IList innerList = input[i]; + sb.Append("[" + string.Join(",", innerList) + "]"); + + // Add a comma unless it's the last inner list + if (i < input.Count - 1) + { + sb.Append(","); + } + } - static string ConvertIListToArray(IList input) - { - // Create an array to hold the strings in input - string[] strArray = new string[input.Count]; + sb.Append("]"); // Add the closing square bracket for the outer list - for (int i = 0; i < input.Count; i++) - { - strArray[i] = "\"" + input[i] + "\""; // Enclose each string in double quotes + return sb.ToString(); } - // Join the strings in strArray with commas and enclose them in square brackets - string result = "[" + string.Join(",", strArray) + "]"; - return result; + static string ConvertIListToArray(IList input) + { + // Creating an array to hold strings in input + string[] strArray = new string[input.Count]; + + for (int i = 0; i < input.Count; i++) + { + strArray[i] = "\"" + input[i] + "\""; // Enclosing each string in double quotes + } + + // Joining the strings in strArray with commas and enclose them in square brackets + string result = "[" + string.Join(",", strArray) + "]"; + + return result; + } } } -} diff --git a/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.AssemblyInfo.cs b/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.AssemblyInfo.cs index b16e42f..7e52814 100644 --- a/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.AssemblyInfo.cs +++ b/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.AssemblyInfo.cs @@ -1,7 +1,6 @@ //------------------------------------------------------------------------------ // // This code was generated by a tool. -// Runtime Version:4.0.30319.42000 // // Changes to this file may cause incorrect behavior and will be lost if // the code is regenerated. diff --git a/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.GeneratedMSBuildEditorConfig.editorconfig b/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.GeneratedMSBuildEditorConfig.editorconfig index fa7acc0..04dd985 100644 --- a/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.GeneratedMSBuildEditorConfig.editorconfig +++ b/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.GeneratedMSBuildEditorConfig.editorconfig @@ -8,4 +8,4 @@ build_property.PlatformNeutralAssembly = build_property.EnforceExtendedAnalyzerRules = build_property._SupportedPlatformList = Linux,macOS,Windows build_property.RootNamespace = ISM6225_Fall_2023_Assignment_2 -build_property.ProjectDir = C:\Users\Mounica Pothureddy\Source\Repos\ISM6225_Fall_2023_Assignment_2\ISM6225_Fall_2023_Assignment_2\ +build_property.ProjectDir = E:\Assignment 2 - DIS\ISM6225_Fall_2023_Assignment_2\ISM6225_Fall_2023_Assignment_2\ diff --git a/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.assets.cache b/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.assets.cache index 5e04259..18f076d 100644 Binary files a/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.assets.cache and b/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.assets.cache differ diff --git a/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.csproj.AssemblyReference.cache b/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.csproj.AssemblyReference.cache deleted file mode 100644 index 130457b..0000000 Binary files a/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.csproj.AssemblyReference.cache and /dev/null differ diff --git a/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.csproj.CoreCompileInputs.cache b/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.csproj.CoreCompileInputs.cache index 659ca17..996e65b 100644 --- a/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.csproj.CoreCompileInputs.cache +++ b/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.csproj.CoreCompileInputs.cache @@ -1 +1 @@ -b3e1273a5bae2e691691398888e1c0c21c593bf8 +a60d5bb60bb25598f134185e493d4f04d5b63ce0 diff --git a/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.csproj.FileListAbsolute.txt b/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.csproj.FileListAbsolute.txt index 9254bf0..41d549e 100644 --- a/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.csproj.FileListAbsolute.txt +++ b/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.csproj.FileListAbsolute.txt @@ -13,3 +13,10 @@ /Users/naveennagulapalli/Projects/ISM6225_Fall_2023_Assignment_2/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.pdb /Users/naveennagulapalli/Projects/ISM6225_Fall_2023_Assignment_2/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ISM6225_Fall_2023_Assignment_2.genruntimeconfig.cache /Users/naveennagulapalli/Projects/ISM6225_Fall_2023_Assignment_2/ISM6225_Fall_2023_Assignment_2/obj/Debug/net7.0/ref/ISM6225_Fall_2023_Assignment_2.dll +E:\Assignment 2 - DIS\ISM6225_Fall_2023_Assignment_2\ISM6225_Fall_2023_Assignment_2\obj\Debug\net7.0\ISM6225_Fall_2023_Assignment_2.GeneratedMSBuildEditorConfig.editorconfig +E:\Assignment 2 - DIS\ISM6225_Fall_2023_Assignment_2\ISM6225_Fall_2023_Assignment_2\obj\Debug\net7.0\ISM6225_Fall_2023_Assignment_2.AssemblyInfoInputs.cache +E:\Assignment 2 - DIS\ISM6225_Fall_2023_Assignment_2\ISM6225_Fall_2023_Assignment_2\obj\Debug\net7.0\ISM6225_Fall_2023_Assignment_2.AssemblyInfo.cs +E:\Assignment 2 - DIS\ISM6225_Fall_2023_Assignment_2\ISM6225_Fall_2023_Assignment_2\obj\Debug\net7.0\ISM6225_Fall_2023_Assignment_2.csproj.CoreCompileInputs.cache +E:\Assignment 2 - DIS\ISM6225_Fall_2023_Assignment_2\ISM6225_Fall_2023_Assignment_2\obj\Debug\net7.0\ISM6225_Fall_2023_Assignment_2.dll +E:\Assignment 2 - DIS\ISM6225_Fall_2023_Assignment_2\ISM6225_Fall_2023_Assignment_2\obj\Debug\net7.0\refint\ISM6225_Fall_2023_Assignment_2.dll +E:\Assignment 2 - DIS\ISM6225_Fall_2023_Assignment_2\ISM6225_Fall_2023_Assignment_2\obj\Debug\net7.0\ISM6225_Fall_2023_Assignment_2.pdb diff --git a/ISM6225_Fall_2023_Assignment_2/obj/ISM6225_Fall_2023_Assignment_2.csproj.nuget.dgspec.json b/ISM6225_Fall_2023_Assignment_2/obj/ISM6225_Fall_2023_Assignment_2.csproj.nuget.dgspec.json index 41915c7..54b412e 100644 --- a/ISM6225_Fall_2023_Assignment_2/obj/ISM6225_Fall_2023_Assignment_2.csproj.nuget.dgspec.json +++ b/ISM6225_Fall_2023_Assignment_2/obj/ISM6225_Fall_2023_Assignment_2.csproj.nuget.dgspec.json @@ -1,24 +1,20 @@ { "format": 1, "restore": { - "C:\\Users\\Mounica Pothureddy\\Downloads\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2.csproj": {} + "E:\\Assignment 2 - DIS\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2.csproj": {} }, "projects": { - "C:\\Users\\Mounica Pothureddy\\Downloads\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2.csproj": { + "E:\\Assignment 2 - DIS\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2.csproj": { "version": "1.0.0", "restore": { - "projectUniqueName": "C:\\Users\\Mounica Pothureddy\\Downloads\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2.csproj", + "projectUniqueName": "E:\\Assignment 2 - DIS\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2.csproj", "projectName": "ISM6225_Fall_2023_Assignment_2", - "projectPath": "C:\\Users\\Mounica Pothureddy\\Downloads\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2.csproj", - "packagesPath": "C:\\Users\\Mounica Pothureddy\\.nuget\\packages\\", - "outputPath": "C:\\Users\\Mounica Pothureddy\\Downloads\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\obj\\", + "projectPath": "E:\\Assignment 2 - DIS\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2.csproj", + "packagesPath": "C:\\Users\\shuv1\\.nuget\\packages\\", + "outputPath": "E:\\Assignment 2 - DIS\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\obj\\", "projectStyle": "PackageReference", - "fallbackFolders": [ - "C:\\Program Files (x86)\\Microsoft Visual Studio\\Shared\\NuGetPackages" - ], "configFilePaths": [ - "C:\\Users\\Mounica Pothureddy\\AppData\\Roaming\\NuGet\\NuGet.Config", - "C:\\Program Files (x86)\\NuGet\\Config\\Microsoft.VisualStudio.FallbackLocation.config", + "C:\\Users\\shuv1\\AppData\\Roaming\\NuGet\\NuGet.Config", "C:\\Program Files (x86)\\NuGet\\Config\\Microsoft.VisualStudio.Offline.config" ], "originalTargetFrameworks": [ @@ -26,7 +22,6 @@ ], "sources": { "C:\\Program Files (x86)\\Microsoft SDKs\\NuGetPackages\\": {}, - "C:\\Program Files\\dotnet\\library-packs": {}, "https://api.nuget.org/v3/index.json": {} }, "frameworks": { @@ -60,7 +55,7 @@ "privateAssets": "all" } }, - "runtimeIdentifierGraphPath": "C:\\Program Files\\dotnet\\sdk\\7.0.306\\RuntimeIdentifierGraph.json" + "runtimeIdentifierGraphPath": "C:\\Program Files\\dotnet\\sdk\\7.0.400\\RuntimeIdentifierGraph.json" } } } diff --git a/ISM6225_Fall_2023_Assignment_2/obj/ISM6225_Fall_2023_Assignment_2.csproj.nuget.g.props b/ISM6225_Fall_2023_Assignment_2/obj/ISM6225_Fall_2023_Assignment_2.csproj.nuget.g.props index 04c5214..01bdb9a 100644 --- a/ISM6225_Fall_2023_Assignment_2/obj/ISM6225_Fall_2023_Assignment_2.csproj.nuget.g.props +++ b/ISM6225_Fall_2023_Assignment_2/obj/ISM6225_Fall_2023_Assignment_2.csproj.nuget.g.props @@ -5,12 +5,11 @@ NuGet $(MSBuildThisFileDirectory)project.assets.json $(UserProfile)\.nuget\packages\ - C:\Users\Mounica Pothureddy\.nuget\packages\;C:\Program Files (x86)\Microsoft Visual Studio\Shared\NuGetPackages + C:\Users\shuv1\.nuget\packages\ PackageReference - 6.6.0 + 6.7.0 - - + \ No newline at end of file diff --git a/ISM6225_Fall_2023_Assignment_2/obj/project.assets.json b/ISM6225_Fall_2023_Assignment_2/obj/project.assets.json index 330e755..05d46f1 100644 --- a/ISM6225_Fall_2023_Assignment_2/obj/project.assets.json +++ b/ISM6225_Fall_2023_Assignment_2/obj/project.assets.json @@ -8,24 +8,19 @@ "net7.0": [] }, "packageFolders": { - "C:\\Users\\Mounica Pothureddy\\.nuget\\packages\\": {}, - "C:\\Program Files (x86)\\Microsoft Visual Studio\\Shared\\NuGetPackages": {} + "C:\\Users\\shuv1\\.nuget\\packages\\": {} }, "project": { "version": "1.0.0", "restore": { - "projectUniqueName": "C:\\Users\\Mounica Pothureddy\\Downloads\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2.csproj", + "projectUniqueName": "E:\\Assignment 2 - DIS\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2.csproj", "projectName": "ISM6225_Fall_2023_Assignment_2", - "projectPath": "C:\\Users\\Mounica Pothureddy\\Downloads\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2.csproj", - "packagesPath": "C:\\Users\\Mounica Pothureddy\\.nuget\\packages\\", - "outputPath": "C:\\Users\\Mounica Pothureddy\\Downloads\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\obj\\", + "projectPath": "E:\\Assignment 2 - DIS\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2.csproj", + "packagesPath": "C:\\Users\\shuv1\\.nuget\\packages\\", + "outputPath": "E:\\Assignment 2 - DIS\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\obj\\", "projectStyle": "PackageReference", - "fallbackFolders": [ - "C:\\Program Files (x86)\\Microsoft Visual Studio\\Shared\\NuGetPackages" - ], "configFilePaths": [ - "C:\\Users\\Mounica Pothureddy\\AppData\\Roaming\\NuGet\\NuGet.Config", - "C:\\Program Files (x86)\\NuGet\\Config\\Microsoft.VisualStudio.FallbackLocation.config", + "C:\\Users\\shuv1\\AppData\\Roaming\\NuGet\\NuGet.Config", "C:\\Program Files (x86)\\NuGet\\Config\\Microsoft.VisualStudio.Offline.config" ], "originalTargetFrameworks": [ @@ -33,7 +28,6 @@ ], "sources": { "C:\\Program Files (x86)\\Microsoft SDKs\\NuGetPackages\\": {}, - "C:\\Program Files\\dotnet\\library-packs": {}, "https://api.nuget.org/v3/index.json": {} }, "frameworks": { @@ -67,7 +61,7 @@ "privateAssets": "all" } }, - "runtimeIdentifierGraphPath": "C:\\Program Files\\dotnet\\sdk\\7.0.306\\RuntimeIdentifierGraph.json" + "runtimeIdentifierGraphPath": "C:\\Program Files\\dotnet\\sdk\\7.0.400\\RuntimeIdentifierGraph.json" } } } diff --git a/ISM6225_Fall_2023_Assignment_2/obj/project.nuget.cache b/ISM6225_Fall_2023_Assignment_2/obj/project.nuget.cache index 9fa3725..1fdaad4 100644 --- a/ISM6225_Fall_2023_Assignment_2/obj/project.nuget.cache +++ b/ISM6225_Fall_2023_Assignment_2/obj/project.nuget.cache @@ -1,8 +1,8 @@ { "version": 2, - "dgSpecHash": "dyNoLXySHR2oQot6QdHCrQtfkYu0BbB1u1jqPSLEjXeT1gk0CAAZW3vvLK9aW5UoHDxyxaxCnRXih9W6HGmMGw==", + "dgSpecHash": "koIsLkcYKv8iyveAKAdjuY1Z2zqRekr1aQmBkAQVhm3FoWx3tTT43Q7k6g8GAAAyAr6XajwnMpSGpFnojGUnFg==", "success": true, - "projectFilePath": "C:\\Users\\Mounica Pothureddy\\Downloads\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2.csproj", + "projectFilePath": "E:\\Assignment 2 - DIS\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2\\ISM6225_Fall_2023_Assignment_2.csproj", "expectedPackageFiles": [], "logs": [] } \ No newline at end of file