This repository contains all the programs I have completed for the Daily Programming Challenge 2024 conducted by WISDOM SPROUTS - IT Training Lab. The challenge runs from September 1st to September 30th
- Event Duration:
to
- Organizer: Wisdom Sprouts - IT Training Lab
- Challenge Format: Daily programming tasks designed to enhance coding skills and problem-solving abilities.
- Python
- Data Structures, Algorithms
- C
- C++
- Advanced Algorithms
- Problem-solving techniques
- Daily Challenges:
- Each day's challenge will have its own directory with the date containing:
- The problem statement .
- My solution code.
- Any additional notes or comments.
- Each day's challenge will have its own directory with the date containing:
- Challenge: [Finding the kth largest number in an array without sorting]
- Language specification: None
- Discreption:
-
You are given an unsorted array of integers and a positive integer K. Your task is to find the Kth largest element in the array. The Kth largest element is the element that would appear in the Kth position if the array were sorted in descending order.
You need to implement a function that returns this Kth largest element without explicitly sorting the entire array.
Example arr = [3, 2, 1, 5, 6, 4] k = 2 Output: 5
-
- Language used: C
- Solution: Link to the Solution Code
-
Challenge: [Finding the median of an array with out sorting]
-
Language specification: None
-
Discreption:
-
Practice Question 2 You are given an unsorted array of integers. Your task is to find the median of the array. The median is the middle value in an ordered list of numbers. If the list has an even number of elements, the median is the average of the two middle numbers. Implement a function that returns the median of the array without explicitly sorting the entire array.
Example : arr = [3,2,1,4,5]; output = 3
arr = [7,10,4,3,20,15] output = 8.5
-
-
Language used: C
-
Solution: Link to the Solution Code
-
Challenge: [Sorting an array containing only 0's ,1's and 2's]
-
Language specification: Any
-
Discreption:
- Problem: Sort an Array of 0s, 1s, and 2s. You are given an array arr consisting only of 0s, 1s, and 2s. The task is to sort the array in increasing order in linear time (i.e., O(n)) without using any extra space. This means you need to rearrange the array in-place.
- Input: An integer array arr of size n where each element is either 0, 1, or 2. Example : arr = [0, 1, 2, 1, 0, 2, 1, 0]
- Output: The sorted array, arranged in increasing order of 0s, 1s, and 2s. Example : [0, 0, 0, 1, 1, 1, 2, 2]
- Clink me for Detailed problem statement link
-
Language used: C
-
My Solution: Link to the Solution Code
-
Challenge: [Finding missing numbers from set of consiquetive numbers in an array]
-
Language specification: Any
-
Discreption:
- Problem: Find the missing number You are given an array arr containing n-1 distinct integers. The array consists of integers taken from the range 1 to n, meaning one integer is missing from this sequence. Your task is to find the missing integer.
- Input: An integer array arr of size n-1 where the elements are distinct and taken from the range 1 to n. Example : arr = [1, 2, 4, 5]
- Output: Return the missing integer from the array. Example : "Missing Number : 3"
- Clink me for Detailed problem statement link
-
Language used: C
-
My Solution: Link to the Solution Code
-
Challenge: [Finding the repeated elements/duplicates in the given array]
-
Language specification: Any
-
Discreption:
- Problem: Find the duplicate number You are given an array arr containing n+1 integers, where each integer is in the range [1, n] inclusive. There is exactly one duplicate number in the array, but it may appear more than once. Your task is to find the duplicate number without modifying the array and using constant extra space.
- Input: An integer array arr of size n+1, where each element is an integer in the range [1, n]. Example: arr = [3, 1, 3, 4, 2]
- Output: Return the duplicate integer present in the array. Example : Duplicate Number : 3
- Clink me for Detailed problem statement link
-
Language used: C
-
My Solution: Link to the Solution Code
-
Info:
- DAY 3 question to find the duplocate is done , but it has a comlexity of o(n^2), There is a method called floids circle which has the complexity O(1); since the question didnot mention about complexity in time, i have done this with the complexity of O(n^2) and soon there will be a update with new code.
-
Challenge: [Merging Two Sorted Arrays]
-
Language specification: Any
-
Discreption:
-
Problem: You are given two sorted arrays arr1 of size m and arr2 of size n. Your task is to merge these two arrays into a single sorted array without using any extra space (i.e., in-place merging). The elements in arr1 should be merged first, followed by the elements of arr2, resulting in both arrays being sorted after the merge.
-
Input: Two sorted integer arrays arr1 of size m and arr2 of size n.
Example: arr1 = [1, 3, 5, 7] arr2 = [2, 4, 6, 8]
-
Output: Both arr1 and arr2 should be sorted after the merge. Since you cannot use extra space, the final result will be reflected in arr1 and arr2. Example : arr1 = [1, 2, 3, 4] arr2 = [5, 6, 7, 8
-
-
Language used: C
-
My Solution: Link to the Solution Code
-
Challenge: [Find the Leaders in an Array]
-
Language specification: Any
-
Discreption:
-
Problem: You are given an integer array arr of size n. An element is considered a leader if it is greater than all the elements to its right. Your task is to find all such leader elements in the array.
-
Input: An integer array arr of size n.
Example: arr = [16, 17, 4, 3, 5, 2]
-
Output: Return an array containing all the leader elements in the order in which they appear in the original array. Example : Leaders: [17, 5, 2]
-
-
Language used: C
-
My Solution: Link to the Solution Code
-
Challenge: [Find All Subarrays with Zero Sum]
-
Language specification: Any
-
Discreption:
-
Problem: You are given an integer array arr of size n. Your task is to find all the subarrays whose elements sum up to zero. A subarray is defined as a contiguous part of the array, and you must return the starting and ending indices of each subarray.
-
Input: An integer array arr of size n where n represents the number of elements in the array.
Example: [1, 2, -3, 3, -1, 2]
-
Output:
- Return a list of tuples, where each tuple contains two integers. The starting index (0-based) of the subarray. The ending index (0-based) of the subarray.
- The output should list all subarrays that sum to zero. If no such subarrays are found, return an empty list. Example : [(0, 2), (1, 3)]
-
-
Language used: C
-
My Solution: Link to the Solution Code
-
Challenge: [Trapping Rain Water]
-
Language specification: Any
-
Discreption:
-
Problem: You are given an array height[] of non-negative integers where each element represents the height of a bar in a histogram-like structure. These bars are placed next to each other, and the width of each bar is 1 unit. When it rains, water gets trapped between the bars if there are taller bars on both the left and right of the shorter bars. The task is to calculate how much water can be trapped between these bars after the rain.
-
Input: An integer array height[] where each element represents the height of a bar in the histogram.
Example: [0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1]
-
Output:
- An integer representing the total units of water that can be trapped between the bars. Example : Output: 6
-
This code is a challange in leetcode link
-
-
Language used: C
-
My Solution: Link to the Solution Code
-
Challenge: [Reverse a String Word by Word]
-
Language specification: Any
-
Discreption:
-
Problem: You are given a string s that consists of multiple words separated by spaces. Your task is to reverse the order of the words in the string. Words are defined as sequences of non-space characters. The output string should not contain leading or trailing spaces, and multiple spaces between words should be reduced to a single space.
-
Input: A string s of length n (1 ≤ n ≤ 10^4) consisting of letters, digits, punctuation, and spaces.
Example: the sky is blue
-
Output:
- A string where the words in s are reversed, with a single space separating the words, and no leading or trailing spaces. Example : "blue is sky the"
-
This code is a challange in leetcode link
-
-
Language used: Python
-
My Solution: Link to the Solution Code
-
Challenge: [Longest Common Prefix]
-
Language specification: Any
-
Discreption:
-
Problem: You are given an array of strings strs[], consisting of lowercase letters. Your task is to find the longest common prefix shared among all the strings. If there is no common prefix, return an empty string "".
-
Input: An array of strings strs[] where each string consists of lowercase English letters.
Example: strs[] = ["flower", "flow", "flight"]
-
Output:
- A string representing the longest common prefix. If no common prefix exists, return an empty string "". Example : "fl"
-
-
Language used: Python
-
My Solution: Link to the Solution Code
I'll be continually learning and developing new skills throughout this event, and I'm excited to share this journey with you.
- LinkedIn:
- GitHub:
- E-Mail:
https://docs.google.com/document/d/13IzrCQA_ns6SJdwHDV1nIKo3-zCpPFn9b72sXWUyNDo/edit?usp=sharin Feel free to connect with me on LinkedIn or explore my other projects on GitHub!
