#include <iostream>
#include<string>
#include <sstream>
#include"linkedList.h"
#include "ArgumentManager.h"

// read / parse input file and add problems data to LinkedList
void parseInputFile( string inputFileName , LinkedList &problemsList);
// read / parse command file and update LinkedList of problems data
void parseCommandFile( string commandFileName , LinkedList &problemsList);
// read / parse add command and update LinkedList of problems data
void parseAddCommand(string command , LinkedList &problemsList);
// read / parse remove command and update LinkedList of problems data
void parseRemoveCommand(string command , LinkedList &problemsList);
// read / parse sort command and update LinkedList of problems data
void parseSortCommand(string command , LinkedList &problemsList);

int main(int argc, char** argv) {
string inputFileName ,commandFileName , outputFileName;
// get input file name , command file name and output file name
ArgumentManager am(argc, argv);
inputFileName = am.get("input");
commandFileName = am.get("command");
outputFileName = am.get("output");
// create object from LinkedList class
LinkedList problemsList;
// read / parse input file and add problems data to LinkedList
parseInputFile(inputFileName , problemsList);

// read / parse command file and update LinkedList of problems data
parseCommandFile(commandFileName , problemsList);

// write LinkedList of problems data to output file
problemsList.writeToFile(outputFileName);
return 0;
}

// read / parse input file and add problems data to LinkedList
void parseInputFile( string inputFileName , LinkedList &problemsList){
ifstream inputFile;
inputFile.open(inputFileName);
if (!inputFile.is_open()){
cout << "can not open file " << inputFileName << "\n\n";
exit(1) ;
}

// variable to hold line data
string lineData;
long id ;
string name;
string difficulty;
int position = 0 ;
int coloindex; // index of :
int comoindex; // index of ,
// read file line by line
// loop until end of the file
while(getline(inputFile, lineData)){
// skip empty lines
if(lineData.length() == 0){
continue;
}
coloindex = 0;
comoindex = 0;
// parse file line by line
// get problem ID
// find index of first :
// find index of first ,
coloindex = lineData.find(":", coloindex+1);
comoindex = lineData.find(",", comoindex+1);
// extract problem ID from current line
id = stol(lineData.substr((coloindex+1), (comoindex-coloindex-1)));

/////////////////////////////////////////////
// get problem Name
// find index of second :
// find index of second ,
coloindex = lineData.find(":", coloindex+1);
comoindex = lineData.find(",", comoindex+1);
// extract problem name from current line
name = lineData.substr((coloindex+1), (comoindex-coloindex-1));

/////////////////////////////////////////////
// get problem difficulty
// find index of third :
coloindex = lineData.find(":", coloindex+1);
// extract problem difficulty from current line
difficulty = lineData.substr((coloindex+1));
// add problems data to problemsList in order of reading from the input file
problemsList.add(position,id,name,difficulty);
// update position for problemsList
position++;
}
}

void parseCommandFile( string commandFileName , LinkedList &problemsList){
ifstream commandFile;
commandFile.open(commandFileName);
if (!commandFile.is_open()){
cout << "can not open file " << commandFileName << "\n\n";
exit(1) ;
}

// variable to hold line data
string lineData;
// read file line by line
// loop until end of the file
while(getline(commandFile, lineData)){
// skip empty lines
if(lineData.length() == 0){
continue;
}
// check if the command if add command or not
// Find add in current line
size_t index = lineData.find("add");
// if command is add
if (index != string::npos){
parseAddCommand(lineData , problemsList);
continue;
}

// check if the command if remove command or not
// Find remove in current line
index = lineData.find("remove");
// if command is remove
if (index != string::npos){
parseRemoveCommand(lineData , problemsList);
continue;
}

// check if the command if sort command or not
// Find sort in current line
index = lineData.find("sort");

Write a complete program using two arrays, upper and lower to keep...