Ecosyste.ms: Awesome

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

Awesome Lists | Featured Topics | Projects

https://github.com/ichowdhury01/coding-exercises

Solutions to various coding exercises.
https://github.com/ichowdhury01/coding-exercises

algorithms-and-data-structures coding-challenges databases exercise-solutions postgresql python3

Last synced: 19 days ago
JSON representation

Solutions to various coding exercises.

Awesome Lists containing this project

README 

        
Coding Exercises

========



### Algorithms



| Problem | Solution | Difficulty |

| :-----: | :--------: | :----------: |

|[Coin Change](https://leetcode.com/problems/coin-change) | [Python](./Algorithms/Python/1D_Dynamic_Programming/Coin_Change.py)|Medium|

|[Decode Ways](https://leetcode.com/problems/decode-ways/description/) | [Python](./Algorithms/Python/1D_Dynamic_Programming/Decode_Ways.py)|Medium|

|[House Robber](https://leetcode.com/problems/house-robber/description/) | [Python](./Algorithms/Python/1D_Dynamic_Programming/House_Robber.py)|Medium|

|[Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/description/) | [Python](./Algorithms/Python/2D_Dynamic_Programming/Longest_Common_Subsequence.py)|Medium|

|[Unique Paths](https://leetcode.com/problems/unique-paths/) | [Python](./Algorithms/Python/2D_Dynamic_Programming/Unique_Paths.py)|Medium|

|[Alien Dictionary](https://leetcode.com/problems/alien-dictionary/) | [Python](./Algorithms/Python/Advanced_Graphs/Alien_Dictionary.py)|Hard|

|[Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) | [Python](./Algorithms/Python/Arrays_and_Hashing/Encode_and_Decode_Strings.py)|Medium|

|[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | [Python](./Algorithms/Python/Arrays_and_Hashing/Longest_Consecutive_Sequence.py)|Medium|

|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | [Python](./Algorithms/Python/Arrays_and_Hashing/Valid_Sudoku.py)|Medium|

|[Combination Sum](https://leetcode.com/problems/combination-sum/description/) | [Python](./Algorithms/Python/Backtracking/Combination_Sum.py)|Medium|

|[N Queens](https://leetcode.com/problems/n-queens/) | [Python](./Algorithms/Python/Backtracking/N_Queens.py)|Hard|

|[Word Search](https://leetcode.com/problems/word-search/) | [Python](./Algorithms/Python/Backtracking/Word_Search.py)|Medium|

|[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|

|[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|

|[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|

|[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/description/) | [Python](./Algorithms/Python/Bit_Manipulation/Number_of_1_Bits.py)|Easy|

|[Reverse Bits](https://leetcode.com/problems/reverse-bits/) | [Python](./Algorithms/Python/Bit_Manipulation/Reverse_Bits.py)|Easy|

|[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/description/) | [Python](./Algorithms/Python/Bit_Manipulation/Sum_of_Two_Integers.py)|Medium|

|[Clone Graph](https://leetcode.com/problems/clone-graph/description/) | [Python](./Algorithms/Python/Graphs/Clone_Graph.py)|Medium|

|[Course Schedule](https://leetcode.com/problems/course-schedule/) | [Python](./Algorithms/Python/Graphs/Course_Schedule.py)|Medium|

|[Max Area of Island](https://leetcode.com/problems/max-area-of-island/description/) | [Python](./Algorithms/Python/Graphs/Max_Area_of_Island.py)|Medium|

|[Jump Game](https://leetcode.com/problems/jump-game/) | [Python](./Algorithms/Python/Greedy/Jump_Game.py)|Medium|

|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [Python](./Algorithms/Python/Greedy/Maximum_Subarray.py)|Medium|

|[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|

|[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|

|[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|

|[Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | [Python](./Algorithms/Python/Intervals/Meeting_Rooms_II.py)|Medium|

|[Merge Intervals](https://leetcode.com/problems/merge-intervals/description/) | [Python](./Algorithms/Python/Intervals/Merge_Intervals.py)|Medium|

|[Non-Overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/description/) | [Python](./Algorithms/Python/Intervals/Non_Overlapping_Intervals.py)|Medium|

|[LRU Cache](https://leetcode.com/problems/lru-cache/) | [Python](./Algorithms/Python/Linked_Lists/LRU_Cache.py)|Medium|

|[Merge K Sorted Linked Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | [Python](./Algorithms/Python/Linked_Lists/Merge_K_Sorted_Lists.py)|Hard|

|[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|

|[Rotate Image](https://leetcode.com/problems/rotate-image/description/) | [Python](./Algorithms/Python/Math_and_Geometry/Rotate_Image.py)|Medium|

|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | [Python](./Algorithms/Python/Math_and_Geometry/Set_Matrix_Zeros.py)|Medium|

|[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/description/) | [Python](./Algorithms/Python/Math_and_Geometry/Spiral_Matrix.py)|Medium|

|[Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | [Python](./Algorithms/Python/Sliding_Window/Longest_Repeating_Character_Replacement.py)|Medium|

|[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | [Python](./Algorithms/Python/Sliding_Window/Minimum_Window_Substring.py)|Hard|

|[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | [Python](./Algorithms/Python/Sliding_Window/Sliding_Window_Maximum.py)|Hard|

|[Basic Calculator](https://leetcode.com/problems/basic-calculator/) | [Python](./Algorithms/Python/Stack/Basic_Calculator.py)|Hard|

|[Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) | [Python](./Algorithms/Python/Stack/Daily_Temperatures.py)|Medium|

|[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) | [Python](./Algorithms/Python/Stack/Largest_Rectangle_in_Histogram.py)|Hard|

|[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|

|[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|

|[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|

|[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|

|[Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/description/) | [Python](./Algorithms/Python/Tries/Implement_Trie.py)|Medium|

|[Word Search II](https://leetcode.com/problems/word-search-ii/) | [Python](./Algorithms/Python/Tries/Word_Search_II.py)|Hard|

|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | [Python](./Algorithms/Python/Two_Pointers/Container_With_Most_Water.py)|Medium|

|[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | [Python](./Algorithms/Python/Two_Pointers/Trapping_Rain_Water.py)|Hard|

|[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|

|[Design Twitter](https://leetcode.com/problems/design-twitter/) | [Python](./Algorithms/Python/Heaps/Design_Twitter.py)|Medium|

|[Rotten Oranges](https://leetcode.com/problems/rotting-oranges/) | [Python](./Algorithms/Python/Graphs/Rotten_Oranges.py)|Medium|

|[Palindrome Number](https://leetcode.com/problems/palindrome-number/) | [Python](./Algorithms/Python/Math_and_Geometry/Palindrome_Number.py)|Easy|

|[Redundant Connection](https://leetcode.com/problems/redundant-connection/) | [Python](./Algorithms/Python/Graphs/Redundant_Connection.py)|Medium|

|[Word Ladder](https://leetcode.com/problems/word-ladder/) | [Python](./Algorithms/Python/Graphs/Word_Ladder.py)|Hard|

|[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum) | [Python](./Algorithms/Python/1D_Dynamic_Programming/Partition_Equal_Subset_Sum.py)|Medium|

|[Reverse Integer](https://leetcode.com/problems/reverse-integer/description/) | [Python](./Algorithms/Python/Bit_Manipulation/Reverse_Integer.py)|Medium|

|[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|

|[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|

|[Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/description/) | [Python](./Algorithms/Python/Arrays_and_Hashing/Minimum_Absolute_Difference.py)|Easy|

|[4 Sum](https://leetcode.com/problems/4sum/) | [Python](./Algorithms/Python/Two_Pointers/4_Sum.py)|Medium|

|[Find Synonyms](./Algorithms/Python/Graphs/Find_Synonyms.py) | [Python](./Algorithms/Python/Graphs/Find_Synonyms.py)|Medium|

|[Roman to Integer](https://leetcode.com/problems/roman-to-integer/description) | [Python](./Algorithms/Python/Arrays_and_Hashing/Roman_to_Integer.py)|Easy|



### Databases    



| Problem | Solution | Difficulty |

| :-----: | :--------: | :----------: |

|[Average Selling Price](https://leetcode.com/problems/average-selling-price/description/)|[PostgreSQL](./Databases/PostgreSQL/Average_Selling_Price.sql)|Easy|

|[Exchange Seats](https://leetcode.com/problems/exchange-seats/description/)|[PostgreSQL](./Databases/PostgreSQL/Exchange_Seats.sql)|Medium|

|[Product Sales Analysis III](https://leetcode.com/problems/product-sales-analysis-iii/description/)|[PostgreSQL](./Databases/PostgreSQL/Product_Sales_Analysis_III.sql)|Medium|

|[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|

|[Rising Temperature](https://leetcode.com/problems/rising-temperature/description/)|[PostgreSQL](./Databases/PostgreSQL/Rising_Temperature.sql)|Easy|

|[Second Highest Salary](https://leetcode.com/problems/second-highest-salary/description/)|[PostgreSQL](./Databases/PostgreSQL/Second_Highest_Salary.sql)|Medium|

|[Triangle Judgement](https://leetcode.com/problems/triangle-judgement/description/)|[PostgreSQL](./Databases/PostgreSQL/Triangle_Judgement.sql)|Medium|