Changed names according to suggestions

Author: cpu-pixel

src/main/java/com/thealgorithms/datastructures/graphs/BipartiteGrapfDFS.java

@@ -54,23 +54,23 @@ public static void main(String[] args) throws IOException {
         BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
         int t = Integer.parseInt(read.readLine().trim());
         while (t-- > 0) {
-            String[] str = read.readLine().trim().split(" ");
-            int a = Integer.parseInt(str[0]);
-            int b = Integer.parseInt(str[1]);
+            String[] str1 = read.readLine().trim().split(" ");
+            int numVertices = Integer.parseInt(str1[0]);
+            int numEdges = Integer.parseInt(str1[1]);
 
             ArrayList<ArrayList<Integer>> adj = new ArrayList<>();
-            for (int i = 0; i < a; i++) {
+            for (int i = 0; i < numVertices; i++) {
                 adj.add(new ArrayList<>());
             }
-            for (int i = 0; i < b; i++) {
-                String[] s = read.readLine().trim().split(" ");
-                int u = Integer.parseInt(s[0]);
-                int v = Integer.parseInt(s[1]);
-                adj.get(u).add(v);
-                adj.get(v).add(u);
+            for (int i = 0; i < numEdges; i++) {
+                String[] str2 = read.readLine().trim().split(" ");
+                int vertexU = Integer.parseInt(str2[0]);
+                int vertexV = Integer.parseInt(str2[1]);
+                adj.get(vertexU).add(vertexV);
+                adj.get(vertexV).add(vertexU);
             }
 
-            boolean ans = isBipartite(a, adj);
+            boolean ans = isBipartite(numVertices, adj);
             if (ans) {
                 System.out.println("YES");
             } else {

src/main/java/com/thealgorithms/datastructures/lists/ReverseKGroup.java

@@ -23,17 +23,17 @@ public Node reverse(Node head, int count, int k) {
         Node prev = null;
         int count1 = 0;
         Node curr = head;
-        Node nxt = null;
+        Node next = null;
         while (curr != null && count1 < k) {
-            nxt = curr.next;
+            next = curr.next;
             curr.next = prev;
             prev = curr;
-            curr = nxt;
+            curr = next;
             count1++;
         }
 
-        if (nxt != null) {
-            head.next = reverse(nxt, count - k, k);
+        if (next != null) {
+            head.next = reverse(next, count - k, k);
         }
         return prev;
     }

src/main/java/com/thealgorithms/datastructures/trees/PrintTopViewofTree.java

@@ -60,13 +60,13 @@ public void printTopView() {
         HashSet<Integer> set = new HashSet<>();
 
         // Create a queue and add root to it
-        Queue<QItem> qN = new LinkedList<QItem>();
-        qN.add(new QItem(root, 0)); // Horizontal distance of root is 0
+        Queue<QItem> queue = new LinkedList<QItem>();
+        queue.add(new QItem(root, 0)); // Horizontal distance of root is 0
 
         // Standard BFS or level order traversal loop
-        while (!qN.isEmpty()) {
+        while (!queue.isEmpty()) {
             // Remove the front item and get its details
-            QItem qi = qN.remove();
+            QItem qi = queue.remove();
             int hd = qi.hd;
             TreeNode n = qi.node;
 
@@ -79,10 +79,10 @@ public void printTopView() {
 
             // Enqueue left and right children of current node
             if (n.left != null) {
-                qN.add(new QItem(n.left, hd - 1));
+                queue.add(new QItem(n.left, hd - 1));
             }
             if (n.right != null) {
-                qN.add(new QItem(n.right, hd + 1));
+                queue.add(new QItem(n.right, hd + 1));
             }
         }
     }