{"id":24053070,"url":"https://github.com/vishalku03/potd_challenge_2024","last_synced_at":"2026-01-18T11:53:59.735Z","repository":{"id":241574163,"uuid":"805164887","full_name":"vishalku03/POTD_challenge_2024","owner":"vishalku03","description":"problem of the day solution - leetcode , geeksforgeeks , coding - ninjas  , py","archived":false,"fork":false,"pushed_at":"2024-12-31T14:10:56.000Z","size":896,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-09T02:22:24.175Z","etag":null,"topics":["c","cpp","dsa","gfg-solutions","leetcode-solutions","python"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/vishalku03.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-05-24T02:34:11.000Z","updated_at":"2024-12-31T18:42:38.000Z","dependencies_parsed_at":"2024-05-29T04:29:42.700Z","dependency_job_id":"e7e36cd3-be1c-4fdc-a714-838542ecfa2c","html_url":"https://github.com/vishalku03/POTD_challenge_2024","commit_stats":null,"previous_names":["vishalku03/potd_challenge","vishalku03/potd_challenge_2024"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vishalku03%2FPOTD_challenge_2024","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vishalku03%2FPOTD_challenge_2024/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vishalku03%2FPOTD_challenge_2024/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vishalku03%2FPOTD_challenge_2024/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/vishalku03","download_url":"https://codeload.github.com/vishalku03/POTD_challenge_2024/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240832458,"owners_count":19864938,"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","cpp","dsa","gfg-solutions","leetcode-solutions","python"],"created_at":"2025-01-09T02:22:37.140Z","updated_at":"2025-02-26T10:21:52.150Z","avatar_url":"https://github.com/vishalku03.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"\nday_1 -\u003e the number of beautifull subsets (leetcode - 2597)\n\nday_2 -\u003e Maximum score words formed by letters (leetcode - 1255)\n\nday_3 -\u003e Word break 2 ( leetcode - 140) , \n         You and Yours books (gfg)\n         \nday_4 -\u003e Minimum cost to two strings sdentical (gfg) , \n         nth fibonacci number (coding ninjas) , \n         Student attendence record score (leetcode - 552)\n         \nday_5 -\u003e Special array with x elements greater than or equal to x (leetcode - 1608)\n\nday_6 -\u003e get equal substrings within budget- 1208\n\nday_7 -\u003e Number of steps to reduce a number in binary representation to one (leetcode - 1404)\n\nday_8 -\u003e Count that can form two arrays of equal XOR (leetcode - 1442)\\\n\nday_9 -\u003e Single nuumber ||| (leetcode -  260)\n\nday_10 -\u003e store of a string (leetcode  - 3110)\n\nday_11 -\u003e reverse string (leetcode - 344)\n\nday_12 - \u003e Append characters to string to make subsequences (leetcode  -  2486)\n\nday_13 -\u003e longest palindrome (leetcode -  409)\n\nday_14 -\u003e Find common characters (leetcode - 1002)\n\nday_15 -\u003e. Hand of straights ( leetcode  - 846)\n\n         . max sum in the cinfiguration (gfg)\n\nday_16 -\u003e Replace word (leetcode -  648)         \n\n         2. Maximum occured integer (gfg)\n\nday_17 -\u003e Continuous subarray sum (leetcode  -  523)         \n\n         2. index of extra element (gfg)\n\nday_18 -\u003e Subarray sums divisible by K (leetcode -  974)         \n\n         2.  Convert array into ZIG ZAG fashion (gfg)\n\nday_19 -\u003e Height checker (leetcode -  1051)\n\n         2. Nuts and Bolts (gfg)\n         \nday_20 -\u003e Relative sort array (leetcode 1122)\n\n         2. Maximum tip calculator (gfg)\n\nday_21 -\u003e Sort colors (leetcode  -  75)         \n\n         2. Count containing number 4 (gfg)\n\nday_22 -\u003e Minimum number of moves to seat  everyone (leetcode - 2037)         \n\n         2. Padvon sequence (gfg)\n\n         3.  Maximum product  subarray (gfg)\n\n         4. bfs of graph (gfg)\n\n         5. Roate list (leetcode  -  61)\n\n         6. Combination sum || (leetcode - 40)\n\nday_23  -\u003e Minumum number of increament to make an array unique (leetcode)         \n\n         2. Armstrong number (gfg)\n\nday_24 -\u003e IPO (leetcode - 501)         \n\n         2. Mobile numeric keyword (gfg)\n\nday_25 -\u003e Patching array (leetcode -  330)         \n\n         2. prime sum with array (gfg)\n\nday_26 -\u003e Check if two line segment is intersect (gfg)         \n\n         2. Sum of the square of a number (gfg)\n\nday_27 -\u003e Most profit assiging work (leetcode -  826)         \n\n         2. Number of circle in a rectangle (gfg)\n\nday_28 -\u003e Minimum number of days to make m boquets (leetcode - 1482)\n\n         2. Find the maximum volume of a cuboid (gfg)\n\nday_29  -\u003e Magnetic forces between two bolls (leetcode -  1552)\n\n         2.  Internal points inside traingle (gfg)\n\nday_30 -\u003e Grumpy bookstore owner (leetcode - 1052)\n\n        2. Comapre two fractions (gfg)\n\nday_31 -\u003e Count numnber of nice subarray (1248)        \n\n        2.  Extract the number from string (gfg)\n\nday_32 -\u003e Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit(leetcode - 1438)\n         \n it all about my coding questions which are solved by per day so .\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvishalku03%2Fpotd_challenge_2024","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvishalku03%2Fpotd_challenge_2024","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvishalku03%2Fpotd_challenge_2024/lists"}