Tanya Patel on LinkedIn: #day5 #codesprintbyusckiit #30days #usckiit #coding #uipath (2024)

#Day6 of 30 Days of CodeSprint by USC.KIIT Hey everyone! I'm excited to share my journey on Day 6 of the 30 Days Coding Challenge, CodeSprint by USC KIIT. 134) Gas Station 135) Candy42) Trapping Rain Water #CodeSprintbyUSCKIIT #30Days CodeChallenge #USCKIIT #Coding Journey #UiPath

4

#Day4 of 30 Days of CodeSprint by USC.KIIT : Mastering Linked Lists!Hey everyone! I'm excited to share my journey on Day 4 of the 30 Days Coding Challenge, CodeSprint by USC KIIT. 46) Jump Game 2 : You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0]. Each element nums[i] represents the maximum length of a forward jump from index i. In other words, if you are at nums[i], you can jump to any nums[i + j]. Return the minimum number of jumps to reach nums[n - 1]. The test cases are generated such that you can reach nums[n - 1].58) Length of last word : Given a string s consisting of words and spaces, return the length of the last word in the string.14) Longest common prefix : Write a function to find the longest common prefix string amongst an array of strings.If there is no common prefix, return an empty string "".#CodeSprintbyUSCKIIT #30Days CodeChallenge #USCKIIT #Coding Journey #UiPath

5

#Day3 of 30 Days of CodeSprint by USC.KIIT : Mastering Arrays!Hey everyone! I'm excited to share my journey on Day 3 of the 30 Days Coding Challenge, CodeSprint by USC KIIT.88) Merge sorted array27) Remove element 80) Remove duplicates from sorted array 2#CodeSprintbyUSCKIIT #30Days CodeChallenge #USCKIIT #Coding Journey #UiPath

11

2 Comments

#Day2 of 30 Days of CodeSprint by USC.KIIT Hey everyone! I'm excited to share my journey on Day 2 of the 30 Days Coding Challenge, CodeSprint by USC KIIT. Today, I explored the fascinating world of arrays and took on some cool operations in python:26) Remove duplicates from sorted array189) Rotate array: Rotate the array to the right by k steps.55) Jump Game: Return true if you reach the last index of an array where you're initially positioned at the array's first index, and each element in the array represents your max jump length at that position.#CodeSprintbyUSCKIIT #30Days CodeChallenge #USCKIIT #Coding Journey #UiPath

15

#Day1 of 30 Days of CodeSprint by USC.KIIT Hey everyone! I'm excited to share my journey on Day 1 of the 30 Days Coding Challenge, CodeSprint by USC KIIT. Today, I solved some problems on arrays: Returning the majority element in an Array.Best time to buy and sell stock: Returning the max profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.Best time to buy and sell stock 2: Returning the max profit when you can only hold at most one share of the stock at any time.#CodeSprintbyUSCKIIT #30Days CodeChallenge #USCKIIT #Coding Journey #UiPath

13