{"id":25580294,"url":"https://github.com/hasanulmukit/programming-problems","last_synced_at":"2026-04-13T13:32:14.665Z","repository":{"id":277941023,"uuid":"933989895","full_name":"hasanulmukit/Programming-Problems","owner":"hasanulmukit","description":"A curated repository of programming problem solutions implemented in C, C++, Java, and Python. Organized by topic and difficulty, it provides a clear and accessible resource for developers and learners to explore algorithms, data structures, and coding challenges.","archived":false,"fork":false,"pushed_at":"2025-03-29T04:32:35.000Z","size":175,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-02T04:06:00.875Z","etag":null,"topics":["c","coding-interviews","coding-test","cpp","java","programming-exercises","programming-problems","python"],"latest_commit_sha":null,"homepage":"","language":"Java","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/hasanulmukit.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":"2025-02-17T04:57:18.000Z","updated_at":"2025-03-29T04:32:39.000Z","dependencies_parsed_at":"2025-03-13T06:26:01.884Z","dependency_job_id":"ce5d7a35-6ecc-4338-87ed-17cdf7892750","html_url":"https://github.com/hasanulmukit/Programming-Problems","commit_stats":null,"previous_names":["hasanulmukit/programming-problems"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/hasanulmukit/Programming-Problems","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasanulmukit%2FProgramming-Problems","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasanulmukit%2FProgramming-Problems/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasanulmukit%2FProgramming-Problems/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasanulmukit%2FProgramming-Problems/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hasanulmukit","download_url":"https://codeload.github.com/hasanulmukit/Programming-Problems/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasanulmukit%2FProgramming-Problems/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":261786868,"owners_count":23209563,"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":["c","coding-interviews","coding-test","cpp","java","programming-exercises","programming-problems","python"],"created_at":"2025-02-21T04:15:25.565Z","updated_at":"2026-04-13T13:32:14.629Z","avatar_url":"https://github.com/hasanulmukit.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Programming Problems\n\nWelcome to my collection of programming problems and their solutions implemented in multiple languages: **C**, **C++**, **Java**, and **Python**.\n\nEach problem is categorized (e.g., Basic, Intermediate, Advanced, Miscellaneous). Click on a problem to see the solutions in your preferred programming language.\n\n---\n\n## Table of Contents\n\n- [Basic Questions](#basic-questions)\n- [Intermediate Questions](#intermediate-questions)\n- [Advanced Questions](#advanced-questions)\n- [Miscellaneous Questions](#miscellaneous-questions)\n- [Contributing](#contributing)\n- [License](#license)\n\n---\n\n## Basic Questions\n\n1. **Write a program to reverse a string**\n\n   \u003ca href=\"./Basic/1.Write a program to reverse a string/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/1.Write a program to reverse a string/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/1.Write a program to reverse a string/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/1.Write a program to reverse a string/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n2. **Find the largest and smallest number in an array**\n\n   \u003ca href=\"./Basic/2.Find the largest and smallest number in an array/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/2.Find the largest and smallest number in an array/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/2.Find the largest and smallest number in an array/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/2.Find the largest and smallest number in an array/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n3. **Check if a string is a palindrome**\n\n   \u003ca href=\"./Basic/3.Check if a string is a palindrome/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/3.Check if a string is a palindrome/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/3.Check if a string is a palindrome/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/3.Check if a string is a palindrome/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n4. **Write a program to check if a number is prime**\n\n   \u003ca href=\"./Basic/4.Write a program to check if a number is prime/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/4.Write a program to check if a number is prime/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/4.Write a program to check if a number is prime/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/4.Write a program to check if a number is prime/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n5. **Check if a number is a palindrome**\n\n   \u003ca href=\"./Basic/5.Check if a number is a palindrome/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/5.Check if a number is a palindrome/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/5.Check if a number is a palindrome/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/5.Check if a number is a palindrome/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n6. **Print the Fibonacci series up to n terms (iteration)**\n\n   \u003ca href=\"./Basic/6. Print the Fibonacci series up to n terms (iteration)/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/6. Print the Fibonacci series up to n terms (iteration)/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/6. Print the Fibonacci series up to n terms (iteration)/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/6. Print the Fibonacci series up to n terms (iteration)/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n7. **Find duplicates in an array**\n\n   \u003ca href=\"./Basic/7.Find duplicates in an array/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/7.Find duplicates in an array/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/7.Find duplicates in an array/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/7.Find duplicates in an array/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n8. **Check if a number is even or odd**\n\n   \u003ca href=\"./Basic/8.Check if a number is even or odd/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/8.Check if a number is even or odd/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/8.Check if a number is even or odd/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/8.Check if a number is even or odd/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n9. **Write a program to find the factorial of a number**\n\n   \u003ca href=\"./Basic/9.Write a program to find the factorial of a number/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/9.Write a program to find the factorial of a number/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/9.Write a program to find the factorial of a number/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/9.Write a program to find the factorial of a number/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n10. **Swap two numbers without using a third variable**\n\n    \u003ca href=\"./Basic/10.Swap two numbers without using a third variable/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/10.Swap two numbers without using a third variable/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/10.Swap two numbers without using a third variable/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/10.Swap two numbers without using a third variable/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n11. **Write a program to count the number of vowels and consonants in a string**\n\n    \u003ca href=\"./Basic/11.Write a program to count the number of vowels and consonants in a string/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic11.Write a program to count the number of vowels and consonants in a string/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/11.Write a program to count the number of vowels and consonants in a string/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/11.Write a program to count the number of vowels and consonants in a string/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n12. **Implement a basic calculator for addition, subtraction, multiplication, and division**\n\n    \u003ca href=\"./Basic/12.Implement a basic calculator for addition, subtraction, multiplication, and division/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/12.Implement a basic calculator for addition, subtraction, multiplication, and division/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/12.Implement a basic calculator for addition, subtraction, multiplication, and division/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/12.Implement a basic calculator for addition, subtraction, multiplication, and division/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n13. **Find the sum of the digits of a given number**\n\n    \u003ca href=\"./Basic/13.Find the sum of the digits of a given number/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/13.Find the sum of the digits of a given number/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/13.Find the sum of the digits of a given number/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/13.Find the sum of the digits of a given number/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n14. **Check if a number is prime or composite**\n\n    \u003ca href=\"./Basic/14.Check if a number is prime or composite/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/14.Check if a number is prime or composite/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/14.Check if a number is prime or composite/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/14.Check if a number is prime or composite/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n15. **Find the missing number in an array of size n containing numbers from 1 to n+1 in C**\n\n    \u003ca href=\"./Basic/15.Find the missing number in an array of size n containing numbers from 1 to n+1 in C/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/15.Find the missing number in an array of size n containing numbers from 1 to n+1 in C/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/15.Find the missing number in an array of size n containing numbers from 1 to n+1 in C/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/15.Find the missing number in an array of size n containing numbers from 1 to n+1 in C/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n16. **Find all pairs in an array whose sum is equal to a given number**\n\n    \u003ca href=\"./Basic/16.Find all pairs in an array whose sum is equal to a given number/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/16.Find all pairs in an array whose sum is equal to a given number/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/16.Find all pairs in an array whose sum is equal to a given number/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/16.Find all pairs in an array whose sum is equal to a given number/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n17. **Write a program to remove duplicates from a sorted array**\n\n    \u003ca href=\"./Basic/17.Write a program to remove duplicates from a sorted array/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/17.Write a program to remove duplicates from a sorted array/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/17.Write a program to remove duplicates from a sorted array/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/17.Write a program to remove duplicates from a sorted array/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n18. **Write a program to move all zeros in an array to the end**\n\n    \u003ca href=\"./Basic/18.Write a program to move all zeros in an array to the end/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/18.Write a program to move all zeros in an array to the end/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/18.Write a program to move all zeros in an array to the end/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/18.Write a program to move all zeros in an array to the end/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n19. **Implement a program to check if a string contains all unique characters**\n\n    \u003ca href=\"./Basic/19.Implement a program to check if a string contains all unique characters/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/19.Implement a program to check if a string contains all unique characters/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/19.Implement a program to check if a string contains all unique characters/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/19.Implement a program to check if a string contains all unique characters/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n20. **Reverse the words in a sentence without reversing the letters**\n\n    \u003ca href=\"./Basic/20.Reverse the words in a sentence without reversing the letters/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/20.Reverse the words in a sentence without reversing the letters/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/20.Reverse the words in a sentence without reversing the letters/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/20.Reverse the words in a sentence without reversing the letters/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n21. **Reverse a linked list (iterative)**\n\n    \u003ca href=\"./Basic/21.Reverse a linked list (iterative)/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/21.Reverse a linked list (iterative)/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/21.Reverse a linked list (iterative)/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/21.Reverse a linked list (iterative)/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n22. **Reverse a linked list (recursive)**\n\n    \u003ca href=\"./Basic/22.Reverse a linked list (recursive)/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/22.Reverse a linked list (recursive)/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/22.Reverse a linked list (recursive)/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/22.Reverse a linked list (recursive)/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n23. **Find the middle element of a linked list in one traversal**\n\n    \u003ca href=\"./Basic/23.Find the middle element of a linked list in one traversal/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/23.Find the middle element of a linked list in one traversal/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/23.Find the middle element of a linked list in one traversal/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/23.Find the middle element of a linked list in one traversal/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n24. **Implement a queue using a circular array**\n\n    \u003ca href=\"./Basic/24.Implement a queue using a circular array/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/24.Implement a queue using a circular array/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/24.Implement a queue using a circular array/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/24.Implement a queue using a circular array/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n25. **Solve the Activity Selection Problem**\n\n    \u003ca href=\"./Basic/25.Solve the Activity Selection Problem/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/25.Solve the Activity Selection Problem/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/25.Solve the Activity Selection Problem/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/25.Solve the Activity Selection Problem/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n26. **Write a program to find the largest number possible from an array of numbers**\n\n    \u003ca href=\"./Basic/26.Write a program to find the largest number possible from an array of numbers/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/26.Write a program to find the largest number possible from an array of numbers/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/26.Write a program to find the largest number possible from an array of numbers/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Basic/26.Write a program to find the largest number possible from an array of numbers/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n---\n\n## Intermediate Questions\n\n1. **Implement a stack using an array**\n\n   \u003ca href=\"./Intermediate/1.Implement a stack using an array/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/1.Implement a stack using an array/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/1.Implement a stack using an array/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/1.Implement a stack using an array/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n2. **Implement a queue using an array**\n\n   \u003ca href=\"./Intermediate/2.Implement a queue using an array/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/2.Implement a queue using an array/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/2.Implement a queue using an array/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/2.Implement a queue using an array/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n3. **Merge two sorted arrays into a single sorted array**\n\n   \u003ca href=\"./Intermediate/3.Merge two sorted arrays into a single sorted array/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/3.Merge two sorted arrays into a single sorted array/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/3.Merge two sorted arrays into a single sorted array/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/3.Merge two sorted arrays into a single sorted array/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n4. **Solve the Fibonacci series using recursion**\n\n   \u003ca href=\"./Intermediate/4.Solve the Fibonacci series using recursion/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/4.Solve the Fibonacci series using recursion/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/4.Solve the Fibonacci series using recursion/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/4.Solve the Fibonacci series using recursion/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n5. **Implement bubble sort algorithm**\n\n   \u003ca href=\"./Intermediate/5.Implement bubble sort algorithm/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/5.Implement bubble sort algorithm/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/5.Implement bubble sort algorithm/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/5.Implement bubble sort algorithm/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n6. **Implement insertion sort algorithm**\n\n   \u003ca href=\"./Intermediate/6.Implement insertion sort algorithm/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/6.Implement insertion sort algorithm/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/6.Implement insertion sort algorithm/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/6.Implement insertion sort algorithm/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n7. **Implement binary search for a sorted array**\n\n   \u003ca href=\"./Intermediate/7.Implement binary search for a sorted array/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/7.Implement binary search for a sorted array/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/7.Implement binary search for a sorted array/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/7.Implement binary search for a sorted array/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n8. **Implement binary search for an unsorted array**\n\n   \u003ca href=\"./Intermediate/8.Implement binary search for an unsorted array/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/8.Implement binary search for an unsorted array/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/8.Implement binary search for an unsorted array/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/8.Implement binary search for an unsorted array/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n9. **Find the second largest number in an array**\n\n   \u003ca href=\"./Intermediate/9.Find the second largest number in an array/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/9.Find the second largest number in an array/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/9.Find the second largest number in an array/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/9.Find the second largest number in an array/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n10. **Write a program to check if two strings are anagrams**\n\n    \u003ca href=\"./Intermediate/10.Write a program to check if two strings are anagrams/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/10.Write a program to check if two strings are anagrams/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/10.Write a program to check if two strings are anagrams/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/10.Write a program to check if two strings are anagrams/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n11. **Convert a decimal number to binary**\n\n    \u003ca href=\"./Intermediate/11.Convert a decimal number to binary/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/11.Convert a decimal number to binary/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/11.Convert a decimal number to binary/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/11.Convert a decimal number to binary/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n12. **Find the GCD (Greatest Common Divisor) and LCM (Least Common Multiple) of two numbers**\n\n    \u003ca href=\"./Intermediate/12.Find the GCD (Greatest Common Divisor) and LCM (Least Common Multiple) of two numbers/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/12.Find the GCD (Greatest Common Divisor) and LCM (Least Common Multiple) of two numbers/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/12.Find the GCD (Greatest Common Divisor) and LCM (Least Common Multiple) of two numbers/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/12.Find the GCD (Greatest Common Divisor) and LCM (Least Common Multiple) of two numbers/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n13. **Write a program to rotate an array by k positions**\n\n    \u003ca href=\"./Intermediate/13.Write a program to rotate an array by k positions/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/13.Write a program to rotate an array by k positions/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/13.Write a program to rotate an array by k positions/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/13.Write a program to rotate an array by k positions/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n14. **Implement a stack and its operations (push, pop, peek) using an array**\n\n    \u003ca href=\"./Intermediate/14.Implement a stack and its operations (push, pop, peek) using an array/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/14.Implement a stack and its operations (push, pop, peek) using an array/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/14.Implement a stack and its operations (push, pop, peek) using an array/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/14.Implement a stack and its operations (push, pop, peek) using an array/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n15. **Find the majority element in an array (element that appears more than n2 times)**\n\n    \u003ca href=\"./Intermediate/15.Find the majority element in an array (element that appears more than n2 times)/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/15.Find the majority element in an array (element that appears more than n2 times)/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/15.Find the majority element in an array (element that appears more than n2 times)/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/15.Find the majority element in an array (element that appears more than n2 times)/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n16. **Find the longest common prefix in an array of strings**\n\n    \u003ca href=\"./Intermediate/16.Find the longest common prefix in an array of strings/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/16.Find the longest common prefix in an array of strings/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/16.Find the longest common prefix in an array of strings/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/16.Find the longest common prefix in an array of strings/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n17. **Find the first non-repeating character in a string**\n\n    \u003ca href=\"./Intermediate/Find the first non-repeating character in a string/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/17.Find the first non-repeating character in a string/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/17.Find the first non-repeating character in a string/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/17.Find the first non-repeating character in a string/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n18. **Write a program to implement string compression (e.g., aaabb → a3b2)**\n\n    \u003ca href=\"./Intermediate/18.Write a program to implement string compression (e.g., aaabb → a3b2)/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/18.Write a program to implement string compression (e.g., aaabb → a3b2)/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/18.Write a program to implement string compression (e.g., aaabb → a3b2)/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/18.Write a program to implement string compression (e.g., aaabb → a3b2)/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n19. **Merge two sorted linked lists**\n\n    \u003ca href=\"./Intermediate/19.Merge two sorted linked lists/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/19.Merge two sorted linked lists/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/19.Merge two sorted linked lists/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/19.Merge two sorted linked lists/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n20. **Implement a queue using an array**\n\n    \u003ca href=\"./Intermediate/20.Remove the nth node from the end of a linked list/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/20.Remove the nth node from the end of a linked list/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/20.Remove the nth node from the end of a linked list/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/20.Remove the nth node from the end of a linked list/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n21. **Detect and remove a cycle in a linked list**\n\n    \u003ca href=\"./Intermediate/21.Detect and remove a cycle in a linked list/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/21.Detect and remove a cycle in a linked list/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/21.Detect and remove a cycle in a linked list/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/21.Detect and remove a cycle in a linked list/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n22. **Write a program to evaluate a postfix expression**\n\n    \u003ca href=\"./Intermediate/22.Write a program to evaluate a postfix expression/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/22.Write a program to evaluate a postfix expression/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/22.Write a program to evaluate a postfix expression/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/22.Write a program to evaluate a postfix expression/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n23. **Implement a min stack that supports push, pop, and retrieving the minimum element in constant time**\n\n    \u003ca href=\"./Intermediate/23.Implement a min stack that supports push, pop, and retrieving the minimum element in constant time/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/23.Implement a min stack that supports push, pop, and retrieving the minimum element in constant time/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/23.Implement a min stack that supports push, pop, and retrieving the minimum element in constant time/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/23.Implement a min stack that supports push, pop, and retrieving the minimum element in constant time/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n24. **Solve the 01 Knapsack Problem**\n\n    \u003ca href=\"./Intermediate/24.Solve the 01 Knapsack Problem/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/24.Solve the 01 Knapsack Problem/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/24.Solve the 01 Knapsack Problem/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/24.Solve the 01 Knapsack Problem/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n25. **Find the length of the longest increasing subsequence**\n\n    \u003ca href=\"./Intermediate/25.Find the length of the longest increasing subsequence/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/25.Find the length of the longest increasing subsequence/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/25.Find the length of the longest increasing subsequence/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/25.Find the length of the longest increasing subsequence/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n26. **Solve the Coin Change Problem (minimum coins needed to make a sum)**\n\n    \u003ca href=\"./Intermediate/26.Solve the Coin Change Problem (minimum coins needed to make a sum)/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/26.Solve the Coin Change Problem (minimum coins needed to make a sum)/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/26.Solve the Coin Change Problem (minimum coins needed to make a sum)/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/26.Solve the Coin Change Problem (minimum coins needed to make a sum)/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n27. **Find the longest common subsequence of two strings**\n\n    \u003ca href=\"./Intermediate/27.Find the longest common subsequence of two strings/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/27.Find the longest common subsequence of two strings/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/27.Find the longest common subsequence of two strings/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/27.Find the longest common subsequence of two strings/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n28. **Implement Huffman Encoding**\n\n    \u003ca href=\"./Intermediate/Implement Huffman Encoding/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/Implement Huffman Encoding/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/Implement Huffman Encoding/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/Implement Huffman Encoding/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n29. **Find the minimum number of coins needed for a given amount using a greedy approach**\n\n    \u003ca href=\"./Intermediate/29.Find the minimum number of coins needed for a given amount using a greedy approach/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/29.Find the minimum number of coins needed for a given amount using a greedy approach/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/29.Find the minimum number of coins needed for a given amount using a greedy approach/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/29.Find the minimum number of coins needed for a given amount using a greedy approach/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n30. **Generate all subsets of a given set using recursion**\n\n    \u003ca href=\"./Intermediate/30.Generate all subsets of a given set using recursion/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/30.Generate all subsets of a given set using recursion/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/30.Generate all subsets of a given set using recursion/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/30.Generate all subsets of a given set using recursion/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n31. **Solve the Fractional Knapsack Problem**\n\n    \u003ca href=\"./Intermediate/31.Solve the Fractional Knapsack Problem/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/31.Solve the Fractional Knapsack Problem/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/31.Solve the Fractional Knapsack Problem/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/31.Solve the Fractional Knapsack Problem/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n32. **Solve the Topological Sorting Problem for a directed acyclic graph (DAG)**\n\n    \u003ca href=\"./Intermediate/32.Solve the Topological Sorting Problem for a directed acyclic graph (DAG)/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/32.Solve the Topological Sorting Problem for a directed acyclic graph (DAG)/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/32.Solve the Topological Sorting Problem for a directed acyclic graph (DAG)/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/32.Solve the Topological Sorting Problem for a directed acyclic graph (DAG)/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n33. **Write a program to detect a cycle in a directed graph using DFS**\n\n    \u003ca href=\"./Intermediate/33.Write a program to detect a cycle in a directed graph using DFS/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/33.Write a program to detect a cycle in a directed graph using DFS/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/33.Write a program to detect a cycle in a directed graph using DFS/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/33.Write a program to detect a cycle in a directed graph using DFS/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n34. **Tree traversals (inorder, preorder, postorder)**\n\n    \u003ca href=\"./Intermediate/34.Tree traversals (inorder, preorder, postorder)/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/34.Tree traversals (inorder, preorder, postorder)/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/34.Tree traversals (inorder, preorder, postorder)/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/34.Tree traversals (inorder, preorder, postorder)/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n35. **Write a program to find the intersection of two sorted arrays**\n\n    \u003ca href=\"./Intermediate/35.Write a program to find the intersection of two sorted arrays/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/35.Write a program to find the intersection of two sorted arrays/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/35.Write a program to find the intersection of two sorted arrays/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Intermediate/35.Write a program to find the intersection of two sorted arrays/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n---\n\n## Advanced Questions\n\n1. **Implement merge sort algorithm**\n\n   \u003ca href=\"./Advance/1.Implement merge sort algorithm/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/1.Implement merge sort algorithm/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/1.Implement merge sort algorithm/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/1.Implement merge sort algorithm/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n2. **Implement quicksort algorithm**\n\n   \u003ca href=\"./Advance/2.Implement quicksort algorithm/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/2.Implement quicksort algorithm/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/2.Implement quicksort algorithm/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/2.Implement quicksort algorithm/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n3. **Write a program to check if a linked list is a palindrome**\n\n   \u003ca href=\"./Advance/3.Write a program to check if a linked list is a palindrome/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/3.Write a program to check if a linked list is a palindrome/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/3.Write a program to check if a linked list is a palindrome/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/3.Write a program to check if a linked list is a palindrome/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n4. **Implement a queue using two stacks**\n\n   \u003ca href=\"./Advance/4.Implement a queue using two stacks/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/4.Implement a queue using two stacks/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/4.Implement a queue using two stacks/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/4.Implement a queue using two stacks/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n5. **Solve the N-Queens Problem using backtracking**\n\n   \u003ca href=\"./Advance/5.Solve the N-Queens Problem using backtracking/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/5.Solve the N-Queens Problem using backtracking/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/5.Solve the N-Queens Problem using backtracking/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/5.Solve the N-Queens Problem using backtracking/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n6. **Write a program to detect a cycle in a linked list**\n\n   \u003ca href=\"./Advance/6.Write a program to detect a cycle in a linked list/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/6.Write a program to detect a cycle in a linked list/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/6.Write a program to detect a cycle in a linked list/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/6.Write a program to detect a cycle in a linked list/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n7. **Find the shortest path in a graph using Dijkstra’s Algorithm**\n\n   \u003ca href=\"./Advance/7.Find the shortest path in a graph using Dijkstra’s Algorithm/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/7.Find the shortest path in a graph using Dijkstra’s Algorithm/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/7.Find the shortest path in a graph using Dijkstra’s Algorithm/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/7.Find the shortest path in a graph using Dijkstra’s Algorithm/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n8. **Check if a binary tree is a valid binary search tree (BST)**\n\n   \u003ca href=\"./Advance/8.Check if a binary tree is a valid binary search tree (BST)/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/8.Check if a binary tree is a valid binary search tree (BST)/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/8.Check if a binary tree is a valid binary search tree (BST)/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/8.Check if a binary tree is a valid binary search tree (BST)/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n9. **Write a program to solve the Knapsack Problem using dynamic programming**\n\n   \u003ca href=\"./Advance/9.Write a program to solve the Knapsack Problem using dynamic programming/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/9.Write a program to solve the Knapsack Problem using dynamic programming/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/9.Write a program to solve the Knapsack Problem using dynamic programming/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/9.Write a program to solve the Knapsack Problem using dynamic programming/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n10. **Implement depth-first search (DFS) for a graph**\n\n    \u003ca href=\"./Advance/10.Implement depth-first search (DFS) for a graph/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/10.Implement depth-first search (DFS) for a graph/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/10.Implement depth-first search (DFS) for a graph/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/10.Implement depth-first search (DFS) for a graph/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n11. **Implement breadth-first search (BFS) for a graph**\n\n    \u003ca href=\"./Advance/11.Implement breadth-first search (BFS) for a graph/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/11.Implement breadth-first search (BFS) for a graph/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/11.Implement breadth-first search (BFS) for a graph/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/11.Implement breadth-first search (BFS) for a graph/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n12. **Find the maximum area of a rectangle in a histogram**\n\n    \u003ca href=\"./Advance/12.Find the maximum area of a rectangle in a histogram/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/12.Find the maximum area of a rectangle in a histogram/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/12.Find the maximum area of a rectangle in a histogram/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/12.Find the maximum area of a rectangle in a histogram/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n13. **Implement the Tower of Hanoi**\n\n    \u003ca href=\"./Advance/13.Implement the Tower of Hanoi/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/13.Implement the Tower of Hanoi/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/13.Implement the Tower of Hanoi/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/13.Implement the Tower of Hanoi/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n14. **Write a program to compute the nth Catalan number**\n\n    \u003ca href=\"./Advance/14.Write a program to compute the nth Catalan number/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/14.Write a program to compute the nth Catalan number/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/14.Write a program to compute the nth Catalan number/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/14.Write a program to compute the nth Catalan number/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n15. **Design a hash map from scratch using an array and linked list**\n\n    \u003ca href=\"./Advance/15.Design a hash map from scratch using an array and linked list/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/15.Design a hash map from scratch using an array and linked list/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/15.Design a hash map from scratch using an array and linked list/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/15.Design a hash map from scratch using an array and linked list/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n16. **Find the connected components of an undirected graph**\n\n    \u003ca href=\"./Advance/16.Find the connected components of an undirected graph/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/16.Find the connected components of an undirected graph/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/16.Find the connected components of an undirected graph/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/16.Find the connected components of an undirected graph/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n17. **Implement Floyd-Warshall Algorithm for all-pairs shortest paths**\n\n    \u003ca href=\"./Advance/17.Implement Floyd-Warshall Algorithm for all-pairs shortest paths/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/17.Implement Floyd-Warshall Algorithm for all-pairs shortest paths/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/17.Implement Floyd-Warshall Algorithm for all-pairs shortest paths/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/17.Implement Floyd-Warshall Algorithm for all-pairs shortest paths/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n18. **Implement Kruskal’s Algorithm for finding the Minimum Spanning Tree (MST)**\n\n    \u003ca href=\"./Advance/18.Implement Kruskal’s Algorithm for finding the Minimum Spanning Tree (MST)/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/18.Implement Kruskal’s Algorithm for finding the Minimum Spanning Tree (MST)/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/18.Implement Kruskal’s Algorithm for finding the Minimum Spanning Tree (MST)/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/18.Implement Kruskal’s Algorithm for finding the Minimum Spanning Tree (MST)/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n19. **Solve the Snake and Ladder Problem using a graph representation**\n\n    \u003ca href=\"./Advance/19.Solve the Snake and Ladder Problem using a graph representation/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/19.Solve the Snake and Ladder Problem using a graph representation/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/19.Solve the Snake and Ladder Problem using a graph representation/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e \u003ca href=\"./Advance/19.Solve the Snake and Ladder Problem using a graph representation/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n## Miscellaneous Questions\n\n1. **Pattern #1**\n\n   \u003ca href=\"./Miscellaneous/Pattern 1/Solution.c\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C-View_Solution-blue\" alt=\"C\"\u003e\u003c/a\u003e\u003ca href=\"./Miscellaneous/Pattern 1/Solution.cpp\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/C++-View_Solution-blue\" alt=\"C++\"\u003e\u003c/a\u003e\u003ca href=\"./Miscellaneous/Pattern 1/Solution.java\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Java-View_Solution-blue\" alt=\"Java\"\u003e\u003c/a\u003e\u003c/a\u003e\u003ca href=\"./Miscellaneous/Pattern 1/Solution.py\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Python-View_Solution-blue\" alt=\"Python\"\u003e\u003c/a\u003e\n\n---\n\n## Contributing\n\nContributions are welcome! If you have a new solution or an improvement:\n\n1. Fork this repository.\n2. Create a new branch for your feature/fix.\n3. Commit your changes and open a pull request.\n\nPlease ensure your code follows the existing structure.\n\n---\n\n## License\n\nDistributed under the MIT License. See [LICENSE](LICENSE) for more information.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhasanulmukit%2Fprogramming-problems","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhasanulmukit%2Fprogramming-problems","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhasanulmukit%2Fprogramming-problems/lists"}