Algo-Tree
Algo-Tree copied to clipboard
Algo-Phantoms
find first non-repeating character in a string.
The program will find the first non-repeating character in the string if it is present in the string and I will be implementing it in c++. please assign to me this issue. @tarun26091999
Hi @IdealisticINTJ if you want to work on this issue please choose another language, not CPP. I am already working on this in CPP.
hey I am Simarjeet kaur ,GSSOC 21 .I want to work on this issue using C/C++/PYTHON. I would follow these steps: Start traversing the string using two loops. Use the first loop to scan the characters of the string one by one. Use the second loop to find if the current character is occurring in the latter part if the string or not. If it is not occurring, print that character. Else, continue traversing.
This issue has already been assigned to me in python
On Thu, Mar 11, 2021, 05:08 simarjeet @.***> wrote:
hey I am Simarjeet kaur ,GSSOC 21 .I want to work on this issue using C/C++/PYTHON. I would follow these steps: Start traversing the string using two loops. Use the first loop to scan the characters of the string one by one. Use the second loop to find if the current character is occurring in the latter part if the string or not. If it is not occurring, print that character. Else, continue traversing.
— You are receiving this because you were mentioned. Reply to this email directly, view it on GitHub https://github.com/Algo-Phantoms/Algo-Tree/issues/569#issuecomment-796622037, or unsubscribe https://github.com/notifications/unsubscribe-auth/ANO32HOQMX7SOIVDZPQ3INTTDCJAFANCNFSM4Y7WF5JQ .
Hi @IdealisticINTJ if you want to work on this issue please choose another language, not CPP. I am already working on this in CPP.
you can make a contribution only after the issue is assigned to you.
Please assign this issue to me under gssoc'21.I can implement it in c++/java/python.
can i work on the issue? I am a participant at GSSOC 2021 and i will be working in cpp.
Hello! I am a GSSoC'21 Participant. I would like to work on this issue. Would be highly obliged if you could assign it to me. I will be using Java. Thanks!
hey I am Simarjeet kaur ,GSSOC 21 .I want to work on this issue using C/C++/PYTHON. I would follow these steps: Start traversing the string using two loops. Use the first loop to scan the characters of the string one by one. Use the second loop to find if the current character is occurring in the latter part if the string or not. If it is not occurring, print that character. Else, continue traversing.
do it in python in O(n) time.
Kindly assign it to me .I will be doing it in python sir
On Sun, Mar 28, 2021, 10:58 Tarun Yadav @.***> wrote:
hey I am Simarjeet kaur ,GSSOC 21 .I want to work on this issue using C/C++/PYTHON. I would follow these steps: Start traversing the string using two loops. Use the first loop to scan the characters of the string one by one. Use the second loop to find if the current character is occurring in the latter part if the string or not. If it is not occurring, print that character. Else, continue traversing.
do it in python in O(n) time.
— You are receiving this because you were mentioned. Reply to this email directly, view it on GitHub https://github.com/Algo-Phantoms/Algo-Tree/issues/569#issuecomment-808908260, or unsubscribe https://github.com/notifications/unsubscribe-auth/ANO32HP7AX4TIO7BX4E2OATTF47YNANCNFSM4Y7WF5JQ .
@tarun26091999 sir thank you for assigning me this issue .I will write a neat and clean code for this problem in python and will submit a PR in a week for sure.