Problem solving: 1. Given a no. Find next highest no. containing same digits. 2. Given a array and a value k. Find all unique pairs that sums up to k. 3. Anagram check. 4. Given a array, i, j. Find all nos. such that j > i and array[j] > array[i]. 5. Boolean matrix problem. make all the values in a row or column as '1' if there is at least one '1' in that row or column. 6. Given a array where consecutive digits differences out to particular set of values and no. 'k'. Find the index of 'k'. Use hashing. Scripting: 1. Given a log file containing req ID and time consumed. Find all req. IDs consuming time more than certain seconds. Red ID: xyz Time: 10 2. Given a file containing 'Stundent,Marks'. Sum the marks of students and display totals marks student wise. I/P: Stud1,20 Stud2,30 Stud1,10 Stud2,30 O/P: Stud1,30 Stud2,60
