23:I[344796,["/_next/static/chunks/083cs_iw_ie0y.js","/_next/static/chunks/2sk2f47durg8o.js","/_next/static/chunks/00mfjk9z2ewie.js","/_next/static/chunks/2q9x6spyz4qxv.js","/_next/static/chunks/1wo5i8je1ygp5.js","/_next/static/chunks/1h4l04ysuholp.js","/_next/static/chunks/2qcnia-og0qh0.js","/_next/static/chunks/40webkzfr6rcp.js"],"default"] 29:I[27201,["/_next/static/chunks/083cs_iw_ie0y.js","/_next/static/chunks/2sk2f47durg8o.js","/_next/static/chunks/00mfjk9z2ewie.js","/_next/static/chunks/2q9x6spyz4qxv.js","/_next/static/chunks/1wo5i8je1ygp5.js","/_next/static/chunks/1h4l04ysuholp.js","/_next/static/chunks/2qcnia-og0qh0.js"],"IconMark"] 24:T844,Jasmine has a unique strategy for buying shares online. Each day, she randomly selects `x` companies and checks their current share values. She wants to buy only those shares whose value remains the same when read from right to left. A share is considered acceptable only if its value is non-negative and palindromic. If a share value has a `-` sign, it means the share is in loss, and Jasmine is not interested in buying it. For each share value, output `YES` if it meets Jasmine's criteria; otherwise, output `NO`. **Example 1:** **Input:** ``` 2 313 -11 ``` **Output:** ``` YES NO ``` **Explanation:** - There are `2` companies. - The first company's share value is `313`. Reading it from right to left still gives `313`, and it is not in loss, so `YES` is printed. - The second company's share value is `-11`. Reading the digits from right to left gives `11`, but the negative sign means it is in loss, so Jasmine is not interested and `NO` is printed. **Example 2:** **Input:** ``` 2 12 22 ``` **Output:** ``` NO YES ``` **Explanation:** - There are `2` companies. - The first company's share value is `12`. Reading it from right to left gives `21`, which is different, so `NO` is printed. - The second company's share value is `22`. Reading it from right to left still gives `22`, so `YES` is printed. **Your Task** - Complete the provided `shareValue(x)` function that takes `x` and returns `YES` if the share value is non-negative and reads the same from right to left; otherwise, return `NO`. **Constraints** - `1 ≤ x ≤ 2000` - `-2^31 ≤ n ≤ 2^31` (`n` is prefixed with a `-` sign if the share is in loss) - `x` is always an integer. **Input Format** - The first line contains an integer `x`, the number of companies selected for that day. - The next `x` lines each contain one integer `n`, representing the share value of a company. **Output Format** The output is `x` lines: - For each company's share value, `YES` is printed to standard output if it is non-negative and a palindrome when read from right to left. - Otherwise, `NO` is printed to standard output.25:T692,#include #include #include #include #include #include /* IF IT IS A BINARY TREE OR LINKED LIST PROBLEM, YOU MUST INCLUDE #include "node.h" HERE. OTHERWISE DO NOT. */ using namespace std; using namespace std::chrono; #include using namespace std; class solution { public: string shareValue(long long x) { // Write your code here... } }; // ─── Do not modify below this line — this is the test harness ─── // [INSERT ANY EXTRA HELPER FUNCTIONS PARSED FROM SOURCE HERE E.g. buildTree, linkedListToList] int main(int argc, char* argv[]) { ios_base::sync_with_stdio(false); cin.tie(NULL); solution sol; auto total_duration = 0ns; // Dont change or modify any lines before this point // Input Area Start int n; cin >> n; vector values; values.reserve(n); for(int i = 0; i < n; i++) { long long x; cin >> x; values.push_back(x); } // Input Area End // Function call Area Start auto start = high_resolution_clock::now(); vector result; result.reserve(n); for(int i = 0; i < n; i++) { result.push_back(sol.shareValue(values[i])); } auto stop = high_resolution_clock::now(); // Function call Area End // Output Area Start for(int i = 0; i < n; i++) { cout << result[i]; if(i < n - 1) cout << "\n"; } if(n > 0) cout << "\n"; // Output Area End // Dont change or modify any lines below this line total_duration += duration_cast(stop - start); return 0; }26:Ta4e,import java.util.*; import java.io.IOException; import java.io.BufferedReader; import java.io.InputStreamReader; // [INSERT CLASS NODE DEFINITION HERE IF APPLICABLE] public class Main { static class FastReader { BufferedReader br; StringTokenizer st; public FastReader() { br = new BufferedReader(new InputStreamReader(System.in)); } String next() { while (st == null || !st.hasMoreElements()) { try { st = new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace(); } } return st.nextToken(); } int nextInt() { return Integer.parseInt(next()); } long nextLong() { return Long.parseLong(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine() { String str = ""; try { str = br.readLine(); } catch (IOException e) { e.printStackTrace(); } return str; } } public static void main(String[] args) throws IOException { long total_elapsed_time_ns = 0; Solution sol = new Solution(); FastReader sc = new FastReader(); // Dont Remove the code of above lines in the main function or dont modify them // or dont change the order of the lines. // Input Area Start int n = sc.nextInt(); long[] values = new long[n]; for (int i = 0; i < n; i++) { values[i] = sc.nextLong(); } // Input Area End // Function Call Area Start long start_time = System.nanoTime(); String[] result = new String[n]; for (int i = 0; i < n; i++) { result[i] = sol.shareValue(values[i]); } long end_time = System.nanoTime(); // Function Call Area End // Output Area Start StringBuilder out = new StringBuilder(); for (int i = 0; i < n; i++) { out.append(result[i]); if (i + 1 < n) out.append('\n'); } System.out.print(out.toString()); // Output Area End // Dont change or modify any lines below this line total_elapsed_time_ns += (end_time - start_time); } } // ─── Do not modify below this line — this is the test harness ─── class Solution { public String shareValue(long x) { //Write your code here... } } 27:T692,#include #include #include #include #include #include /* IF IT IS A BINARY TREE OR LINKED LIST PROBLEM, YOU MUST INCLUDE #include "node.h" HERE. OTHERWISE DO NOT. */ using namespace std; using namespace std::chrono; #include using namespace std; class solution { public: string shareValue(long long x) { // Write your code here... } }; // ─── Do not modify below this line — this is the test harness ─── // [INSERT ANY EXTRA HELPER FUNCTIONS PARSED FROM SOURCE HERE E.g. buildTree, linkedListToList] int main(int argc, char* argv[]) { ios_base::sync_with_stdio(false); cin.tie(NULL); solution sol; auto total_duration = 0ns; // Dont change or modify any lines before this point // Input Area Start int n; cin >> n; vector values; values.reserve(n); for(int i = 0; i < n; i++) { long long x; cin >> x; values.push_back(x); } // Input Area End // Function call Area Start auto start = high_resolution_clock::now(); vector result; result.reserve(n); for(int i = 0; i < n; i++) { result.push_back(sol.shareValue(values[i])); } auto stop = high_resolution_clock::now(); // Function call Area End // Output Area Start for(int i = 0; i < n; i++) { cout << result[i]; if(i < n - 1) cout << "\n"; } if(n > 0) cout << "\n"; // Output Area End // Dont change or modify any lines below this line total_duration += duration_cast(stop - start); return 0; }28:T97e,# Share Value Decision ## Problem / Description Jasmine has a unique strategy for buying shares online. Each day, she randomly selects `x` companies and checks their current share values. She wants to buy only those shares whose value remains the same when read from right to left. A share is considered acceptable only if its value is non-negative and palindromic. If a share value has a `-` sign, it means the share is in loss, and Jasmine is not interested in buying it. For each share value, output `YES` if it meets Jasmine's criteria; otherwise, output `NO`. ## Input Format - The first line contains an integer `x`, the number of companies selected for that day. - The next `x` lines each contain one integer `n`, representing the share value of a company. ## Output Format The output is `x` lines: - For each company's share value, `YES` is printed to standard output if it is non-negative and a palindrome when read from right to left. - Otherwise, `NO` is printed to standard output. ## Examples **Example 1:** Input: ``` 2 313 -11 ``` Output: ``` YES NO ``` **Explanation:** - There are `2` companies. - The first company's share value is `313`. Reading it from right to left still gives `313`, and it is not in loss, so `YES` is printed. - The second company's share value is `-11`. Reading the digits from right to left gives `11`, but the negative sign means it is in loss, so Jasmine is not interested and `NO` is printed. **Example 2:** Input: ``` 2 12 22 ``` Output: ``` NO YES ``` **Explanation:** - There are `2` companies. - The first company's share value is `12`. Reading it from right to left gives `21`, which is different, so `NO` is printed. - The second company's share value is `22`. Reading it from right to left still gives `22`, so `YES` is printed. ## Your Task Complete the provided `shareValue(x)` function that takes `x` and returns `YES` if the share value is non-negative and reads the same from right to left; otherwise, return `NO`. ## Constraints - `1 ≤ x ≤ 2000` - `-2^31 ≤ n ≤ 2^31` (`n` is prefixed with a `-` sign if the share is in loss) - `x` is always an integer. ## Notes - The input `x` (first line) is the number of companies, but the function `shareValue` is expected to take a single share value (the parameter `x` in the function) and return the result for that value. - The driver code handles reading `x` and iterating through the values.1c:[["$","script",null,{"type":"application/ld+json","dangerouslySetInnerHTML":{"__html":"{\"@context\":\"https://schema.org\",\"@type\":\"LearningResource\",\"learningResourceType\":\"Coding Question\",\"name\":\"Share Value Decision\",\"description\":\"Jasmine has a unique strategy for buying shares online. Each day, she randomly selects `x` companies and checks their current share values. She wants to buy only those shares whose value remains the same when read from right to left. A share is considered acceptable only if its value is non-negative and palindromic. If a share value has a `-` sign, it means the share is in loss, and Jasmine is not interested in buying it. For each share value, output `YES` if it meets Jasmine's criteria; otherwi\",\"educationalLevel\":\"easy\",\"about\":{\"@type\":\"Organization\",\"name\":\"Texas Instruments\"},\"provider\":{\"@type\":\"Organization\",\"name\":\"OAHelper\",\"url\":\"https://oahelper.in\"},\"isPartOf\":{\"@type\":\"WebSite\",\"name\":\"OAHelper\",\"url\":\"https://oahelper.in\"},\"url\":\"https://oahelper.in/problems/OTEwMDAwMDcxfDA/share-value-decision\"}"}}],["$","script",null,{"type":"application/ld+json","dangerouslySetInnerHTML":{"__html":"{\"@context\":\"https://schema.org\",\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https://oahelper.in/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Problems\",\"item\":\"https://oahelper.in/problems\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Share Value Decision\",\"item\":\"https://oahelper.in/problems/OTEwMDAwMDcxfDA/share-value-decision\"}]}"}}],["$","section",null,{"className":"sr-only","aria-hidden":"true","children":[["$","p",null,{"children":["Company: ","Texas Instruments"]}],["$","p",null,{"children":["Difficulty: ","easy"]}],false,["$","div",null,{"children":[["$","h2",null,{"children":"Problem Statement"}],["$","p",null,{"children":"Jasmine has a unique strategy for buying shares online. Each day, she randomly selects `x` companies and checks their current share values. She wants to buy only those shares whose value remains the same when read from right to left. A share is considered acceptable only if its value is non-negative and palindromic. If a share value has a `-` sign, it means the share is in loss, and Jasmine is not interested in buying it. For each share value, output `YES` if it meets Jasmine's criteria; otherwise, output `NO`. **Example 1:** **Input:** ``` 2 313 -11 ``` **Output:** ``` YES NO ``` **Explanation:** - There are `2` companies. - The first company's share value is `313`. Reading it from right to left still gives `313`, and it is not in loss, so `YES` is printed. - The second company's share value is `-11`. Reading the digits from right to left gives `11`, but the negative sign means it is in loss, so Jasmine is not interested and `NO` is printed. **Example 2:** **Input:** ``` 2 12 22 ``` *"}]]}],false,["$","nav",null,{"aria-label":"Related company pages","children":[["$","$Lb",null,{"href":"/company-questions/texas-instruments","children":["More ","Texas Instruments"," OA questions"]}],["$","$Lb",null,{"href":"/interview-experiences","children":"Interview experiences"}]]}]]}],["$","$L23",null,{"id":"OTEwMDAwMDcxfDA","initialQuestion":{"id":"OTEwMDAwMDcxfDA","title":"Share Value Decision","google_doc_link":null,"problem_statement":"$24","pregiven_code_cpp":"$25","pregiven_code_python":"class solution:\n def shareValue(self, x):\n # Write your code here...\n pass\n\n# ─── Do not modify below this line — this is the test harness ───\nimport time\nimport sys\n\ntotal_elapsed_time_ns = 0\nsol = solution()\n\n# Dont change or modify any lines before this point\n\n# Input Area Start\ndata = sys.stdin.read().split()\nn = int(data[0]) if data else 0\nvalues = [int(v) for v in data[1:1 + n]]\n# Input Area End\n\n# Function Call Area Start\nstart_time_ns = time.perf_counter_ns()\nresult = [sol.shareValue(x) for x in values]\nend_time_ns = time.perf_counter_ns()\n# Function Call Area End\n\n# Output Area Start \nif result:\n print(\"\\n\".join(result))\n# Output Area End\n\n# Dont change or modify any lines below this line\n\ntotal_elapsed_time_ns += end_time_ns - start_time_ns\n \nelapsed_time_seconds = total_elapsed_time_ns / 1e9\n","pregiven_code_java":"$26","difficulty":"easy","question_type":"coding","premium_required":0,"created_at":"2026-08-03T20:37:21.889267+00:00","updated_at":"2026-08-20T14:05:01.945186+00:00","solution":null,"pregiven_code":"$27","input_test_case":"[\"2\\n313\\n-11\\n\", \"2\\n12\\n22\\n\"]","output_test_case":"[\"YES\\nNO\\n\", \"NO\\nYES\\n\"]","lc_tags":null,"visual_animation":null,"difficulty_score":null,"md_problem_statement":"$28","unique_company_name":"texas-instruments","hidden_test_cases_blob_count":33,"campus_type":null,"college_name":null,"role":null,"hidden_test_cases_ref":"95b211e2d9375af5dd30a3a8d80d380064e93eb1034ae0e1086132a8590b7fbd","is_mock_oa":true,"publication_status":"published","has_image":false,"company_name":"Texas Instruments","is_first_in_company":false,"company_ref":"MTk2Mnww","total_test_cases":2,"hidden_test_cases_count":0},"isQotdToday":false,"qotdReward":5}]] 1e:null 22:[["$","title","0",{"children":"Share Value Decision - Texas Instruments OA Question | OAHelper"}],["$","meta","1",{"name":"description","content":"Share Value Decision (Texas Instruments OA) - easy: Jasmine has a unique strategy for buying shares online. Each day, she randomly selects `x` companies and checks their current share values. She wants to buy onl…"}],["$","meta","2",{"name":"author","content":"OAHelper Team"}],["$","meta","3",{"name":"keywords","content":"Texas Instruments OA question, Texas Instruments online assessment, Share Value Decision, easy, online assessment, coding question, OA practice, interview preparation"}],["$","meta","4",{"name":"robots","content":"index, follow"}],["$","meta","5",{"name":"googlebot","content":"index, follow, max-video-preview:-1, max-image-preview:large, max-snippet:-1"}],["$","link","6",{"rel":"canonical","href":"https://oahelper.in/problems/OTEwMDAwMDcxfDA/share-value-decision"}],["$","meta","7",{"name":"google-site-verification","content":"MCxApq58khiH0y4KRigRUpoTS3ckefkhoCSHRIRLiXo"}],["$","meta","8",{"property":"og:title","content":"Share Value Decision - Texas Instruments OA Question | OAHelper"}],["$","meta","9",{"property":"og:description","content":"Share Value Decision (Texas Instruments OA) - easy: Jasmine has a unique strategy for buying shares online. Each day, she randomly selects `x` companies and checks their current share values. She wants to buy onl…"}],["$","meta","10",{"property":"og:url","content":"https://oahelper.in/problems/OTEwMDAwMDcxfDA/share-value-decision"}],["$","meta","11",{"property":"og:site_name","content":"OAHelper"}],["$","meta","12",{"property":"og:image","content":"https://oahelper.in/campus-ceo-favicon.png?v=11"}],["$","meta","13",{"property":"og:image:width","content":"256"}],["$","meta","14",{"property":"og:image:height","content":"256"}],["$","meta","15",{"property":"og:image:alt","content":"Share Value Decision - Texas Instruments OA Question"}],["$","meta","16",{"property":"og:type","content":"website"}],["$","meta","17",{"name":"twitter:card","content":"summary_large_image"}],["$","meta","18",{"name":"twitter:title","content":"Share Value Decision - Texas Instruments OA Question | OAHelper"}],["$","meta","19",{"name":"twitter:description","content":"Share Value Decision (Texas Instruments OA) - easy: Jasmine has a unique strategy for buying shares online. Each day, she randomly selects `x` companies and checks their current share values. She wants to buy onl…"}],["$","meta","20",{"name":"twitter:image","content":"https://oahelper.in/campus-ceo-favicon.png?v=11"}],["$","link","21",{"rel":"shortcut icon","href":"/campus-ceo-favicon.png?v=11"}],["$","link","22",{"rel":"icon","href":"/campus-ceo-favicon-128.png?v=11","sizes":"128x128","type":"image/png"}],["$","link","23",{"rel":"icon","href":"/campus-ceo-favicon.png?v=11","sizes":"256x256","type":"image/png"}],["$","link","24",{"rel":"icon","href":"/campus-ceo-favicon-512.png?v=11","sizes":"512x512","type":"image/png"}],["$","link","25",{"rel":"apple-touch-icon","href":"/campus-ceo-favicon-512.png?v=11","sizes":"180x180","type":"image/png"}],["$","$L29","26",{}]]