CareerCup

not sure this is efficient but Doubly Linkedlist with additional capability(See below) could solve the problem:

Consider:
------C1 -- C2 -- C3
================
R1 || L1 -- L2 -- L3
.......||....|........|.........|
R2 || L4 -- L5 -- L6
.......||....|.........|........|
R3 || L7 -- L8 -- L9

The above diagram clearly explains L1 points L2 (next/prev element in row) and L3 (next/prev element in the column) and so on .

so the linkedlist class will be:

class node{

int data;
node *rowNext;
node *columnNext;
node *rowPrev;
node *columnPrev;

void delete row();
void delete column();
void delete element(){
//this one is tricky but a count of indices would make the deletion simpler along with updating the next elements in the current and adjacent row/column;
}

-to delete a column use columnNext to free the memory and update the rowPrev node's address everytime.
-to delete a row use rowNext free the memory and update the columnPrev node's address
-to delete an arbitrary element complex procedure [Update next and adjoint elements -- Creating a function would solve the problem]
****************************************
for the second part of the problem there is something called as DDEML (Dynamic Data Exchange Management Library).

What came 2 my mind instantly was 2d array..But it will not allow insertion ,deletion of rows n cols easily...
so wht abt linked list of linked list??

Sparse Matrix

List of lists (LIL) stores one list per row, where each entry stores a column index and value.

Adjacency list: because its easy to add, delete and update data in it.

Adjacency list: Because we are using memory for data that is stored rather than sparse matrix and because its easy to add, delete and update data in Adjacency list.

How about vector of vectors? Would that be fine in this scenario?

What came 2 my mind instantly was 2d array..But it will not allow insertion ,deletion of rows n cols easily...
so wht abt linked list of linked list??