Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
  1. Home
  2. The Lounge
  3. Coding Challenge

Coding Challenge

Scheduled Pinned Locked Moved The Lounge
c++architecturehelp
165 Posts 47 Posters 0 Views 1 Watching
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • C Chris Maunder

    Back in the Days of Yore we had a couple of small coding challenges such as the Lean and Mean comp. I was thinking that there are a ton of small, well defined problems that can be tackled a zillion ways in a zillion languages and that it would be cool to see what you guys can come up with. I'd like to start the ball rolling with the following simple task: Problem: Given a string of text, trim from each end of the text each all occurrences of a given set of strings Sample input: Input string: "dog cat monkey dog horse dog" Strings that need to be trimmed from each end: { "dog", "cat" } Final output should be: " monkey dog horse" Final output should be " cat monkey dog horse " [Edit: My final sample output was incorrect, so to be fair I'll accept either answer] It's up to you whether you worry about case sensitivity. Let's see who can provide the smallest, neatest most elegant, most unique and/or fastest code. For those who feel like jumping on the "No Programming questions" bandwagon, please re-read the lounge guidelines. The point of this is to have fun, not to solve each other's programming issues.

    cheers, Chris Maunder The Code Project | Co-founder Microsoft C++ MVP

    S Offline
    S Offline
    Simon_Whale
    wrote on last edited by
    #35

    Just out of fun as this is fun I created this in VB.NET

    Private Sub Button2_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles Button2.Click
    Dim Input As String = "dog cat monkey dog horse dog"
    Dim ToRemove As String() = New String() {"dog", "cat"}
    Dim Start As Integer = 0
    Dim EndPointer As Integer = 0

        For Each Value As String In ToRemove
            If Start < Input.IndexOf(Value) Then Start = Input.IndexOf(Value) + Value.Length
            If EndPointer < Input.LastIndexOf(Value) Then EndPointer = Input.LastIndexOf(Value)
        Next
    
        MessageBox.Show(Input.Substring(Start, (EndPointer - Start)))
    End Sub
    

    Lobster Thermidor aux crevettes with a Mornay sauce, served in a Provençale manner with shallots and aubergines, garnished with truffle pate, brandy and a fried egg on top and Spam - Monty Python Spam Sketch

    N C 2 Replies Last reply
    0
    • C Chris Maunder

      Back in the Days of Yore we had a couple of small coding challenges such as the Lean and Mean comp. I was thinking that there are a ton of small, well defined problems that can be tackled a zillion ways in a zillion languages and that it would be cool to see what you guys can come up with. I'd like to start the ball rolling with the following simple task: Problem: Given a string of text, trim from each end of the text each all occurrences of a given set of strings Sample input: Input string: "dog cat monkey dog horse dog" Strings that need to be trimmed from each end: { "dog", "cat" } Final output should be: " monkey dog horse" Final output should be " cat monkey dog horse " [Edit: My final sample output was incorrect, so to be fair I'll accept either answer] It's up to you whether you worry about case sensitivity. Let's see who can provide the smallest, neatest most elegant, most unique and/or fastest code. For those who feel like jumping on the "No Programming questions" bandwagon, please re-read the lounge guidelines. The point of this is to have fun, not to solve each other's programming issues.

      cheers, Chris Maunder The Code Project | Co-founder Microsoft C++ MVP

      OriginalGriffO Offline
      OriginalGriffO Offline
      OriginalGriff
      wrote on last edited by
      #36

      I have discovered a truly marvellous solution of this, which the margin of this website is too narrow to contain.

      Ideological Purity is no substitute for being able to stick your thumb down a pipe to stop the water

      "I have no idea what I did, but I'm taking full credit for it." - ThisOldTony
      "Common sense is so rare these days, it should be classified as a super power" - Random T-shirt

      C L L 3 Replies Last reply
      0
      • R Rajesh Anuhya

        Quote:

        Quote:text each all occurrences of a given set of strings

        I think final output should be "Final output should be: " monkey horse ".

        My Tip/Trick[^]

        S Offline
        S Offline
        Simon_Whale
        wrote on last edited by
        #37

        No as you are removing all instances of dog and cat from the string and not from either end of the string

        Lobster Thermidor aux crevettes with a Mornay sauce, served in a Provençale manner with shallots and aubergines, garnished with truffle pate, brandy and a fried egg on top and Spam - Monty Python Spam Sketch

        1 Reply Last reply
        0
        • C Chris Maunder

          Back in the Days of Yore we had a couple of small coding challenges such as the Lean and Mean comp. I was thinking that there are a ton of small, well defined problems that can be tackled a zillion ways in a zillion languages and that it would be cool to see what you guys can come up with. I'd like to start the ball rolling with the following simple task: Problem: Given a string of text, trim from each end of the text each all occurrences of a given set of strings Sample input: Input string: "dog cat monkey dog horse dog" Strings that need to be trimmed from each end: { "dog", "cat" } Final output should be: " monkey dog horse" Final output should be " cat monkey dog horse " [Edit: My final sample output was incorrect, so to be fair I'll accept either answer] It's up to you whether you worry about case sensitivity. Let's see who can provide the smallest, neatest most elegant, most unique and/or fastest code. For those who feel like jumping on the "No Programming questions" bandwagon, please re-read the lounge guidelines. The point of this is to have fun, not to solve each other's programming issues.

          cheers, Chris Maunder The Code Project | Co-founder Microsoft C++ MVP

          S Offline
          S Offline
          Slacker007
          wrote on last edited by
          #38

          Perl, perhaps. One line, maybe two.

          Just along for the ride. "the meat from that butcher is just the dogs danglies, absolutely amazing cuts of beef." - DaveAuld (2011)
          "No, that is just the earthly manifestation of the Great God Retardon." - Nagy Vilmos (2011) "It is the celestial scrotum of good luck!" - Nagy Vilmos (2011)

          1 Reply Last reply
          0
          • D Dalek Dave

            How can anything be described as "Most Unique"? Unique is an absolute, it either is or isn't. Perhaps "Most Elegant" would be a more apposite epithet?

            ------------------------------------ I will never again mention that I was the poster of the One Millionth Lounge Post, nor that it was complete drivel. Dalek Dave CCC Link[^] Trolls[^]

            C Offline
            C Offline
            Chris Maunder
            wrote on last edited by
            #39

            You going to code or are you going to nitpick? ;)

            cheers, Chris Maunder The Code Project | Co-founder Microsoft C++ MVP

            1 Reply Last reply
            0
            • C Chris Maunder

              Back in the Days of Yore we had a couple of small coding challenges such as the Lean and Mean comp. I was thinking that there are a ton of small, well defined problems that can be tackled a zillion ways in a zillion languages and that it would be cool to see what you guys can come up with. I'd like to start the ball rolling with the following simple task: Problem: Given a string of text, trim from each end of the text each all occurrences of a given set of strings Sample input: Input string: "dog cat monkey dog horse dog" Strings that need to be trimmed from each end: { "dog", "cat" } Final output should be: " monkey dog horse" Final output should be " cat monkey dog horse " [Edit: My final sample output was incorrect, so to be fair I'll accept either answer] It's up to you whether you worry about case sensitivity. Let's see who can provide the smallest, neatest most elegant, most unique and/or fastest code. For those who feel like jumping on the "No Programming questions" bandwagon, please re-read the lounge guidelines. The point of this is to have fun, not to solve each other's programming issues.

              cheers, Chris Maunder The Code Project | Co-founder Microsoft C++ MVP

              B Offline
              B Offline
              Bassam Abdul Baki
              wrote on last edited by
              #40

              No to be pedantic about things, bit if you're tokenizing based on "dog" and "cat", your final answer should be "  monkey dog horse " (begins with 2 spaces) or "monkey dog horse " (begins with no space). Otherwise, the requirement on what to do with spaces is incomplete. :)

              Web - BM - RSS - Math - LinkedIn

              C 1 Reply Last reply
              0
              • C Chris Maunder

                Back in the Days of Yore we had a couple of small coding challenges such as the Lean and Mean comp. I was thinking that there are a ton of small, well defined problems that can be tackled a zillion ways in a zillion languages and that it would be cool to see what you guys can come up with. I'd like to start the ball rolling with the following simple task: Problem: Given a string of text, trim from each end of the text each all occurrences of a given set of strings Sample input: Input string: "dog cat monkey dog horse dog" Strings that need to be trimmed from each end: { "dog", "cat" } Final output should be: " monkey dog horse" Final output should be " cat monkey dog horse " [Edit: My final sample output was incorrect, so to be fair I'll accept either answer] It's up to you whether you worry about case sensitivity. Let's see who can provide the smallest, neatest most elegant, most unique and/or fastest code. For those who feel like jumping on the "No Programming questions" bandwagon, please re-read the lounge guidelines. The point of this is to have fun, not to solve each other's programming issues.

                cheers, Chris Maunder The Code Project | Co-founder Microsoft C++ MVP

                J Offline
                J Offline
                JacquesDP
                wrote on last edited by
                #41

                static void Main(string[] args)
                {
                string testString = "dog cat monkey dog horse dog";
                List splitString = new List(testString.Trim().Split(new char[]{' '}));
                for (int index = 0; index < splitString.Count; index++)
                {
                if (splitString[0].Trim().Equals("dog") || splitString[0].Trim().Equals("cat"))
                splitString.RemoveAt(0);
                else if (splitString[splitString.Count - 1].Trim().Equals("dog") || splitString[splitString.Count - 1].Trim().Equals("cat"))
                splitString.RemoveAt(splitString.Count - 1);
                else
                break;
                index = 0;
                }
                string final = "";
                foreach (var entry in splitString)
                final += entry + " ";
                Console.WriteLine(final.Trim());
                Console.ReadKey();
                }

                No matter how long he who laughs last laughs, he who laughs first has a head start!

                1 Reply Last reply
                0
                • H hairy_hats

                  How should whitespace at the ends of the input string be treated - does " cat dog " match or only "cat dog"?

                  C Offline
                  C Offline
                  Chris Maunder
                  wrote on last edited by
                  #42

                  The challenge is to remove the strings that are provided. Nothing is said about removing (or, indeed, caring about, whitespace)

                  cheers, Chris Maunder The Code Project | Co-founder Microsoft C++ MVP

                  H 1 Reply Last reply
                  0
                  • C Chris Losinger

                    Randor wrote:

                    Tokenize the string using white space characters.

                    is that a valid assumption? dogcathorsefoodcat

                    image processing toolkits | batch image processing

                    L Offline
                    L Offline
                    Lost User
                    wrote on last edited by
                    #43

                    Well, I was working from the assumption (or maybe wishful thinking!) that Chris is actually intending to use this to parse tags and remove language keywords[^]. Best Wishes, -David Delaune

                    1 Reply Last reply
                    0
                    • V vonb

                      // Well, this is my piece (C#): static void main(string[] args) { string Input = "doc cat monkey dog horse dog"; List listDeleteStart = new List(); List ListDeleteEnd = new List (); //Output = " monkey dog horse " string[] toTrim = new string[] {"dog", "cat"}; string[] InputStrip = Input.Split(new char[] {' '}); int iCounter = 0; //Going forwards foreach(string strSingle in InputString) { if(toTrim.Contains(strSingle)) ListDeleteStart.Add(iCounter); else break; iCounter++; } //Going backwards InputString = InputString.Reverse().ToArray(); iCounter = InputString.Length-1; foreach(string strSingleRev in InputString) { if(toTrim.Contains(strSingleRev)) ListDeleteStart.Add(iCounter); else break; iCounter--; } //Putting it back again for analysis InputString = InputString.Reverse().ToArray(); string Output = ""; iCounter = 0; foreach (string strResult in InputString) { if(!listDeleteStart.Contains(iCounter) && !listDeletedEnd.Contains(iCounter)) Output+= " " + strResult + " "; iCounter++; } Console.WriteLine(Output); Console.ReadKey(); }

                      N Offline
                      N Offline
                      NormDroid
                      wrote on last edited by
                      #44

                      Failed: 1. No formatting 2. Language Dependent 3. Too verbose

                      Software Kinetics Wear a hard hat it's under construction
                      Metro RSS

                      L 1 Reply Last reply
                      0
                      • S Simon_Whale

                        Just out of fun as this is fun I created this in VB.NET

                        Private Sub Button2_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles Button2.Click
                        Dim Input As String = "dog cat monkey dog horse dog"
                        Dim ToRemove As String() = New String() {"dog", "cat"}
                        Dim Start As Integer = 0
                        Dim EndPointer As Integer = 0

                            For Each Value As String In ToRemove
                                If Start < Input.IndexOf(Value) Then Start = Input.IndexOf(Value) + Value.Length
                                If EndPointer < Input.LastIndexOf(Value) Then EndPointer = Input.LastIndexOf(Value)
                            Next
                        
                            MessageBox.Show(Input.Substring(Start, (EndPointer - Start)))
                        End Sub
                        

                        Lobster Thermidor aux crevettes with a Mornay sauce, served in a Provençale manner with shallots and aubergines, garnished with truffle pate, brandy and a fried egg on top and Spam - Monty Python Spam Sketch

                        N Offline
                        N Offline
                        NormDroid
                        wrote on last edited by
                        #45

                        Shit my eyes are bleeding :)

                        Software Kinetics Wear a hard hat it's under construction
                        Metro RSS

                        S 1 Reply Last reply
                        0
                        • H hairy_hats

                          Randor wrote:

                          I think the single pass algorithm could be implemented in a single lambda line of code.

                          The Not-So-KISS solution.

                          L Offline
                          L Offline
                          Lost User
                          wrote on last edited by
                          #46

                          Hmmm, Do you think it would be uglier and more complicated than this[^] dual lambda? :-D Best Wishes, -David Delaune

                          1 Reply Last reply
                          0
                          • C Chris Losinger

                            can we assume the input string is going to be tokenizable on ' ' ? or, should we expect things like "dogcatcotblahfoodog"

                            image processing toolkits | batch image processing

                            C Offline
                            C Offline
                            Chris Maunder
                            wrote on last edited by
                            #47

                            No consideration of whitespace is provided.

                            cheers, Chris Maunder The Code Project | Co-founder Microsoft C++ MVP

                            C 1 Reply Last reply
                            0
                            • L Lost User

                              Hmmmm, 2 KISS algorithms A two pass algorithm might be: 1.) Tokenize the string using white space characters. 2.) Moving from left to right, push the string into a deque if the string is not in the excluded list. If we encounter a string that is included, all proceeding tags are pushed into the deque. 3.) Then do the same from right to left. A single pass algorithm might be: 1.) Tokenize the string using white space characters. 2.) Push all tags into a pair of string:index 3.) For each pair of string and index, if the string is excluded... if the index value of all other string:index pairs before me are also excluded... My index is the beginning of the string. 4.) For each pair of string and index, if the string is excluded... if the index value of all other string:index pairs after me are also excluded... My index is the end of the string. :) I'm too lazy to write the code. Btw, I think the single pass algorithm could be implemented in a single lambda line of code. Best Wishes, -David Delaune

                              C Offline
                              C Offline
                              Chris Maunder
                              wrote on last edited by
                              #48

                              No whitespace treatment is specified in the spec so you can't assume tokenisation is possible

                              cheers, Chris Maunder The Code Project | Co-founder Microsoft C++ MVP

                              L 1 Reply Last reply
                              0
                              • C Chris Maunder

                                No whitespace treatment is specified in the spec so you can't assume tokenisation is possible

                                cheers, Chris Maunder The Code Project | Co-founder Microsoft C++ MVP

                                L Offline
                                L Offline
                                Lost User
                                wrote on last edited by
                                #49

                                Awww shucks. :sigh:

                                1 Reply Last reply
                                0
                                • S Simon_Whale

                                  Just out of fun as this is fun I created this in VB.NET

                                  Private Sub Button2_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles Button2.Click
                                  Dim Input As String = "dog cat monkey dog horse dog"
                                  Dim ToRemove As String() = New String() {"dog", "cat"}
                                  Dim Start As Integer = 0
                                  Dim EndPointer As Integer = 0

                                      For Each Value As String In ToRemove
                                          If Start < Input.IndexOf(Value) Then Start = Input.IndexOf(Value) + Value.Length
                                          If EndPointer < Input.LastIndexOf(Value) Then EndPointer = Input.LastIndexOf(Value)
                                      Next
                                  
                                      MessageBox.Show(Input.Substring(Start, (EndPointer - Start)))
                                  End Sub
                                  

                                  Lobster Thermidor aux crevettes with a Mornay sauce, served in a Provençale manner with shallots and aubergines, garnished with truffle pate, brandy and a fried egg on top and Spam - Monty Python Spam Sketch

                                  C Offline
                                  C Offline
                                  Chris Maunder
                                  wrote on last edited by
                                  #50

                                  Won't work if you have "dog dog text". It will only remove the first "dog"

                                  cheers, Chris Maunder The Code Project | Co-founder Microsoft C++ MVP

                                  S J 2 Replies Last reply
                                  0
                                  • C Chris Maunder

                                    Back in the Days of Yore we had a couple of small coding challenges such as the Lean and Mean comp. I was thinking that there are a ton of small, well defined problems that can be tackled a zillion ways in a zillion languages and that it would be cool to see what you guys can come up with. I'd like to start the ball rolling with the following simple task: Problem: Given a string of text, trim from each end of the text each all occurrences of a given set of strings Sample input: Input string: "dog cat monkey dog horse dog" Strings that need to be trimmed from each end: { "dog", "cat" } Final output should be: " monkey dog horse" Final output should be " cat monkey dog horse " [Edit: My final sample output was incorrect, so to be fair I'll accept either answer] It's up to you whether you worry about case sensitivity. Let's see who can provide the smallest, neatest most elegant, most unique and/or fastest code. For those who feel like jumping on the "No Programming questions" bandwagon, please re-read the lounge guidelines. The point of this is to have fun, not to solve each other's programming issues.

                                    cheers, Chris Maunder The Code Project | Co-founder Microsoft C++ MVP

                                    M Offline
                                    M Offline
                                    Mark_Wallace
                                    wrote on last edited by
                                    #51

                                    Too easy.

                                    While DogsAndCatsAreStillInTheLine
                                    LineEnd = "left"
                                    GetRidOfCatsAndDogs(LineEnd)
                                    LineEnd = "right"
                                    GetRidOfCatsAndDogs(LineEnd)
                                    Wend

                                    GetRidOfCatsAndDogs {
                                    OpenCanOfDogFood(ThisEnd)
                                    OpenCanOfCatFood(ThisEnd)
                                    }

                                    It's so simple that it's not even worth optimising it or using recursion. For future updates, though, it would be a good idea to use a set for the animals to remove, so that different ones could be included, another for the line ends (so that multiple lines could be serviced), and a third for the food types -- although getting bamboo shoots for pandas, eucalyptus leaves for koalas, and starlets for great whites might cause difficulties in implementation.

                                    I wanna be a eunuchs developer! Pass me a bread knife!

                                    C 1 Reply Last reply
                                    0
                                    • OriginalGriffO OriginalGriff

                                      I have discovered a truly marvellous solution of this, which the margin of this website is too narrow to contain.

                                      Ideological Purity is no substitute for being able to stick your thumb down a pipe to stop the water

                                      C Offline
                                      C Offline
                                      Chris Maunder
                                      wrote on last edited by
                                      #52

                                      Thank you, Fermat.

                                      cheers, Chris Maunder The Code Project | Co-founder Microsoft C++ MVP

                                      1 Reply Last reply
                                      0
                                      • C Chris Maunder

                                        Back in the Days of Yore we had a couple of small coding challenges such as the Lean and Mean comp. I was thinking that there are a ton of small, well defined problems that can be tackled a zillion ways in a zillion languages and that it would be cool to see what you guys can come up with. I'd like to start the ball rolling with the following simple task: Problem: Given a string of text, trim from each end of the text each all occurrences of a given set of strings Sample input: Input string: "dog cat monkey dog horse dog" Strings that need to be trimmed from each end: { "dog", "cat" } Final output should be: " monkey dog horse" Final output should be " cat monkey dog horse " [Edit: My final sample output was incorrect, so to be fair I'll accept either answer] It's up to you whether you worry about case sensitivity. Let's see who can provide the smallest, neatest most elegant, most unique and/or fastest code. For those who feel like jumping on the "No Programming questions" bandwagon, please re-read the lounge guidelines. The point of this is to have fun, not to solve each other's programming issues.

                                        cheers, Chris Maunder The Code Project | Co-founder Microsoft C++ MVP

                                        L Offline
                                        L Offline
                                        Lost User
                                        wrote on last edited by
                                        #53

                                        My approach is to use substring to grab the current end and starting strings. Substring is also used to update the result. I am sure there are some faster ways, but this approach is very clean IMO.

                                        public string Parse(string input, List remove)
                                        {
                                        string result = input.Trim();
                                        bool startRemoved;
                                        bool endRemoved;

                                        do
                                        {
                                            startRemoved = false;
                                            endRemoved = false;
                                        
                                            foreach (var match in remove)
                                            {            
                                                //Determine if the remove string is fitable with in the remaining output
                                                bool inRange = result.Length >= match.Length;
                                        
                                                //Capture the beginning and ending characters
                                                string beginning = result.Substring(0, match.Length);
                                                string end = result.Substring(result.Length - match.Length, match.Length);
                                        
                                                if (inRange && beginning.Equals(match))
                                                {
                                                    //Update the result with the matched section removed
                                                    result = result.Substring(match.Length, result.Length - match.Length).TrimStart();
                                                    startRemoved = true;
                                                }
                                        
                                                if (inRange && end.Equals(match))
                                                {
                                                    //Update the result with the matched section removed
                                                    result = result.Substring(0, result.Length - match.Length).TrimEnd();
                                                    endRemoved = true;
                                                }
                                            }
                                        } while (startRemoved || endRemoved);
                                        return result;        
                                        

                                        }

                                        [Edit] Added a do while. The do while shuts down if nothing is removed. If anything is removed it must go back and check the removal collection. Optimization could be to track which is removed to then check up to that point. E.g. "dog" "cat" and "monkey" are to be removed (and collection is in that order). If "cat" is removed (start or end), then "monkey" will be checked on active foreach. "dog" and "cat" are the only ones that need be checked on the next do while iteration (unless one of them removes another character set) [Edit] Added Trimmers.

                                        Computers have been intelligent for a long time now. It just so happens that the program writers are about as effective as a room full of monkeys trying to crank out a copy of Hamlet.

                                        M 1 Reply Last reply
                                        0
                                        • B Bassam Abdul Baki

                                          No to be pedantic about things, bit if you're tokenizing based on "dog" and "cat", your final answer should be "  monkey dog horse " (begins with 2 spaces) or "monkey dog horse " (begins with no space). Otherwise, the requirement on what to do with spaces is incomplete. :)

                                          Web - BM - RSS - Math - LinkedIn

                                          C Offline
                                          C Offline
                                          Chris Maunder
                                          wrote on last edited by
                                          #54

                                          Who said anything about tokenising?

                                          cheers, Chris Maunder The Code Project | Co-founder Microsoft C++ MVP

                                          B 1 Reply Last reply
                                          0
                                          Reply
                                          • Reply as topic
                                          Log in to reply
                                          • Oldest to Newest
                                          • Newest to Oldest
                                          • Most Votes


                                          • Login

                                          • Don't have an account? Register

                                          • Login or register to search.
                                          • First post
                                            Last post
                                          0
                                          • Categories
                                          • Recent
                                          • Tags
                                          • Popular
                                          • World
                                          • Users
                                          • Groups