CareerCup

void swap( char &a, char &b )
{
     char temp = a;
     a = b;
     b = temp;
}

void reverse( char *beg, char *end )
{
     end--;
     while( end > beg )    
     {
            swap( *beg, *end );
            beg++;
            end--;
     }
}

void reversesentence( char *str )
{
     char *beg = str;
     char *end = &str[ strlen(str) ];
     
     //First Pass
     reverse( beg, end );
     
     //Second Pass: Now reverse each word using space as delimiter
     while( 1 )
     {
            end = beg;
            while( *end != ' ' )
            {
                   if( *end == '\0' )
                   {
                       break;
                   }
                   end++;
            }
            reverse( beg, end );
            
            if( *end == '\0' )
            {
                break;
            }
            else
            {
                beg = end+1;
            }
      }
}

int main()
{
    char str[] = "Is Love to Play";
    
    cout << str << endl;
    reversesentence( str );
    cout << str << endl;
}

This is the only method I could come up with that is covering all the possible combinations.

Hi Everyone,

I came up with the following solution to the above problem. The combinations form a very weird series. Below is the code for it. Let me know if this can be done in a more efficient time.

#include<stdio.h>
#include<stdlib.h>

#define MAX_SUM 27
#define NDIGIT 3
#define C0 1

int main(){
    register int TOTAL = 0;
    int mid = MAX_SUM/2;
    int curr;
    int prev_val[2] = {C0, NDIGIT};
       
    for(int sum=2; sum<=mid; sum++){
            curr = (prev_val[1] - prev_val[0]) + 1 + prev_val[1];
            TOTAL += 2*(prev_val[0]*prev_val[0]);
            prev_val[0] = prev_val[1];
            prev_val[1] = curr;
    }
    
    TOTAL += 2*(prev_val[0]*prev_val[0]) + 2*(prev_val[1]*prev_val[1]);
    
    printf("Winning Tickets = %d\n", TOTAL);
    return 0;
}

How about using a Prefix Tree of dictionary words and searching through the given string to find the longest word?