KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#developer-tools #typescript #dsh #dsh-plugin #ai-agent #codex #ai-agents #deepseek-harness #claude-code #cli #react #mcp

100-days-of-code

★ 8 Open GitHub ↗

100 days of Coding Challenge

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# 100-days-of-code

100 days of Coding Challenge

> Start date : January 1, 2022

# Overview

|Day|Title|Description|Language|Source|Link|
|:-:|:-:|:-:|:-:|:-:|:-:|
|1| Kadane's Algorithm | Find the Maximum Subarray Sum | C++ | <a href="https://leetcode.com/problems/maximum-subarray/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2001">View Code</a>|
|2|Dutch National Flag Algo| Sort 0s, 1s, 2s without sort| C++ | <a href="https://leetcode.com/problems/sort-colors/">Leetcode</a> | <a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2002">View Code</a> |
|3|Last Stone Weight| The smallest weight of the left stone| C++ |<a href="https://leetcode.com/problems/last-stone-weight/">Leetcode</a>| <a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2003">View Code</a>|
|4|Find Whether path exist|check whether there is path from src to dest| C++ |<a href="https://practice.geeksforgeeks.org/problems/find-whether-path-exist5238/1#">GFG</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2004">View Code</a>|
|5|Number of Islands|Find number of islands surrounded by water| C++ |<a href="https://leetcode.com/problems/number-of-islands/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2005">View Code</a>|
|6|Word Search|Finding whether given word is present in grid| C++ |<a href="https://leetcode.com/problems/word-search">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2006">View Code</a>|
|7|Best time to buy and sell stock|Finding the max profit| C++ |<a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2007">View Code</a>|
|8|Sliding window Maximum|Finding max of all subarrays|C++|<a href="https://leetcode.com/problems/sliding-window-maximum/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2008">View Code</a>|
|9|Maximum Twin Sum of a Linked List|Finding the maxsum of a twin in Linkedlist|C++|<a href="https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2009">View Code</a>|
|10|Max area of Island|Finding the maximum area of island|C++|<a href="https://leetcode.com/problems/max-area-of-island/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2010">View Code</a>|
|11|N-Queens Puzzle|Placing N-queens in NxN Chessboard|C++|<a href="https://leetcode.com/problems/n-queens/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2011">View Code</a>|
|12|Top K Frequent Elements|Find K frequent elements in an array|C++|<a href="https://leetcode.com/problems/top-k-frequent-elements/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2012">View Code</a>|
|13|Maximum Number of Coins You Can Get|find max coins you can win in the game|C++|<a href="https://leetcode.com/problems/maximum-number-of-coins-you-can-get/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2013">View Code</a>|
|14|Sieve of Eratosthenes|Find all the prime numbers in a range|C++|<a href="https://practice.geeksforgeeks.org/problems/sieve-of-eratosthenes5242/1#">GFG</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2014">View Code</a>|
|15|Max Increase to Keep City Skyline|maximum total sum that the height of the buildings can be increased|C++|<a href="https://leetcode.com/problems/max-increase-to-keep-city-skyline/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2015">View Code</a>|
|16|Kth smallest element|finding Kth Smallest element|C++|<a href="https://practice.geeksforgeeks.org/problems/kth-smallest-element5635/1#">GFG</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2016">View Code</a>|
|17|Flood Fill|perform colorfill from image source with newcolor |C++|<a href="https://leetcode.com/problems/flood-fill/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2017">View Code</a>|
|18|Validate Binary Search Tree|determine if it is a valid binary search tree|C++|<a href="https://leetcode.com/problems/validate-binary-search-tree/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2018">View Code</a>|
|19|LinkedList cycle|Finding the node where the cycle begins|C++|<a href="https://leetcode.com/problems/linked-list-cycle-ii">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2019">View Code</a>|
|20|Koko Eating Bananas|find k to eat all bananas within h hours|C++|<a href="https://leetcode.com/problems/koko-eating-bananas">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2020">View Code</a>|
|21|Delete Middle Element|Delete middle element of Linkedlist|C++|<a href="https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2021">View Code</a>|
|22|Stone Game|Return true if you are able to win|C++|<a href="https://leetcode.com/problems/stone-game-iv">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2022">View Code</a>|
|23|Sequential Digits|Find all sequential digits in a range|C++|<a href="https://leetcode.com/problems/sequential-digits">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2023">View Code</a>|
|24|Sort characters by frequency|sort the chars in a string by frequency|C++|<a href="https://leetcode.com/problems/sort-characters-by-frequency">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2024">View Code</a>|
|25|Valid Mountain Array|checking the mountain array or not|C++|<a href="https://leetcode.com/problems/valid-mountain-array/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2025">View Code</a>|
|26|Path Sum|return all root-to-leaf paths which equals targetsum|C++|<a href="https://leetcode.com/problems/path-sum-ii">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2026">View Code</a>|
|27|Leaf-similar trees|Return true if both trees have same leaves|C++|<a href="https://leetcode.com/problems/leaf-similar-trees">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2027">View Code</a>|
|28|Delete Leaves with given value|Delete the leaf if it equals target value|C++|<a href="https://leetcode.com/problems/delete-leaves-with-a-given-value/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2028">View Code</a>|
|29|Sum of root to leaf binary|Given root of binary tree find sum of binary nums from root to leaf|C++|<a href="https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2029">View Code</a>|
|30|Rotate Array|Rotate the integer array k times|C++|<a href="https://leetcode.com/problems/rotate-array/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2030">View Code</a>|
|31|Richest Customer Wealth|Return the richest customer wealth|C++|<a href="https://leetcode.com/problems/richest-customer-wealth/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2031">View Code</a>|
|32|Odd Even Linkedlist|Group odd and even indices together|C++|<a href="https://leetcode.com/problems/odd-even-linked-list">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2032">View Code</a>|
|33|Minimum number of steps to make Anagram|find min steps to make anagram|C++|<a href="https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2033">View Code</a>|
|34|Sum Tree|Return true if every node in tree has sum of its child|C++|<a href="https://practice.geeksforgeeks.org/problems/sum-tree/1/#">GFG</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2034">View Code</a>|
|35|Contiguous Array|Return the max length of contiguous array with equal 1s and 0s|C++|<a href="https://leetcode.com/problems/contiguous-array">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2035">View Code</a>|
|36|Remove Duplicates from sorted array|return unique elements list|C++|<a href="https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2036">View Code</a>|
|37|Zigzag Conversion|Return zigzag of the given string|C++|<a href="https://leetcode.com/problems/zigzag-conversion">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2037">View Code</a>|
|38|Sum of Digits of String After Convert|Return the resultant sum after performing|C++|<a href="https://leetcode.com/problems/sum-of-digits-of-string-after-convert/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2038">View Code</a>|
|39|K-diff Pairs in an Array|Return the number of unique k-diff pairs in the array|C++|<a href="https://leetcode.com/problems/k-diff-pairs-in-an-array/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2039">View Code</a>|
|40|Subarray Sum Equals K|Return the total number of continuous subarrays whose sum equals to k|C++|<a href="https://leetcode.com/problems/subarray-sum-equals-k/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2040">View Code</a>|
|41|Subsets|Return all possible subsets|C++|<a href="https://leetcode.com/problems/subsets/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2041">View Code</a>|
|42|Sum Root to Leaf numbers|Return total sum of root-to-leaf numbers|C++|<a href="https://leetcode.com/problems/sum-root-to-leaf-numbers/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2042">View Code</a>|
|43|Single number|Find the element appearing only once|C++|<a href="https://leetcode.com/problems/single-number">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2043">View Code</a>|
|44|Swap nodes in Pairs|swap every two adjacent nodes and return its head|C++|<a href="https://leetcode.com/problems/swap-nodes-in-pairs/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2044">View Code</a>|
|45|Combination sum| return a list of all unique combinations of nums that sums to target|C++|<a href="https://leetcode.com/problems/combination-sum/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2045">View Code</a>|
|46|Remove K digits|return the smallest number after removing k digits|C++|<a href="https://leetcode.com/problems/remove-k-digits">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2046">View Code</a>|
|47|Longest substring without repeating chars|Return longest substring with no repeating chars|C++|<a href="https://leetcode.com/problems/longest-substring-without-repeating-characters/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2047">View Code</a>|
|48|Remove covered intervals|Return the number of remaining intervals|C++|<a href="https://leetcode.com/problems/remove-covered-intervals/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2048">View Code</a>|
|49|Sort characters by Frequency|Return sorted string based on frequency|C++|<a href="https://leetcode.com/problems/sort-characters-by-frequency">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2049">View Code</a>|
|50|Excel sheet column number|Return Excel sheet's corresponding column number|C++|<a href="https://leetcode.com/problems/excel-sheet-column-number">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2050">View Code</a>|
|51|Average of Levels in Binary Tree|Return the average value of the nodes on each level|C++|<a href="https://leetcode.com/problems/average-of-levels-in-binary-tree/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2051">View Code</a>|
|52|Sort List|Sort the Given Linkedlist|C++|<a href="https://leetcode.com/problems/sort-list/submissions/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2052">View Code</a>|
|53|Compare Version Number|Compare given two version numbers|C++|<a href="https://leetcode.com/problems/compare-version-numbers">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2053">View Code</a>|
|54|Add Two numbers|Return sum of two linkedlist|C++|<a href="https://leetcode.com/problems/add-two-numbers/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2054">View Code</a>|
|55|Maximum Width of Binary Tree|Return the maximum width of the given tree|C++|<a href="https://leetcode.com/problems/maximum-width-of-binary-tree/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2055">View Code</a>|
|56|Summary Ranges|Return the smallest sorted list of ranges|C++|<a href="https://leetcode.com/problems/summary-ranges">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2056">View Code</a>|
|57|Maximum Product of Two Elements|Return the maximum value of nums in an array|C++|<a href="https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2057">View Code</a>|
|58|Is subsequence|Check whether given str is subsequence or not|C++|<a href="https://leetcode.com/problems/is-subsequence/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2058">View Code</a>|
|59|Arithmetic slices|return the number of arithmetic subarrays of nums|C++|<a href="https://leetcode.com/problems/arithmetic-slices">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2059">View Code</a>|
|60|Arithmetic slices|return the number of arithmetic subarrays of nums|C++|<a href="https://leetcode.com/problems/arithmetic-slices">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2060">View Code</a>|
|61|Delete and Earn|Return the maximum number of points you can earn|C++|<a href="https://leetcode.com/problems/delete-and-earn/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2061">View Code</a>|
|62|Different ways to add parantheses|return all possible results of adding parantheses|C++|<a href="">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2062">View Code</a>|
|63|Merge Two sorted Lists|Merge the given two sorted linkedlists|C++|<a href="https://leetcode.com/problems/merge-two-sorted-lists">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2063">View Code</a>|
|64|Most Frequent Number following key|Return the target with the maximum count|C++|<a href="https://leetcode.com/problems/most-frequent-number-following-key-in-an-array/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2064">View Code</a>|
|65|Remove duplicates from list|Delete all the duplicate nodes|C++|<a href="https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/">Leetcode</a>|<a href="https://github.com/gokulapap/100-days-of-code/tree/main/Day%2065">View Code</a>|
|66||||||
|67||||||
|68||||||
|69||||||
|70||||||
|71||||||
|72||||||
|73||||||
|74||||||
|75||||||
|76||||||
|77||||||
|78||||||
|79||||||
|80||||||
|81||||||
|82||||||
|83||||||
|84||||||
|85||||||
|86||||||
|87||||||
|88||||||
|89||||||
|90||||||
|91||||||
|92||||||
|93||||||
|94||||||
|95||||||
|96||||||
|97||||||
|98||||||
|99||||||
|100||||||

100-days-of-code

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README