-
Notifications
You must be signed in to change notification settings - Fork 0
/
2785_sort-vowels-in-a-string_response_lc_py.json
1 lines (1 loc) · 12.9 KB
/
2785_sort-vowels-in-a-string_response_lc_py.json
1
{"data": {"question": {"question_id": "2887", "question_frontend_id": null, "bound_topic_id": null, "title": "Sort Vowels in a String", "title_slug": null, "category_title": null, "frequency": null, "freq_bar": null, "content": "<p>Given a <strong>0-indexed</strong> string <code>s</code>, <strong>permute</strong> <code>s</code> to get a new string <code>t</code> such that:</p>\n\n<ul>\n\t<li>All consonants remain in their original places. More formally, if there is an index <code>i</code> with <code>0 <= i < s.length</code> such that <code>s[i]</code> is a consonant, then <code>t[i] = s[i]</code>.</li>\n\t<li>The vowels must be sorted in the <strong>nondecreasing</strong> order of their <strong>ASCII</strong> values. More formally, for pairs of indices <code>i</code>, <code>j</code> with <code>0 <= i < j < s.length</code> such that <code>s[i]</code> and <code>s[j]</code> are vowels, then <code>t[i]</code> must not have a higher ASCII value than <code>t[j]</code>.</li>\n</ul>\n\n<p>Return <em>the resulting string</em>.</p>\n\n<p>The vowels are <code>'a'</code>, <code>'e'</code>, <code>'i'</code>, <code>'o'</code>, and <code>'u'</code>, and they can appear in lowercase or uppercase. Consonants comprise all letters that are not vowels.</p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "lEetcOde"\n<strong>Output:</strong> "lEOtcede"\n<strong>Explanation:</strong> 'E', 'O', and 'e' are the vowels in s; 'l', 't', 'c', and 'd' are all consonants. The vowels are sorted according to their ASCII values, and the consonants remain in the same places.\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "lYmpH"\n<strong>Output:</strong> "lYmpH"\n<strong>Explanation:</strong> There are no vowels in s (all characters in s are consonants), so we return "lYmpH".\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= s.length <= 10<sup>5</sup></code></li>\n\t<li><code>s</code> consists only of letters of the English alphabet in <strong>uppercase and lowercase</strong>.</li>\n</ul>\n", "translated_title": null, "translated_content": null, "is_paid_only": false, "difficulty": "Medium", "likes": 396, "dislikes": 19, "is_liked": null, "is_favor": null, "similar_questions": null, "contributors": null, "lang_to_valid_playground": null, "topic_tags": [{"name": "String", "slug": "string", "translated_name": null, "typename": null}, {"name": "Sorting", "slug": "sorting", "translated_name": null, "typename": null}], "company_tag_stats": null, "code_snippets": [{"lang": "C++", "lang_slug": "cpp", "code": "class Solution {\npublic:\n string sortVowels(string s) {\n \n }\n};", "typename": "CodeSnippetNode"}, {"lang": "Java", "lang_slug": "java", "code": "class Solution {\n public String sortVowels(String s) {\n \n }\n}", "typename": "CodeSnippetNode"}, {"lang": "Python", "lang_slug": "python", "code": "class Solution(object):\n def sortVowels(self, s):\n \"\"\"\n :type s: str\n :rtype: str\n \"\"\"\n ", "typename": "CodeSnippetNode"}, {"lang": "Python3", "lang_slug": "python3", "code": "class Solution:\n def sortVowels(self, s: str) -> str:\n ", "typename": "CodeSnippetNode"}, {"lang": "C", "lang_slug": "c", "code": "char * sortVowels(char * s){\n\n}", "typename": "CodeSnippetNode"}, {"lang": "C#", "lang_slug": "csharp", "code": "public class Solution {\n public string SortVowels(string s) {\n \n }\n}", "typename": "CodeSnippetNode"}, {"lang": "JavaScript", "lang_slug": "javascript", "code": "/**\n * @param {string} s\n * @return {string}\n */\nvar sortVowels = function(s) {\n \n};", "typename": "CodeSnippetNode"}, {"lang": "TypeScript", "lang_slug": "typescript", "code": "function sortVowels(s: string): string {\n\n};", "typename": "CodeSnippetNode"}, {"lang": "PHP", "lang_slug": "php", "code": "class Solution {\n\n /**\n * @param String $s\n * @return String\n */\n function sortVowels($s) {\n \n }\n}", "typename": "CodeSnippetNode"}, {"lang": "Swift", "lang_slug": "swift", "code": "class Solution {\n func sortVowels(_ s: String) -> String {\n \n }\n}", "typename": "CodeSnippetNode"}, {"lang": "Kotlin", "lang_slug": "kotlin", "code": "class Solution {\n fun sortVowels(s: String): String {\n \n }\n}", "typename": "CodeSnippetNode"}, {"lang": "Dart", "lang_slug": "dart", "code": "class Solution {\n String sortVowels(String s) {\n\n }\n}", "typename": "CodeSnippetNode"}, {"lang": "Go", "lang_slug": "golang", "code": "func sortVowels(s string) string {\n \n}", "typename": "CodeSnippetNode"}, {"lang": "Ruby", "lang_slug": "ruby", "code": "# @param {String} s\n# @return {String}\ndef sort_vowels(s)\n \nend", "typename": "CodeSnippetNode"}, {"lang": "Scala", "lang_slug": "scala", "code": "object Solution {\n def sortVowels(s: String): String = {\n \n }\n}", "typename": "CodeSnippetNode"}, {"lang": "Rust", "lang_slug": "rust", "code": "impl Solution {\n pub fn sort_vowels(s: String) -> String {\n \n }\n}", "typename": "CodeSnippetNode"}, {"lang": "Racket", "lang_slug": "racket", "code": "(define/contract (sort-vowels s)\n (-> string? string?)\n\n )", "typename": "CodeSnippetNode"}, {"lang": "Erlang", "lang_slug": "erlang", "code": "-spec sort_vowels(S :: unicode:unicode_binary()) -> unicode:unicode_binary().\nsort_vowels(S) ->\n .", "typename": "CodeSnippetNode"}, {"lang": "Elixir", "lang_slug": "elixir", "code": "defmodule Solution do\n @spec sort_vowels(s :: String.t) :: String.t\n def sort_vowels(s) do\n\n end\nend", "typename": "CodeSnippetNode"}], "stats": "{\"totalAccepted\": \"46.7K\", \"totalSubmission\": \"58.8K\", \"totalAcceptedRaw\": 46673, \"totalSubmissionRaw\": 58782, \"acRate\": \"79.4%\"}", "ac_rate": null, "hints": ["Add all the vowels in an array and sort the array.", "Replace characters in string s if it's a vowel from the new array."], "solution": null, "has_solution": null, "has_video_solution": null, "status": "ac", "sample_test_case": "\"lEetcOde\"", "judger_available": true, "judge_type": "large", "mysql_schemas": null, "enable_run_code": null, "enable_test_mode": null, "env_info": "{\"cpp\": [\"C++\", \"<p>Compiled with <code> clang 11 </code> using the latest C++ 20 standard.</p>\\r\\n\\r\\n<p>Your code is compiled with level two optimization (<code>-O2</code>). <a href=\\\"https://github.com/google/sanitizers/wiki/AddressSanitizer\\\" target=\\\"_blank\\\">AddressSanitizer</a> is also enabled to help detect out-of-bounds and use-after-free bugs.</p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\"], \"java\": [\"Java\", \"<p><code>OpenJDK 17</code>. Java 8 features such as lambda expressions and stream API can be used. </p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\\r\\n<p>Includes <code>Pair</code> class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.</p>\"], \"python\": [\"Python\", \"<p><code>Python 2.7.12</code>.</p>\\r\\n\\r\\n<p>Most libraries are already imported automatically for your convenience, such as <a href=\\\"https://docs.python.org/2/library/array.html\\\" target=\\\"_blank\\\">array</a>, <a href=\\\"https://docs.python.org/2/library/bisect.html\\\" target=\\\"_blank\\\">bisect</a>, <a href=\\\"https://docs.python.org/2/library/collections.html\\\" target=\\\"_blank\\\">collections</a>. If you need more libraries, you can import it yourself.</p>\\r\\n\\r\\n<p>For Map/TreeMap data structure, you may use <a href=\\\"http://www.grantjenks.com/docs/sortedcontainers/\\\" target=\\\"_blank\\\">sortedcontainers</a> library.</p>\\r\\n\\r\\n<p>Note that Python 2.7 <a href=\\\"https://www.python.org/dev/peps/pep-0373/\\\" target=\\\"_blank\\\">will not be maintained past 2020</a>. For the latest Python, please choose Python3 instead.</p>\"], \"c\": [\"C\", \"<p>Compiled with <code>gcc 8.2</code> using the gnu11 standard.</p>\\r\\n\\r\\n<p>Your code is compiled with level one optimization (<code>-O1</code>). <a href=\\\"https://github.com/google/sanitizers/wiki/AddressSanitizer\\\" target=\\\"_blank\\\">AddressSanitizer</a> is also enabled to help detect out-of-bounds and use-after-free bugs.</p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\\r\\n\\r\\n<p>For hash table operations, you may use <a href=\\\"https://troydhanson.github.io/uthash/\\\" target=\\\"_blank\\\">uthash</a>. \\\"uthash.h\\\" is included by default. Below are some examples:</p>\\r\\n\\r\\n<p><b>1. Adding an item to a hash.</b>\\r\\n<pre>\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n</pre>\\r\\n</p>\\r\\n\\r\\n<p><b>2. Looking up an item in a hash:</b>\\r\\n<pre>\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n</pre>\\r\\n</p>\\r\\n\\r\\n<p><b>3. Deleting an item in a hash:</b>\\r\\n<pre>\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n</pre>\\r\\n</p>\"], \"csharp\": [\"C#\", \"<p><a href=\\\"https://learn.microsoft.com/en-us/dotnet/csharp/whats-new/csharp-10\\\" target=\\\"_blank\\\">C# 10 with .NET 6 runtime</a></p>\"], \"javascript\": [\"JavaScript\", \"<p><code>Node.js 16.13.2</code>.</p>\\r\\n\\r\\n<p>Your code is run with <code>--harmony</code> flag, enabling <a href=\\\"http://node.green/\\\" target=\\\"_blank\\\">new ES6 features</a>.</p>\\r\\n\\r\\n<p><a href=\\\"https://lodash.com\\\" target=\\\"_blank\\\">lodash.js</a> library is included by default.</p>\\r\\n\\r\\n<p>For Priority Queue / Queue data structures, you may use 5.3.0 version of <a href=\\\"https://github.com/datastructures-js/priority-queue/tree/fb4fdb984834421279aeb081df7af624d17c2a03\\\" target=\\\"_blank\\\">datastructures-js/priority-queue</a> and 4.2.1 version of <a href=\\\"https://github.com/datastructures-js/queue/tree/e63563025a5a805aa16928cb53bcd517bfea9230\\\" target=\\\"_blank\\\">datastructures-js/queue</a>.</p>\"], \"ruby\": [\"Ruby\", \"<p><code>Ruby 3.1</code></p>\\r\\n\\r\\n<p>Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms</p>\"], \"swift\": [\"Swift\", \"<p><code>Swift 5.5.2</code>.</p>\"], \"golang\": [\"Go\", \"<p><code>Go 1.21</code></p>\\r\\n<p>Support <a href=\\\"https://github.com/emirpasic/gods/tree/v1.18.1\\\" target=\\\"_blank\\\">https://godoc.org/github.com/emirpasic/[email protected]</a> library.</p>\"], \"python3\": [\"Python3\", \"<p><code>Python 3.10</code>.</p>\\r\\n\\r\\n<p>Most libraries are already imported automatically for your convenience, such as <a href=\\\"https://docs.python.org/3/library/array.html\\\" target=\\\"_blank\\\">array</a>, <a href=\\\"https://docs.python.org/3/library/bisect.html\\\" target=\\\"_blank\\\">bisect</a>, <a href=\\\"https://docs.python.org/3/library/collections.html\\\" target=\\\"_blank\\\">collections</a>. If you need more libraries, you can import it yourself.</p>\\r\\n\\r\\n<p>For Map/TreeMap data structure, you may use <a href=\\\"http://www.grantjenks.com/docs/sortedcontainers/\\\" target=\\\"_blank\\\">sortedcontainers</a> library.</p>\"], \"scala\": [\"Scala\", \"<p><code>Scala 2.13.7</code>.</p>\"], \"kotlin\": [\"Kotlin\", \"<p><code>Kotlin 1.9.0</code>.</p>\"], \"rust\": [\"Rust\", \"<p><code>Rust 1.58.1</code></p>\\r\\n\\r\\n<p>Supports <a href=\\\"https://crates.io/crates/rand\\\" target=\\\"_blank\\\">rand </a> v0.6\\u00a0from crates.io</p>\"], \"php\": [\"PHP\", \"<p><code>PHP 8.1</code>.</p>\\r\\n<p>With bcmath module</p>\"], \"typescript\": [\"Typescript\", \"<p><code>TypeScript 5.1.6, Node.js 16.13.2</code>.</p>\\r\\n\\r\\n<p>Your code is run with <code>--harmony</code> flag, enabling <a href=\\\"http://node.green/\\\" target=\\\"_blank\\\">new ES2022 features</a>.</p>\\r\\n\\r\\n<p><a href=\\\"https://lodash.com\\\" target=\\\"_blank\\\">lodash.js</a> library is included by default.</p>\"], \"racket\": [\"Racket\", \"<p>Run with <code>Racket 8.3</code>.</p>\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 25.0\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.4 with Erlang/OTP 25.0\"], \"dart\": [\"Dart\", \"<p>Dart 2.17.3</p>\\r\\n\\r\\n<p>Your code will be run directly without compiling</p>\"]}", "meta_data": "{\n \"name\": \"sortVowels\",\n \"params\": [\n {\n \"name\": \"s\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"string\"\n }\n}", "code_definition": null}, "user": null, "problemset_question_list": null}}