{"id":16617925,"url":"https://github.com/jaygajera17/leetcode_gfg_string_problem","last_synced_at":"2025-04-05T00:18:01.144Z","repository":{"id":109982260,"uuid":"535647957","full_name":"jaygajera17/leetcode_gfg_string_problem","owner":"jaygajera17","description":"Collection of all the String Question from gfg and leetcode","archived":false,"fork":false,"pushed_at":"2023-04-14T09:03:48.000Z","size":70,"stargazers_count":3,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-02-10T08:32:51.787Z","etag":null,"topics":["cpp","data-structures","dsa","geeksforgeeks","geeksforgeeks-cpp","geeksforgeeks-solutions","geeksforgeeks-string","gfg","leetcode","leetcode-string","string","string-algorithms","string-question"],"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/jaygajera17.png","metadata":{"files":{"readme":"README.md","changelog":"Change_The_String.cpp","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":"2022-09-12T12:06:51.000Z","updated_at":"2024-02-18T05:05:06.000Z","dependencies_parsed_at":"2025-02-10T08:39:08.275Z","dependency_job_id":null,"html_url":"https://github.com/jaygajera17/leetcode_gfg_string_problem","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaygajera17%2Fleetcode_gfg_string_problem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaygajera17%2Fleetcode_gfg_string_problem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaygajera17%2Fleetcode_gfg_string_problem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaygajera17%2Fleetcode_gfg_string_problem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jaygajera17","download_url":"https://codeload.github.com/jaygajera17/leetcode_gfg_string_problem/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247266568,"owners_count":20910837,"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":["cpp","data-structures","dsa","geeksforgeeks","geeksforgeeks-cpp","geeksforgeeks-solutions","geeksforgeeks-string","gfg","leetcode","leetcode-string","string","string-algorithms","string-question"],"created_at":"2024-10-12T02:18:33.078Z","updated_at":"2025-04-05T00:18:01.138Z","avatar_url":"https://github.com/jaygajera17.png","language":"C++","readme":"# gfg_string_question\n https://www.geeksforgeeks.org/top-50-string-coding-problems-for-interviews/\n\n## Importance\n- playing with characters test logic of programmer very well\n- understanding of C++ Standard Template Library(STL) also increase\n- frequently asked string coding questions in every coding round\n\n\n## Key Points\n### ascii value:-\n- 48 to 57 - Number\n- 65 to 90 - uppercase [(s[0]\u003e='a'\u0026\u0026s[0]\u003c='z']\n- 97 to 122 - lowercase [(s[0]\u003e='A'\u0026\u0026s[0]\u003c='Z']\n- lowercase = lowercase + 32\n\n\n### inbuilt Method:-\n\n- toupper:- (char)tolower(s[i]);\n- tolower:- (char)toupper(s[i]);\n\n\n Transform:- \n- transform(s.begin(), s.end(), s.begin(), ::tolower);\n- transform(s.begin(), s.end(), s.begin(), ::toupper);\n\n- Find:-  s1.find(s2[i])!=string::npos:- it means \u003cfind s2[i] in s1\u003e is present\n\n- token:- stringstream \n  ex:    \u003cbr\u003estring s = \"geeks for geeks\"; \n         stringstream ss(s); // Used for breaking words \u003cbr\u003e\n         string word; // to store individual words \u003cbr\u003e\n         while (ss \u003e\u003e word) \u003cbr\u003e\n         cout \u003c\u003c word \u003c\u003c endl; \u003cbr\u003e\n        \n- next_permutation()\n         \n\n        \n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaygajera17%2Fleetcode_gfg_string_problem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjaygajera17%2Fleetcode_gfg_string_problem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaygajera17%2Fleetcode_gfg_string_problem/lists"}