Ecosyste.ms: Awesome

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

Awesome Lists | Featured Topics | Projects

https://github.com/neyhere07/21-days-gfg-potd-challenge-2024

This repository is comprises the solutions of GFG POTD Challenge. All the solutions are in java.
https://github.com/neyhere07/21-days-gfg-potd-challenge-2024

coding coding-challenge gfg gfg-potd java potd programming

Last synced: about 2 months ago
JSON representation

This repository is comprises the solutions of GFG POTD Challenge. All the solutions are in java.

Awesome Lists containing this project

README

        

# 21 Days GFG POTD CHALLENGE - 2024

[![](https://img.shields.io/badge/Author⭐-neyhere07-darkgreen.svg)](https://github.com/neyhere07)

[![Welcome to this repo](https://img.shields.io/badge/Welcome.to.this.repo-blue.svg?style=flat&logo=github)](https://github.com/neyhere07)
![](https://img.shields.io/badge/Programming_Language-Java-blue.svg)
![](https://img.shields.io/badge/Status-Work.in.Progress-blue.svg)
[![](https://img.shields.io/github/license/neyhere07/21-Days-GFG-POTD-Challenge-2024.svg?style=plastic)](https://github.com/neyhere07/21-Days-GFG-POTD-Challenge-2024)
[![](https://img.shields.io/github/languages/code-size/neyhere07/21-Days-GFG-POTD-Challenge-2024.svg?style=plastic)](https://github.com/neyhere07s/21-Days-GFG-POTD-Challenge-2024)
[![](https://img.shields.io/github/languages/top/neyhere07/21-Days-GFG-POTD-Challenge-2024.svg?style=plastic)](https://github.com/neyhere07/21-Days-GFG-POTD-Challenge-2024)

 

Table of Contents :

|Day | Problem Name |Difficulty Level| Topics | | Day | Problem Name | Difficulty Level | Topics | | Day | Problem Name | Difficulty Level | Topics |
|-----|--------------|-----------------|-------|--|-----|--------------|------------------|--------|--|------|-------------|------------------|--------|
| 01. |[Minimum Cost of ropes](https://www.geeksforgeeks.org/problems/minimum-cost-of-ropes-1587115620/1)| ![Easy](https://img.shields.io/badge/Easy-Green?style=flat) | Queue, Heap | | 08. |[Parenthesis Checker](https://www.geeksforgeeks.org/problems/parenthesis-checker2744/1)| ![Easy](https://img.shields.io/badge/Easy-Green?style=flat) | String, Stack | | 15. |[Palindrome Linked List](https://www.geeksforgeeks.org/problems/check-if-linked-list-is-pallindrome/1)| [![Medium](https://badge.ttsalpha.com/api?status=Medium&color=orange)](https://example.com) | Linked List, Palindrome |
| 02. |[Middle of a Linked List](https://www.geeksforgeeks.org/problems/finding-middle-element-in-a-linked-list/1)| ![Easy](https://img.shields.io/badge/Easy-Green?style=flat) | Linked List | | 09. | [Reverse Words](https://www.geeksforgeeks.org/problems/reverse-words-in-a-given-string5459/1) | ![Easy](https://img.shields.io/badge/Easy-Green?style=flat) | Strings | | 16. |[Roof Top](https://www.geeksforgeeks.org/problems/roof-top-1587115621/1) | ![Easy](https://img.shields.io/badge/Easy-Green?style=flat) | Arrays, Searching |
| 03. |[Mirror tree](https://www.geeksforgeeks.org/problems/mirror-tree/1)| ![Easy](https://img.shields.io/badge/Easy-Green?style=flat) | Tree | | 10. |[Facing the sun](https://www.geeksforgeeks.org/problems/facing-the-sun2126/1)| ![Easy](https://img.shields.io/badge/Easy-Green?style=flat) | Arrays, Searching | | 17. |[K Sized Subarray Maximum](https://www.geeksforgeeks.org/problems/maximum-of-all-subarrays-of-size-k3101/1) | [![Medium](https://badge.ttsalpha.com/api?status=Medium&color=orange)](https://example.com) | Sliding Window, Arrays, Queue |
| 04. |[Alternate positive and negative numbers](https://www.geeksforgeeks.org/problems/array-of-alternate-ve-and-ve-nos1401/1)| ![Easy](https://img.shields.io/badge/Easy-Green?style=flat) | Arrays | | 11. |[Clone a linked list with next and random pointer](https://www.geeksforgeeks.org/problems/clone-a-linked-list-with-next-and-random-pointer/1)| [![Hard](https://badge.ttsalpha.com/api?status=Hard&color=red)](https://example.com) | Linked List | | 18. |[Minimal Cost](https://www.geeksforgeeks.org/problems/minimal-cost/1) | [![Medium](https://badge.ttsalpha.com/api?status=Medium&color=orange)](https://example.com) | DP, Arrays |
| 05. |[Binary Tree to DLL](https://www.geeksforgeeks.org/problems/binary-tree-to-dll/1)| [![Hard](https://badge.ttsalpha.com/api?status=Hard&color=red)](https://example.com) | Linked List, Tree | | 12. |[Longest Prefix Suffix](https://www.geeksforgeeks.org/problems/longest-prefix-suffix2527/1)| [![Hard](https://badge.ttsalpha.com/api?status=Hard&color=red)](https://example.com) | Strings | | 19. |[Total count](https://www.geeksforgeeks.org/problems/total-count2415/1)| ![Easy](https://img.shields.io/badge/Easy-Green?style=flat) | Arrays |
| 06. |[Longest valid Parentheses](https://www.geeksforgeeks.org/problems/longest-valid-parentheses5657/1)| [![Hard](https://badge.ttsalpha.com/api?status=Hard&color=red)](https://example.com) | Strings, DP | | 13. |[Missing and Repeating](https://www.geeksforgeeks.org/problems/find-missing-and-repeating2512/1)| [![Medium](https://badge.ttsalpha.com/api?status=Medium&color=orange)](https://example.com) | Arrays | | 20. |[Merge two BST's](https://www.geeksforgeeks.org/problems/merge-two-bst-s/1)| [![Medium](https://badge.ttsalpha.com/api?status=Medium&color=orange)](https://example.com) | Binary Tree, Tree |
| 07. |[Minimize the Heights II](https://www.geeksforgeeks.org/problems/minimize-the-heights3351/1)| [![Medium](https://badge.ttsalpha.com/api?status=Medium&color=orange)](https://example.com) | Arrays, Greedy | | 14. |[Smallest window in a string containing all the characters of another string](https://www.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string-1587115621/1)| [![Hard](https://badge.ttsalpha.com/api?status=Hard&color=red)](https://example.com) | Sliding Window, Hash, Strings, DP | | 21. |[Multiply two linked lists](https://www.geeksforgeeks.org/problems/multiply-two-linked-lists/1) | ![Easy](https://img.shields.io/badge/Easy-Green?style=flat) | Linked List |