We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Arrays
  4. Dynamic Array
  5. Discussions

Dynamic Array

  • Kanahaiya
     + 4 comments

    Hello friends,

    In this video tutorial, I have explained the art of translating problem statement into a programming language. Please watch this video till the end and let me know, If you have any doubts or a better approach to solve this problem.

    If interested to know more about the generic algorithm in details-

    click here for the video explanation of generic algorithm with complexity analysis.

    or you can click on the image too to follow youtube tutorial.

    Here is the working solution:-

    source code :

    public class DynamicArray {

	List<Integer> seq = new ArrayList<Integer>();
	List<List<Integer>> seqList = new ArrayList<List<Integer>>();
	int lastAns = 0;

	public DynamicArray(int N) {
		for (int i = 0; i < N; i++) {
			seq = new ArrayList<Integer>();
			seqList.add(seq);
		}
	}

	void appendValue(int x, int y, int N) {
		int rowIndex = (x ^ lastAns) % N;
		List<Integer> seq = seqList.get(rowIndex);
		seq.add(y);
	}

	private void printValue(int x, int y, int N) {
		int colIndex = 0;
		int rowIndex = (x ^ lastAns) % N;
		List<Integer> seq = seqList.get(rowIndex);
		colIndex = y % seq.size();
		lastAns = seq.get(colIndex);
		System.out.println(lastAns);
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int Q = sc.nextInt();
		DynamicArray da = new DynamicArray(N);
		for (int i = 0; i < Q; i++) {
			int queryType = sc.nextInt();
			int x = sc.nextInt();
			int y = sc.nextInt();
			if (queryType == 1) {
				da.appendValue(x, y, N);
			} else {
				da.printValue(x, y, N);
			}

		}
		sc.close();
	}

}
© 2019 GitHub, Inc.

    Would really appreciate your feedback like, dislike , comment etc. on my video.

    Do not forget to upvote, if you find it useful.