Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/bhavyalalchandani/11days_of_recursion_dnc_bactracking

This repository tracks my daily progress through 11 Days. It is meant to have a precise log of various coding exercises I completed, observing the growth of my problem-solving skills and coding proficiency. It stands as a testament to the growth achieved by taking this intensive coding challenge to build coding habit by taking one step at a time.
https://github.com/bhavyalalchandani/11days_of_recursion_dnc_bactracking

backtracking divide-and-conquer dsa gfg gfg-solutions java problem-solving recursion

Last synced: 25 days ago
JSON representation

This repository tracks my daily progress through 11 Days. It is meant to have a precise log of various coding exercises I completed, observing the growth of my problem-solving skills and coding proficiency. It stands as a testament to the growth achieved by taking this intensive coding challenge to build coding habit by taking one step at a time.

Awesome Lists containing this project

README 

        
# 11Days_of_Recursion_DnC_Bactracking



## Overview



This repository documents my journey through the 11DaysOfCoding Challenge. I took this challenge on the 28th of November as part of the #DrGViswanathan initiative by VIT Bhopal University, this initiative allows us to share our small as well as greater milestones uniquely. During this challenge, I committed to solving at least one coding problem each day for 11 days on Platforms like Geeks for Geeks and LeetCode, fostering a consistent coding routine.



## Structure:



* Each day's solution is organized in separate files, each file named after the problem.

* The code is written in Java.

* Clear and concise comments accompany the code for better understanding.



## Why 11DaysOfCoding?



Participating in the 11DaysOfCoding Challenge allowed me to maintain small yet effective coding streaks, establishing a consistent routine. This practice not only enhanced my problem-solving skills but also prepared me for technical interviews during placement initiatives. During these 11 days, I mainly focused on Recursion, Backtracking as well as Divide and Conquer.



## Links to the Problems are as follows:

* https://practice.geeksforgeeks.org/problems/print-diagonally4331/0

* https://practice.geeksforgeeks.org/problems/minimum-element-in-a-sorted-and-rotated-array3611/0

* https://practice.geeksforgeeks.org/problems/find-all-possible-paths-from-top-to-bottom/0

* https://practice.geeksforgeeks.org/problems/merge-sort/0

* https://practice.geeksforgeeks.org/problems/quick-sort/0

* https://practice.geeksforgeeks.org/problems/friends-pairing-problem5425/0

* https://practice.geeksforgeeks.org/problems/search-in-a-rotated-array4618/0

* https://practice.geeksforgeeks.org/problems/allocate-minimum-number-of-pages0937/0

* https://practice.geeksforgeeks.org/problems/longest-possible-route-in-a-matrix-with-hurdles/0

* https://practice.geeksforgeeks.org/problems/inversion-of-array-1587115620/0

* https://practice.geeksforgeeks.org/problems/k-th-element-of-two-sorted-array1317/0

* https://practice.geeksforgeeks.org/problems/permutations-of-a-given-string2041/0

* https://practice.geeksforgeeks.org/problems/n-queen-problem0315/0

* https://practice.geeksforgeeks.org/problems/solve-the-sudoku-1587115621/0