Comments added... // method to check divisble by particular number.... public boolean isDivisibleBy(Node firstNode, int divisor){ // current node and previous node declaring for iterating purpose Node curr = firstNode; Node prev = null; // boolean value holds divisble or not boolean isDivible = true; while(curr != null) // iterating until list ends reach { if(curr.data % divisor != 0){ // if not divisble then exit and change flag to false isDivible = false; break; } // iterate to next node prev = curr; curr = curr.next; } // return result return isDivible; } Solution Comments added... // method to check divisble by particular number.... public boolean isDivisibleBy(Node firstNode, int divisor){ // current node and previous node declaring for iterating purpose Node curr = firstNode; Node prev = null; // boolean value holds divisble or not boolean isDivible = true; while(curr != null) // iterating until list ends reach { if(curr.data % divisor != 0){ // if not divisble then exit and change flag to false isDivible = false; break; } // iterate to next node prev = curr; curr = curr.next; } // return result return isDivible; }.

1. Comments added...
// method to check divisble by particular number....
public boolean isDivisibleBy(Node firstNode, int divisor){
// current node and previous node declaring for iterating purpose
Node curr = firstNode;
Node prev = null;
// boolean value holds divisble or not
boolean isDivible = true;
while(curr != null) // iterating until list ends reach
{
if(curr.data % divisor != 0){ // if not divisble then exit and change flag to false
isDivible = false;
break;
}
// iterate to next node
prev = curr;
curr = curr.next;
}
// return result
return isDivible;
}
Solution
Comments added...
// method to check divisble by particular number....
public boolean isDivisibleBy(Node firstNode, int divisor){
// current node and previous node declaring for iterating purpose
Node curr = firstNode;
Node prev = null;
// boolean value holds divisble or not
boolean isDivible = true;
while(curr != null) // iterating until list ends reach
{
if(curr.data % divisor != 0){ // if not divisble then exit and change flag to false

2. isDivible = false;
break;
}
// iterate to next node
prev = curr;
curr = curr.next;
}
// return result
return isDivible;
}