CareerCup

void ExpandString(std::string str1)
{
	map<std::string, std::string> mapStrExpan;

	int nLength = str1.length(); 
	bool openBrace = false, closeBrace = false;
	string strTemp = "";
	for (int i = 0; i <nLength ; i++ )
	{
		strTemp = str1[i];
		if (str1[i] == '{')
		{
			mapStrExpan[strTemp] ;
			openBrace = true;
		}
		else if (str1[i] == '}')
		{
			mapStrExpan[strTemp];
			openBrace = false;
			closeBrace = true;
		}
		else
		{
			if(openBrace)
				mapStrExpan["{"] += strTemp;
			else if (closeBrace)
				mapStrExpan["last"] += strTemp;
			else
				mapStrExpan["first"] += strTemp;
		}
	}

	map<std::string, std::string>::iterator itMap; 
	map<std::string, std::string>::iterator itMapLast;

	std::string expanString = "";
	std::string strLast = "";
	//seperating first last strings from the middle and printing in combination.
	if ((itMapLast = mapStrExpan.find("first")) != mapStrExpan.end())
	{
		expanString += itMapLast->second;
	}

	if ((itMapLast = mapStrExpan.find("last")) != mapStrExpan.end())
	{
		strLast += itMapLast->second;
	}

	if ((itMapLast = mapStrExpan.find("{")) != mapStrExpan.end())
	{
		int nLeng = itMapLast->second.length();
		std::string middlestr = itMapLast->second;

		printf("Combination of Strings \r\n");
		std::string strFinal; 
		for (int i = 0; i < nLeng; i++)
		{
			if (middlestr[i] != ',')
			{
				strFinal = expanString + middlestr[i] + strLast;
				printf("%s\r\n", strFinal.c_str());
			}
		}

	}

}

int main()
{
	std::string str1 = "ahj{d,c,b,m,o,p,q}etu";

	ExpandString(str1);

	getchar();

}

void LongestSubSequence(int arr[], int arr2[],int n1,int n2)
{
	map<int, int> mapMerged = { make_pair(0,0) };
	map<int, int>::iterator mapIt;

	int largest = (n1 > n2) ? n1 : n2;
	for (int i = 0; i < largest; i++)
	{
		if (i < n1)
		{
			mapMerged[arr[i]]++;
		}
		if (i < n2)
		{
			mapMerged[arr2[i]]++;
		}
	}
	
	//Print sequence now.
	for (mapIt = mapMerged.begin(); mapIt != mapMerged.end(); mapIt++)
	{
		if(mapIt->second > 1)
			printf("%d ",mapIt->first);
	}
}

int main()
{
	int arr1[] = {1,5,2,6,3,7,9,10,55,34};
	int arr2[] = { 5,6,7,1,2,3,10 };

	int n1 = sizeof(arr1) / sizeof(int);

	int n2 = sizeof(arr2) / sizeof(int);



	LongestSubSequence(arr1,arr2,n1,n2);
}

void removeDuplicateLineFromFile(std::string strFileContent[],int nSize)
{
	map<std::string, int> mapFile;

	for (int i = 0; i < nSize; i++)
	{
		if (mapFile.find(strFileContent[i]) == mapFile.end())
		{
			mapFile[strFileContent[i]] = 1 ;
			//mapFile.insert(std::pair(strFileContent[i], 1));
			//mapFile.insert(strFileContent[i],1);
		}
	}
	printf("Removed duplicate result \r\n");
	map<string, int>::iterator mapIt;

	for (mapIt = mapFile.begin(); mapIt != mapFile.end() ; mapIt++)
	{
		printf("%s\r\n", mapIt->first.c_str());
	}
}


int main()
{

	std::string strFileContent[] = { {"single line"},{"double line"}, {"single line"}, {"thrible line"},{"double line"},{"single line"},{"single line"} };

	int nSize = sizeof(strFileContent) / sizeof(std::string);

	removeDuplicateLineFromFile(strFileContent, nSize);
}

void removeDuplicateLineFromFile(std::string strFileContent[],int nSize)
{
	map<std::string, int> mapFile;

	for (int i = 0; i < nSize; i++)
	{
		if (mapFile.find(strFileContent[i]) == mapFile.end())
		{
			mapFile[strFileContent[i]] = 1 ;
			//mapFile.insert(std::pair(strFileContent[i], 1));
			//mapFile.insert(strFileContent[i],1);
		}
	}
	printf("Removed duplicate result \r\n");
	map<string, int>::iterator mapIt;

	for (mapIt = mapFile.begin(); mapIt != mapFile.end() ; mapIt++)
	{
		printf("%s\r\n", mapIt->first.c_str());
	}
}


int main()
{

	std::string strFileContent[] = { {"single line"},{"double line"}, {"single line"}, {"thrible line"},{"double line"},{"single line"},{"single line"} };

	int nSize = sizeof(strFileContent) / sizeof(std::string);

	removeDuplicateLineFromFile(strFileContent, nSize);
}

bool CanProgramStarted(list<pair<int,int>> runningProgram, pair<int,int> Programs)
{
	list<pair<int, int>>::iterator itList;
	//if starting time falls b/w existing start and end time then No otherwise yes
	for (itList = runningProgram.begin() ; itList != runningProgram.end() ; itList++)
	{
		if (Programs.first >= itList->first && Programs.first <= (itList->first + itList->second))
			return false;
		
	}

	//Add the program to the list
	runningProgram.push_back(Programs);
	return true;
}


//_CRT_SECURE_NO_WARNINGS

int main()
{
	list<pair<int, int>> runningProgram;
	pair<int, int> progrm1(10, 5);
	pair<int, int> progrm2(25, 15);

	   
	runningProgram.push_back(progrm1);
	runningProgram.push_back(progrm2);

	pair<int, int> progrm3(18, 7);
	printf("Program start status : %d \r\n", CanProgramStarted(runningProgram, progrm3));

	pair<int, int> progrm4(12, 10);
	printf("Program start status : %d \r\n", CanProgramStarted(runningProgram, progrm4));

}