{"id":15111520,"url":"https://github.com/ichowdhury01/coding-exercises","last_synced_at":"2026-01-18T11:42:04.780Z","repository":{"id":239671848,"uuid":"800221242","full_name":"IChowdhury01/Coding-Exercises","owner":"IChowdhury01","description":"Solutions to various coding exercises.","archived":false,"fork":false,"pushed_at":"2024-05-17T23:30:56.000Z","size":120,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-05-18T10:58:54.458Z","etag":null,"topics":["algorithms-and-data-structures","coding-challenges","databases","exercise-solutions","postgresql","python3"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/IChowdhury01.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-05-13T23:35:14.000Z","updated_at":"2024-05-30T03:52:40.300Z","dependencies_parsed_at":"2024-05-30T03:52:37.532Z","dependency_job_id":"2fdff80c-c2f2-42a9-b135-6314d00ba19b","html_url":"https://github.com/IChowdhury01/Coding-Exercises","commit_stats":null,"previous_names":["ichowdhury01/coding-exercises"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IChowdhury01%2FCoding-Exercises","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IChowdhury01%2FCoding-Exercises/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IChowdhury01%2FCoding-Exercises/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IChowdhury01%2FCoding-Exercises/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/IChowdhury01","download_url":"https://codeload.github.com/IChowdhury01/Coding-Exercises/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247371326,"owners_count":20928185,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms-and-data-structures","coding-challenges","databases","exercise-solutions","postgresql","python3"],"created_at":"2024-09-26T00:20:42.037Z","updated_at":"2026-01-18T11:42:04.734Z","avatar_url":"https://github.com/IChowdhury01.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"Coding Exercises\n========\n\n### Algorithms\n\n| Problem | Solution | Difficulty |\n| :-----: | :--------: | :----------: |\n|[Coin Change](https://leetcode.com/problems/coin-change) | [Python](./Algorithms/Python/1D_Dynamic_Programming/Coin_Change.py)|Medium|\n|[Decode Ways](https://leetcode.com/problems/decode-ways/description/) | [Python](./Algorithms/Python/1D_Dynamic_Programming/Decode_Ways.py)|Medium|\n|[House Robber](https://leetcode.com/problems/house-robber/description/) | [Python](./Algorithms/Python/1D_Dynamic_Programming/House_Robber.py)|Medium|\n|[Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/description/) | [Python](./Algorithms/Python/2D_Dynamic_Programming/Longest_Common_Subsequence.py)|Medium|\n|[Unique Paths](https://leetcode.com/problems/unique-paths/) | [Python](./Algorithms/Python/2D_Dynamic_Programming/Unique_Paths.py)|Medium|\n|[Alien Dictionary](https://leetcode.com/problems/alien-dictionary/) | [Python](./Algorithms/Python/Advanced_Graphs/Alien_Dictionary.py)|Hard|\n|[Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) | [Python](./Algorithms/Python/Arrays_and_Hashing/Encode_and_Decode_Strings.py)|Medium|\n|[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | [Python](./Algorithms/Python/Arrays_and_Hashing/Longest_Consecutive_Sequence.py)|Medium|\n|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | [Python](./Algorithms/Python/Arrays_and_Hashing/Valid_Sudoku.py)|Medium|\n|[Combination Sum](https://leetcode.com/problems/combination-sum/description/) | [Python](./Algorithms/Python/Backtracking/Combination_Sum.py)|Medium|\n|[N Queens](https://leetcode.com/problems/n-queens/) | [Python](./Algorithms/Python/Backtracking/N_Queens.py)|Hard|\n|[Word Search](https://leetcode.com/problems/word-search/) | [Python](./Algorithms/Python/Backtracking/Word_Search.py)|Medium|\n|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | [Python](./Algorithms/Python/Binary_Search/Find_Minimum_in_Rotated_Sorted_Array.py)|Medium|\n|[Median of 2 Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [Python](./Algorithms/Python/Binary_Search/Median_of_Two_Sorted_Arrays.py)|Hard|\n|[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/description/) | [Python](./Algorithms/Python/Binary_Search/Serialize_and_Deserialize_Binary_Tree.py)|Hard|\n|[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/description/) | [Python](./Algorithms/Python/Bit_Manipulation/Number_of_1_Bits.py)|Easy|\n|[Reverse Bits](https://leetcode.com/problems/reverse-bits/) | [Python](./Algorithms/Python/Bit_Manipulation/Reverse_Bits.py)|Easy|\n|[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/description/) | [Python](./Algorithms/Python/Bit_Manipulation/Sum_of_Two_Integers.py)|Medium|\n|[Clone Graph](https://leetcode.com/problems/clone-graph/description/) | [Python](./Algorithms/Python/Graphs/Clone_Graph.py)|Medium|\n|[Course Schedule](https://leetcode.com/problems/course-schedule/) | [Python](./Algorithms/Python/Graphs/Course_Schedule.py)|Medium|\n|[Max Area of Island](https://leetcode.com/problems/max-area-of-island/description/) | [Python](./Algorithms/Python/Graphs/Max_Area_of_Island.py)|Medium|\n|[Jump Game](https://leetcode.com/problems/jump-game/) | [Python](./Algorithms/Python/Greedy/Jump_Game.py)|Medium|\n|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [Python](./Algorithms/Python/Greedy/Maximum_Subarray.py)|Medium|\n|[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/description/) | [Python](./Algorithms/Python/Heaps/Find_Median_From_Data_Stream.py)|Hard|\n|[K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | [Python](./Algorithms/Python/Heaps/K_Closest_Points_to_Origin.py)|Medium|\n|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/description/) | [Python](./Algorithms/Python/Heaps/Kth_Largest_Element_in_an_Array.py)|Medium|\n|[Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | [Python](./Algorithms/Python/Intervals/Meeting_Rooms_II.py)|Medium|\n|[Merge Intervals](https://leetcode.com/problems/merge-intervals/description/) | [Python](./Algorithms/Python/Intervals/Merge_Intervals.py)|Medium|\n|[Non-Overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/description/) | [Python](./Algorithms/Python/Intervals/Non_Overlapping_Intervals.py)|Medium|\n|[LRU Cache](https://leetcode.com/problems/lru-cache/) | [Python](./Algorithms/Python/Linked_Lists/LRU_Cache.py)|Medium|\n|[Merge K Sorted Linked Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | [Python](./Algorithms/Python/Linked_Lists/Merge_K_Sorted_Lists.py)|Hard|\n|[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/description/) | [Python](./Algorithms/Python/Linked_Lists/Reverse_Nodes_in_K_Group.py)|Hard|\n|[Rotate Image](https://leetcode.com/problems/rotate-image/description/) | [Python](./Algorithms/Python/Math_and_Geometry/Rotate_Image.py)|Medium|\n|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | [Python](./Algorithms/Python/Math_and_Geometry/Set_Matrix_Zeros.py)|Medium|\n|[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/description/) | [Python](./Algorithms/Python/Math_and_Geometry/Spiral_Matrix.py)|Medium|\n|[Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | [Python](./Algorithms/Python/Sliding_Window/Longest_Repeating_Character_Replacement.py)|Medium|\n|[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | [Python](./Algorithms/Python/Sliding_Window/Minimum_Window_Substring.py)|Hard|\n|[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | [Python](./Algorithms/Python/Sliding_Window/Sliding_Window_Maximum.py)|Hard|\n|[Basic Calculator](https://leetcode.com/problems/basic-calculator/) | [Python](./Algorithms/Python/Stack/Basic_Calculator.py)|Hard|\n|[Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) | [Python](./Algorithms/Python/Stack/Daily_Temperatures.py)|Medium|\n|[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) | [Python](./Algorithms/Python/Stack/Largest_Rectangle_in_Histogram.py)|Hard|\n|[Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | [Python](./Algorithms/Python/Trees/Binary_Tree_Maximum_Path_Sum.py)|Medium|\n|[Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/) | [Python](./Algorithms/Python/Trees/Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.py)|Medium|\n|[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [Python](./Algorithms/Python/Trees/Lowest_Common_Ancestor_of_a_Binary_Search_Tree.py)|Medium|\n|[Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/description/) | [Python](./Algorithms/Python/Tries/Design_Add_and_Search_Words_Data_Structure.py)|Medium|\n|[Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/description/) | [Python](./Algorithms/Python/Tries/Implement_Trie.py)|Medium|\n|[Word Search II](https://leetcode.com/problems/word-search-ii/) | [Python](./Algorithms/Python/Tries/Word_Search_II.py)|Hard|\n|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | [Python](./Algorithms/Python/Two_Pointers/Container_With_Most_Water.py)|Medium|\n|[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | [Python](./Algorithms/Python/Two_Pointers/Trapping_Rain_Water.py)|Hard|\n|[Two Sum II - Input Array Is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | [Python](./Algorithms/Python/Two_Pointers/Two_Sum_II.py)|Medium|\n|[Design Twitter](https://leetcode.com/problems/design-twitter/) | [Python](./Algorithms/Python/Heaps/Design_Twitter.py)|Medium|\n|[Rotten Oranges](https://leetcode.com/problems/rotting-oranges/) | [Python](./Algorithms/Python/Graphs/Rotten_Oranges.py)|Medium|\n|[Palindrome Number](https://leetcode.com/problems/palindrome-number/) | [Python](./Algorithms/Python/Math_and_Geometry/Palindrome_Number.py)|Easy|\n|[Redundant Connection](https://leetcode.com/problems/redundant-connection/) | [Python](./Algorithms/Python/Graphs/Redundant_Connection.py)|Medium|\n|[Word Ladder](https://leetcode.com/problems/word-ladder/) | [Python](./Algorithms/Python/Graphs/Word_Ladder.py)|Hard|\n|[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Python](./Algorithms/Python/1D_Dynamic_Programming/Partition_Equal_Subset_Sum.py)|Medium|\n|[Reverse Integer](https://leetcode.com/problems/reverse-integer/description/) | [Python](./Algorithms/Python/Bit_Manipulation/Reverse_Integer.py)|Medium|\n|[Minimum Interval to Include Each Query](https://leetcode.com/problems/minimum-interval-to-include-each-query/) | [Python](./Algorithms/Python/Intervals/Minimum_Interval_to_Include_Each_Query.py)|Hard|\n|[Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/) | [Python](./Algorithms/Python/Trees/Binary_Search_Tree_to_Greater_Sum_Tree.py)|Medium|\n|[Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/description/) | [Python](./Algorithms/Python/Arrays_and_Hashing/Minimum_Absolute_Difference.py)|Easy|\n|[4 Sum](https://leetcode.com/problems/4sum/) | [Python](./Algorithms/Python/Two_Pointers/4_Sum.py)|Medium|\n|[Find Synonyms](./Algorithms/Python/Graphs/Find_Synonyms.py) | [Python](./Algorithms/Python/Graphs/Find_Synonyms.py)|Medium|\n|[Roman to Integer](https://leetcode.com/problems/roman-to-integer/description) | [Python](./Algorithms/Python/Arrays_and_Hashing/Roman_to_Integer.py)|Easy|\n\n\n### Databases    \n\n| Problem | Solution | Difficulty |\n| :-----: | :--------: | :----------: |\n|[Average Selling Price](https://leetcode.com/problems/average-selling-price/description/)|[PostgreSQL](./Databases/PostgreSQL/Average_Selling_Price.sql)|Easy|\n|[Exchange Seats](https://leetcode.com/problems/exchange-seats/description/)|[PostgreSQL](./Databases/PostgreSQL/Exchange_Seats.sql)|Medium|\n|[Product Sales Analysis III](https://leetcode.com/problems/product-sales-analysis-iii/description/)|[PostgreSQL](./Databases/PostgreSQL/Product_Sales_Analysis_III.sql)|Medium|\n|[Recyclable and Low Fat Products](https://leetcode.com/problems/recyclable-and-low-fat-products/description/)|[PostgreSQL](./Databases/PostgreSQL/Recyclable_and_Low_Fat_Products.sql)|Easy|\n|[Rising Temperature](https://leetcode.com/problems/rising-temperature/description/)|[PostgreSQL](./Databases/PostgreSQL/Rising_Temperature.sql)|Easy|\n|[Second Highest Salary](https://leetcode.com/problems/second-highest-salary/description/)|[PostgreSQL](./Databases/PostgreSQL/Second_Highest_Salary.sql)|Medium|\n|[Triangle Judgement](https://leetcode.com/problems/triangle-judgement/description/)|[PostgreSQL](./Databases/PostgreSQL/Triangle_Judgement.sql)|Medium|\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fichowdhury01%2Fcoding-exercises","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fichowdhury01%2Fcoding-exercises","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fichowdhury01%2Fcoding-exercises/lists"}