Skip to content

suyashbarad/DSA_Daily

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

370 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

• DSA Daily — My Daily Coding Practice

Welcome to my DSA Daily Repository, where I solve one DSA problem every day using C language. This repo helps me build strong logic, consistency, and a solid foundation for Data Structures & Algorithms.

Day File Name Problem Topic Language Status
Day 01 day01_two_sum_target.c Gives two sum indices of target Arrays / Hashing C ✅ Completed
Day 02 day02_largestNo.c Largest Number Arrays C ✅ Completed
Day 03 day03_palindrome.c Palindrome Check Strings C ✅ Completed
Day 04 day04_Reverse.c Reverse String Strings C ✅ Completed
Day 05 day05_elemFreq.c Frequency of Elements Arrays / Hashing C ✅ Completed
Day 06 day06_ZeroToEnd.c Move Zeroes to End Two Pointers C ✅ Completed
Day 07 day07_secondLargest.c Finding the second largest (Longer) Arrays C ✅ Completed
Day 08 day08_bubbleSorting.c Sorting using Bubble Sort Arrays / Sorting C ✅ Completed
Day 09 day09_SelectionSorting.c Sorting using Selection Sort Arrays / Sorting C ✅ Completed
Day 10 day10_InsertionSorting.c Sorting using Insertion Sort Arrays / Sorting C ✅ Completed
Day 11 day11_RemoveDuplicate_sorted.c Remove Sorted Duplicates Arrays C ✅ Completed
Day 12 day12_RemoveDuplicate_Unsorted.c Remove Unsorted Duplicates Arrays / Sorting C ✅ Completed
Day 13 day13_secondLargest_shorter.c Finding the second largest (Shorter) Arrays C ✅ Completed
Day 14 day14_LongestCommon_Prefix.c Finding the Longest Common Prefix Strings C ✅ Completed
Day 15 day15_Missing_integer.c Finding Missing Number between 1 to N Arrays / Math C ✅ Completed
Day 16 day16_Binary_Search_Tree.c Performing BST Operations Trees / Structs C ✅ Completed
Day 17 day17_inorder.c Inorder Traversal (Recursive & Non-Recursive) Trees / Structs C ✅ Completed
Day 18 day18_preorder.c Preorder Traversal (Recursive & Non-Recursive) Trees / Structs C ✅ Completed
Day 19 day19_postorder.c Postorder Traversal (Recursive) Trees / Structs C ✅ Completed
Day 20 day20_intersection.c Intersection of Two Arrays Arrays / Sorting C ✅ Completed
Day 21 day21_patterns.c Star Patterns Loops C ✅ Completed
Day 22 day22_NumberPatterns.c Number Patterns Loops C ✅ Completed
Day 23 day23_majority_mooresAlgo.c Majority Element (Moore’s Algorithm) DS / Loops C ✅ Completed
Day 24 day24_Missing_XOR.c Finding Missing Number using XOR Math / Loops C ✅ Completed
Day 25 day25_longest_subarrayPrefix.c Finds Longest Subarray Prefix Loops C ✅ Completed
Day 26 day26_infix_postfix.c Infix to Postfix Conversion Functions / DS C ✅ Completed
Day 27 day27_infix_prefix.c Infix to Prefix Conversion Functions / DS C ✅ Completed
Day 28 day28_anagram.c Checks Two Strings are Anagram or Not Strings / Loops C ✅ Completed
Day 29 day29_valid_paranthesis.c Checks if Parenthesis are Balanced Functions / Loops C ✅ Completed
Day 30 day30_longest_Substring.c Finds Longest Continuous Substring Strings / Loops C ✅ Completed
Day 31 day31_nonRepeating_char.c Finds First Non-Repeating Character Strings / Loops C ✅ Completed
Day 32 day32_nextgreater.c Finds Next Greater Element Arrays / Loops C ✅ Completed
Day 33 day33_subarray_GivenSum.c Finds Subarray with Given Sum Arrays / Loops C ✅ Completed
Day 34 day34_CountSubarray_GivenSum.c Counts Subarrays with Given Sum Arrays / Loops C ✅ Completed
Day 35 day35_rotateMatrix.c Rotates Matrix by 90 Degrees Matrix / Functions C ✅ Completed
Day 36 day36_longestStreak.c Finds Longest Streak in Array Arrays / Loops C ✅ Completed
Day 37 day37_leadersArray.c Finds Leaders in Array Arrays / Loops C ✅ Completed
Day 38 day38_spiralMatrix.c Prints Matrix in Spiral Order Matrix / Functions C ✅ Completed
Day 39 day39_shortest_subarray.c Finds Shortest Subarray with Sum = K Arrays / Loops C ✅ Completed
Day 40 day40_gcd.c Finds GCD of Two Integers Math C ✅ Completed
Day 41 day41_two_sum_target.cpp Return two numbers whose sum is target -> C++ Array / Loops C++ ✅ Completed
Day 42 day42_largestNo.cpp Returns Largest number from the array -> C++ Array / Loops C++ ✅ Completed
Day 43 day43_palindrome.cpp Tells if the Array is palindrome or not -> C++ Array / Loops C++ ✅ Completed
Day 44 day44_reverseArr_str.cpp Reverses the string and Array -> C++ Array / Strings C++ ✅ Completed
Day 45 day45_elemFreq.cpp Counts the element frequency -> C++ Array / Loops C++ ✅ Completed
Day 46 day46_ZeroToEnd.cpp Moves all zeroes to end -> C++ Array / Loops C++ ✅ Completed
Day 47 day47_secondLargest.cpp Finds the second largest number -> C++ Array / Loops C++ ✅ Completed
Day 48 day48_OOP_Area.cpp Finds area of Sq, rect, tri, circle -> C++ -> OOP Class / Functions C++(OOP) ✅ Completed
Day 49 day49_OOP_StudentInfo.cpp Takes and Display StudentInfo -> C++ -> OOP Class / Functions C++(OOP) ✅ Completed
Day 50 day50_pascalsTriangle.cpp Prints pascals triangle -> C++ loops / core C++ ✅ Completed
Day 51 day51_MergeSort.cpp Sorting using Merge Sort -> C++ functions / core C++ ✅ Completed
Day 52 day52_BankSystem_OOP.cpp Manages Bank system -> C++ -> OOP functions / class C++(OOP) ✅ Completed
Day 53 day53_quickSort.cpp Sorting using Quick Sort -> C++ functions / Sorting C++ ✅ Completed
Day 54 day54_OOP_quickSort.cpp Sorting using Quick Sort -> C++ --> OOP functions / Class C++(OOP) ✅ Completed
Day 55 day55_LinearSearch.cpp Searching using linear Search -> C++ --> OOP functions / Class C++(OOP) ✅ Completed
Day 56 day56_BinarySearch.cpp Searching using Binary Search (Recursive) -> C++ functions / loops C++ ✅ Completed
Day 57 day57_BinarySearch_NonRec.cpp Searching using Binary Search (Non-Rec) -> C++ functions / loops C++ ✅ Completed
Day 58 day58_AdjecencyMatrix.cpp Finds the Adjecency matrix of a graph -> C++ Matrix / loops C++ ✅ Completed
Day 59 day59_knapsack_fractional.cpp Finds max profit using Knapsack Algorithm -> C++ DS / Functions C++ ✅ Completed
Day 60 day60_knapsack.cpp Knapsack Algorithm (Sorting Included)-> C++ DS / Functions C++ ✅ Completed
Day 61 day61_primsAlgo.cpp Prims Algorithm (Sortest path)-> C++ DS / Functions C++ ✅ Completed
Day 62 - Coming Soon

• Folder Structure

DSA_daily/
├── day01_two_sum_target.c
├── day02_largestNo.c
├── day03_palindrome.c
├── day04_ReverseString.c
├── day05_elemFreq.c
├── day06_ZeroToEnd.c
├── day07_secondLargest.c
├── day08_bubbleSorting.c
├── day09_SelectionSorting.c
├── day10_InsertionSorting.c
├── day11_RemoveDuplicate_sorted.c
├── day12_RemoveDuplicate_Unsorted.c
├── day13_secondLargest_shorter.c
├── day14_LongestCommon_Prefix.c
├── day15_Missing_integer.c
├── day16_Binary_Search_Tree.c
├── day17_inorder.c
├── day18_preorder.c
├── day19_postorder.c
├── day20_intersection.c
├── day21_patterns.c
├── day22_NumberPatterns.c
├── day23_majority_mooresAlgo.c
├── day24_Missing_XOR.c
├── day25_longest_subarrayPrefix.c
├── day26_infix_postfix.c
├── day27_infix_prefix.c
├── day28_anagram.c
├── day29_valid_paranthesis.c
├── day30_longest_Substring.c
├── day31_nonRepeating_char.c
├── day32_nextgreater.c
├── day33_subarray_GivenSum.c
├── day34_CountSubarray_GivenSum.c
├── day35_rotateMatrix.c
├── day36_longestStreak.c
├── day37_leadersArray.c
├── day38_spiralMatrix.c
├── day39_shortest_subarray.c
├── day40_gcd.c
├── day41_two_sum_target.cpp
├── day42_largestNo.cpp
├── day43_palindrome.cpp
├── day44_reverseArr_str.cpp
├── day45_elemFreq.cpp
├── day46_ZeroToEnd.cpp
├── day47_secondLargest.cpp
├── day48_OOP_Area.cpp
├── day49_OOP_StudentInfo.cpp
├── day50_pascalsTriangle.cpp
├── day51_MergeSort.cpp
├── day52_BankSystem_OOP.cpp
├── day53_quickSort.cpp
├── day54_OOP_quickSort.cpp
├── day55_LinearSearch.cpp
├── day56_BinarySearch.cpp
├── day57_BinarySearch_NonRec.cpp
├── day58_AdjecencyMatrix.cpp
├── day59_knapsack_fractional.cpp
├── day60_knapsack.cpp
├── day61_primsAlgo.cpp
└── DSA_Input_Output.txt
└── README.md

• Goals of This Repository

Build daily coding discipline

Strengthen fundamentals of C and C++ (Afterwords)

Understand DSA concepts with real-life analogies

Improve problem-solving patterns

Prepare for placements & competitive programming

• Learning Strategy

✔ Solve one problem every day

✔ Use clean, modular code

✔ Add comments explaining logic

✔ Track progress using tables

✔ Learn DSA concepts with analogies & memory tricks

#Author

Suyash Sachin Barad
📍 Pune, Maharashtra, India
🔗 GitHub | LinkedIn | HackerRank


Releases

No releases published

Packages

 
 
 

Contributors