Getting error in Linkedlist k reverse

[balasubramaniangopalakrishnan]

Main.java:2: error: class LinkedList is public, should be declared in a file named LinkedList.java
public class LinkedList {
^
1 error
Looks like system error could you take a look?

[sanchit.bansal06 (Sanchit Bansal)]

@balasubramaniangopalakrishnan,

Can you share your code too please?

[balasubramaniangopalakrishnan]

Any updates on this?

[balasubramaniangopalakrishnan]

i have replied to the email thread as well

[sanchit.bansal06 (Sanchit Bansal)]

@balasubramaniangopalakrishnan,

You will get a response soon. Don’t worry. Can you please share your code too?

[balasubramaniangopalakrishnan]

It is more than a day and this issue still persists. Let me know how long will you take to fix this?Platform issues has to be fixed as soon as possible

[sanchit.bansal06 (Sanchit Bansal)]

@balasubramaniangopalakrishnan,
Please share your code through: https://ide.codingblocks.com/

Steps to copy code: select the correct language; copy your code; click on save; share the link

[balasubramaniangopalakrishnan]

Sanchit, I think you have to do the following steps to reproduce the issue

[balasubramaniangopalakrishnan]

Go to the problem select java click compile and run you will get the error that i am saying

[balasubramaniangopalakrishnan]

import java.util.*; public class LinkedList { private class Node { int data; Node next; Node(int data, Node next) { this.data = data; this.next = next; } } private Node head; private Node tail; private int size; public LinkedList() { this.head = null; this.tail = null; this.size = 0; } public LinkedList(Node head, Node tail, int size) { this.head = head; this.tail = tail; this.size = size; } // O(1) public int size() { return this.size; } // O(1) public boolean isEmpty() { return this.size() == 0; } // O(1) public int getFirst() throws Exception { if (this.isEmpty()) { throw new Exception(“List is empty.”); } return this.head.data; } // O(1) public int getLast() throws Exception { if (this.isEmpty()) { throw new Exception(“List is empty.”); } return this.tail.data; } // O(N) public int getAt(int idx) throws Exception { Node temp = this.getNodeAt(idx); return temp.data; } // O(N) private Node getNodeAt(int idx) throws Exception { if (this.isEmpty()) { throw new Exception(“List is empty”); } if (idx < 0 || idx >= this.size()) { throw new Exception(“Invalid arguments”); } Node retVal = this.head; for (int i = 0; i < idx; i++) { retVal = retVal.next; } return retVal; } // O(1) public void addFirst(int data) { Node node = new Node(data, this.head); if (this.size() == 0) { this.head = node; this.tail = node; } else { this.head = node; } this.size++; } // O(1) public void addLast(int data) { Node node = new Node(data, null); if (this.size() == 0) { this.head = node; this.tail = node; } else { this.tail.next = node; this.tail = node; } this.size++; } // O(n) public void addAt(int idx, int data) throws Exception { if (idx < 0 || idx > this.size()) { throw new Exception(“Invalid arguments”); } if (idx == 0) { this.addFirst(data); } else if (idx == this.size()) { this.addLast(data); } else { Node nm1 = this.getNodeAt(idx - 1); Node n = nm1.next; Node node = new Node(data, n); nm1.next = node; this.size++; } } // O(1) public int removeFirst() throws Exception { if (this.isEmpty()) { throw new Exception(“List is empty”); } int retVal = this.head.data; if (this.size() == 1) { this.head = null; this.tail = null; } else { this.head = this.head.next; } this.size–; return retVal; } // O(n) public int removeLast() throws Exception { if (this.isEmpty()) { throw new Exception(“List is empty”); } int retVal = this.tail.data; if (this.size() == 1) { this.head = null; this.tail = null; } else { Node sm2 = this.getNodeAt(this.size() - 2); sm2.next = null; this.tail = sm2; } this.size–; return retVal; } // O(n) public int removeAt(int idx) throws Exception { if (this.isEmpty()) { throw new Exception(“List is empty”); } if (idx < 0 || idx >= this.size()) { throw new Exception(“Invalid arguments”); } if (idx == 0) { return this.removeFirst(); } else if (idx == this.size() - 1) { return this.removeLast(); } else { Node nm1 = this.getNodeAt(idx - 1); Node n = nm1.next; Node np1 = n.next; nm1.next = np1; this.size–; return n.data; } } // O(n) public void display() { Node node = this.head; while (node != null) { System.out.print(node.data + " "); node = node.next; } //System.out.println(“END”); } public void reverse(int k){ // Write your code here } public static void main(String[] args) throws Exception { Scanner scn = new Scanner(System.in); int N = scn.nextInt(); int k = scn.nextInt(); LinkedList list = new LinkedList(); for (int i = 0; i < N; i++) { list.addLast(scn.nextInt()); } list.reverse(k); list.display(); } }

[balasubramaniangopalakrishnan]

import java.util.*; public class LinkedList { private class Node { int data; Node next; Node(int data, Node next) { this.data = data; this.next = next; } } private Node head; private Node tail; private int size; public LinkedList() { this.head = null; this.tail = null; this.size = 0; } public LinkedList(Node head, Node tail, int size) { this.head = head; this.tail = tail; this.size = size; } // O(1) public int size() { return this.size; } // O(1) public boolean isEmpty() { return this.size() == 0; } // O(1) public int getFirst() throws Exception { if (this.isEmpty()) { throw new Exception(“List is empty.”); } return this.head.data; } // O(1) public int getLast() throws Exception { if (this.isEmpty()) { throw new Exception(“List is empty.”); } return this.tail.data; } // O(N) public int getAt(int idx) throws Exception { Node temp = this.getNodeAt(idx); return temp.data; } // O(N) private Node getNodeAt(int idx) throws Exception { if (this.isEmpty()) { throw new Exception(“List is empty”); } if (idx < 0 || idx >= this.size()) { throw new Exception(“Invalid arguments”); } Node retVal = this.head; for (int i = 0; i < idx; i++) { retVal = retVal.next; } return retVal; } // O(1) public void addFirst(int data) { Node node = new Node(data, this.head); if (this.size() == 0) { this.head = node; this.tail = node; } else { this.head = node; } this.size++; } // O(1) public void addLast(int data) { Node node = new Node(data, null); if (this.size() == 0) { this.head = node; this.tail = node; } else { this.tail.next = node; this.tail = node; } this.size++; } // O(n) public void addAt(int idx, int data) throws Exception { if (idx < 0 || idx > this.size()) { throw new Exception(“Invalid arguments”); } if (idx == 0) { this.addFirst(data); } else if (idx == this.size()) { this.addLast(data); } else { Node nm1 = this.getNodeAt(idx - 1); Node n = nm1.next; Node node = new Node(data, n); nm1.next = node; this.size++; } } // O(1) public int removeFirst() throws Exception { if (this.isEmpty()) { throw new Exception(“List is empty”); } int retVal = this.head.data; if (this.size() == 1) { this.head = null; this.tail = null; } else { this.head = this.head.next; } this.size–; return retVal; } // O(n) public int removeLast() throws Exception { if (this.isEmpty()) { throw new Exception(“List is empty”); } int retVal = this.tail.data; if (this.size() == 1) { this.head = null; this.tail = null; } else { Node sm2 = this.getNodeAt(this.size() - 2); sm2.next = null; this.tail = sm2; } this.size–; return retVal; } // O(n) public int removeAt(int idx) throws Exception { if (this.isEmpty()) { throw new Exception(“List is empty”); } if (idx < 0 || idx >= this.size()) { throw new Exception(“Invalid arguments”); } if (idx == 0) { return this.removeFirst(); } else if (idx == this.size() - 1) { return this.removeLast(); } else { Node nm1 = this.getNodeAt(idx - 1); Node n = nm1.next; Node np1 = n.next; nm1.next = np1; this.size–; return n.data; } } // O(n) public void display() { Node node = this.head; while (node != null) { System.out.print(node.data + " "); node = node.next; } //System.out.println(“END”); } public void reverse(int k){ // Write your code here } public static void main(String[] args) throws Exception { Scanner scn = new Scanner(System.in); int N = scn.nextInt(); int k = scn.nextInt(); LinkedList list = new LinkedList(); for (int i = 0; i < N; i++) { list.addLast(scn.nextInt()); } list.reverse(k); list.display(); } }

[sanjeetboora]

Hi @balasubramaniangopalakrishnan

Please follow the below steps, so that your TA will be able to help you

1. Copy your code at cb.lk/ide, save it and share that your url here.

2. Make sure you have completed the expected function in the already provided code stub.

For eg., In this particular case you have just copy pasted the whole stub code which was already provided, without even completing the provided function, which is mentioned below.

public void reverse(int k){
// Write your code here
}

So, please make sure that you are following above 2 steps which asking the doubt, so that your TA will be able to help you with the same.

And you have no submissions(wrong/partially correct/correct) on online.codingblocks.com for this problem.

[balasubramaniangopalakrishnan]

I have written several emails, in the past few days on platform every time i face one or the other problem now TA stopped responding. Return the fees if you are going to take this much time to fix it is not helping me. I hope you understand this is a very genuine ask.

[sanchit.bansal06 (Sanchit Bansal)]

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.