CareerCup

import java.util.*;
class PrintAllSorted 
{
	public static void main(String[] args) 
	{
		List<String> strs = new ArrayList<String>();
		strs.add("abc");
		strs.add("def");
		strs.add("yz");
		PrintSorted(strs, "", 0);
	}
	public static void PrintSorted(List<String> strs, String currentStr, int focusListIndex)
	{
		//check if more str in list to proceed
		if(focusListIndex==strs.size())
		{
			System.out.println(currentStr);
		}
		else
		{
			char lastChar = (char)0;
			if(currentStr.length()>0)
				lastChar = currentStr.charAt(currentStr.length()-1);
			String tempStr = strs.get(focusListIndex);
			for(int i=0; i<tempStr.length();i++)
			{
				//check each char at ith string fits the scenario
				if(tempStr.charAt(i)>lastChar)//can be candidate
				{
					PrintSorted(strs, currentStr+tempStr.charAt(i), focusListIndex+1);
				}
			}
		}
	}
}

I am writing the algo for this

Take a hash which will look like this [Assuming the input given in in sorted order]

A->B->C->D
D->E->F
Y->Z

Now we can take the first element of every row
ADY
Increment last row by one and carry on like
ADZ
AEY
AEZ


Please let me know if I am doing something wrong here

vector<string> get_sorted(vector<vector<int>>& lists)
{
	vector<string> vec;
	vector<int> index;
	for(size_t i = 0; i < lists.size(); ++i)
	{
		if(lists[i].size() == 0)
		{
			return vec;
		}

		int elt = list[i][0];

		vector<int>::iterator it = list[i].begin();
		while(it != list[i].end() && elt >= list[*it][0])
		{
			++it;
		}

		index.insert(it, elt);
	}

	string str;
	for(size_t i = 0; i < index.size(); ++i)
	{
		str += list[index[i]].pop();
	}
	
	vec.push_back(str);	
	vector<string> strs = get_sorted(lists);
	for(size_t i = 0; i < strs.size(); ++i)
	{
		vec.push_back(strs[i]);
	}
	
	return vec;
}

// question is nothing but printing the cross-products

void cross_product(vector<string>& strs)
{
          int p  = 1;
          for (int i=0; i < strs.size(); i++) p *= strs[i];
          for (int i=0; i < p ; i++)
          {
                   
                    int j = p; 
                    for (int k=0; k < strs.size(); k++)
                    {
                                    int s = strs[k].size();
                                    j /= s; 
                                    cout << strs[j][ (i/j)%s ] << endl; 
                    }
          }
}

// question is nothing but printing the cross-products

void cross_product(vector<string>& strs)
{
          int p  = 1;
          for (int i=0; i < strs.size(); i++) p *= strs[i];
          for (int i=0; i < p ; i++)
          {
                   
                    int j = p; 
                    for (int k=0; k < strs.size(); k++)
                    {
                                    int s = strs[k].size();
                                    j /= s; 
                                    cout << strs[j][ (i/j)%s ] << endl; 
                    }
          }
}