this code is to take an equation from the user in the form of a string and then the program configures the confessions and store them in a dynamic array; now I
This is a very common problem in which we would have to find the longest substring which is also a palindrome substring for the given input string. Now there ar
Eclipse has an option that copy-paste of multi-line text into String literals will result in quoted newlines. Preferences > Java > Editor > Typing >
My table has two columns, id and a. Column id contains a number, column a contains an array of strings. I want to count the number of unique id for a given arra
This is my first attempt at LCS. The problem I have is with the last portion. When the two input strings are 'mango' and 'man', it seems that cout keeps messing
I'm trying to create duplicate rows during a dataframe on conditions. For example, I have this Dataframe. students = [ ("a", "Ursula"), ("b", "Hayfa, Ma
I'm very new to C++ and I wanted to compress a std:string object via Zstd compression library, but so far I couldn't find a C++ sample code for this purpose by
I have one string say "Aniruddh" and I want to reverse it using lambdas and streams in Java 8. How can I do it?
Am trying to reverse a string using a method in java, I can fetch all the elements of the string and print them out in order via a loop, my problem is reversing
I am currently formatting numbers to display as currency values using the following code: return symbol + value.toFixed(2).replace(/(\d)(?=(\d{3})+\.)/g, "$1,"
Input: Hello world👩🦰👩👩👦👦 Desired Output: 👩👩👦👦
The code I've written is not producing any output. It just takes the string as an input: #include<stdio.h> #include<conio.h> #include<string.h&g
Is there a way to check if a string contains another string but not necessairely in the correct order : "hel my frend" in "hello my friend" = true "hel my fren
I have a cell array, like so: ID = {'g283', 'sah378', '2938349dgdgf', 'g283'}; I also have some data that corresponds to these IDs. Data = {'data1', 'data2'
I can use occursin function, but its haystack argument cannot be a regular expression, which means I have to pass the entire alphanumeric string to it. Is there
I have a source pointer (pSource) and a goal pointer (pGoal). I also have a number of characters (n) that need to be copied to the pGoal from pSource. I thought
I have lots of files like these: tf_CVBV6Z_CVSA1Z_pws2_pcc1.sac tf_CVBV5Z_CVSA2Z_pws2_pcc1.sac tf_CVBV4Z_CVSA3Z_pws2_pcc1.sac tf_CVBV3Z_CVSA4Z_pws2_pcc1.sac tf
this code is about Too Many Tabs code. URLs are considered equal if the domains are exactly the same, e.g. google.com and google.co.id are different Example inp
what is the elegant way for finding how many times a given string is a substring of another string using scala? The below test cases that should make clear wh
The question states: Write code that takes two strings from the user, and returns what is left over if all instances of the second string is removed from the fi