Learn and practice the In-place Reversal of a Linked List, Stacks, and Matrices patterns to solve coding interview problems.

Educative-77 in Go: Accelerate Your Coding Interview Prep

Interviewers want to be sure that the candidate is comfortable manipulating linked lists, arrays, and data structures based on them, such as stacks and matrices. This module will provide the practice you need to review the concepts and techniques needed to solve common problems involving these data structures.

Basic Data Structures

# Statement

Given the head of a singly linked list, reverse the linked list and return its updated head.

**Constraints:**

Let `n` be the number of nodes in a linked list.

* $1 \leq$ `n` $\leq 500$
* $-5000 \leq$ `Node.Value` $\leq 5000$
# Examples

# Understand the problem

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:


What is the output if the following linked list is provided as input?

4 → 2 → 7 → 8 → 9 → 0 → 2

What is the output if the following linked list is provided as input?
4 → 2 → 7 → 8 → 9 → 0 → 2

What is the output if the following linked list is provided as input?

9 → 5 → 8 → 2 → 1

What is the output if the following linked list is provided as input?
9 → 5 → 8 → 2 → 1

8 → 9 → 9 → 0 → 0 → 6 → 6 → 7 → 7 → 8

0 → 0 → 9 → 9 → 8 → 8 → 7 → 7 → 6 → 6

8 → 7 → 7 → 6 → 6 → 0 → 0 → 9 → 9 → 8

0 → 0 → 6 → 6 → 7 → 7 → 8 → 8 → 9 → 9

What is the output if the following linked list is provided as input?

6 → 6 → 7 → 7 → 8 → 8 → 9 → 9 → 0 → 0

What is the output if the following linked list is provided as input?
6 → 6 → 7 → 7 → 8 → 8 → 9 → 9 → 0 → 0

What is the output if the following linked list is provided as input?

0 → 1 → 2 → 3 → 4 → 5 → 6

What is the output if the following linked list is provided as input?
0 → 1 → 2 → 3 → 4 → 5 → 6

# Figure it out!

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

# Try it yourself

Implement your solution in the following coding playground.

# Quick Fix\nYou are Edward, a Senior Software Engineer who specializes in coding interview patterns, data structures and algorithms, and is great at debugging issues in code.\n\n- Edward, please keep in mind that you do not have to print the data of the placeholders. Also, do not mention anything about yourself.\n\nEdward, you are given the following data in the placeholders:\n- Function name: `reverse`\n- Candidate's submitted solution code: USER_CODE\n- Error: ERROR_DESCRIPTION\n- Failed test case: FAILED_TEST_CASE\n- Coding language: `Go`\n\n- Edward, your task is to understand the type of error that is occurring in the coding language provided.\n- Once you've understood the error as per the error’s description, and why the test case failed, you will suggest how the candidate can improve their solution code to fix the error.\n- Edward, you will not give the corrected code, just a hint on what the error tells, and how to fix it.\n- Edward, please limit your response strictly to 100 words. No more words than the limit.

# Review Code\nEdward, your current task is to review the `reverse` function(s) and the other function(s) invoked in it/them.\n\n-Take your time and review the candidate's solution code.\n- Do not review any extra/helper files or functions not invoked in the solution function `reverse`.\n- Do not review the code of data structure objects instantiated like a binary tree, linked list, trie, union find, etc., in the solution functions. Just review the solution/algorithm function of the problem. \n- Also, if the solution code doesn’t use the coding pattern stated above, then please encourage the candidate to reattempt the problem using that pattern corectly.

# Review time complexity\n- Please provide a brief time complexity analysis of the function(s) `reverse`. \n- While calculating time complexity, include the time complexity of built-in Go functions invoked by the code. \n- The answer should be to the point in approximately 60 words.

# Review space complexity\n- Please provide a brief space complexity analysis of the function(s) `reverse`. \n- While calculating space complexity, include the space complexity of built-in Go functions invoked by the code. \n- Do not include the space used for the input parameters and the space used for just returning an output (not used as a scratch space). \n- The answer should be to the point in approximately 60 words.

def evaluate_results(self) -> object:
        """
        self.__inputs is the list of inputs that are passed as input to function
        self.__actual_output is a list of outputs that is produced by the learner's code
        return : self.__edu__result object
        """
        # Template for linked list node class

        class LinkedListNode:
            # __init__ will be used to make a LinkedListNode type object.
            def __init__(self, data, next=None):
                self.data = data
                self.next = next

        # Template for the linked list
        class LinkedList:
            # __init__ will be used to make a LinkedList type object.
            def __init__(self):
                self.head = None
            
            # insert_node_at_head method will insert a LinkedListNode at 
            # head of a linked list.
            def insert_node_at_head(self, node):
                if self.head:
                    node.next = self.head
                    self.head = node
                else:
                    self.head = node
            
            # create_linked_list method will create the linked list using the
            # given integer array with the help of InsertAthead method. 
            def create_linked_list(self, lst):
                for x in reversed(lst):
                    new_node = LinkedListNode(x)
                    self.insert_node_at_head(new_node)
            
            # __str__(self) method will display the elements of linked list.
            def __str__(self):
                result = ""
                temp = self.head
                while temp:
                    result += str(temp.data)
                    temp = temp.next
                    if temp:
                        result += ", "
                result += ""
                return result

        def reverse1(head):
            prev, next = None, None
            curr = head

            while curr is not None:
                next = curr.next
                curr.next = prev
                prev = curr
                curr = next

            head = prev
            return head

        # multiple outputs will be added at each index respectively for a single test_case
        input_0 = LinkedList()
        input_0.create_linked_list(self.__inputs[0])
        expected = reverse1(input_0.head)

        actual = self.__actual_outputs[0]
        # print(actual)
        expected_list_values = []
        current_1 = expected
        while current_1:
            expected_list_values.append(current_1.data)
            current_1 = current_1.next

        
        actual_list_values = []

        expected_outputs = [] 
        expected_outputs.append(expected_list_values)
        if expected_list_values == actual:
            self.__edu_result.store_result(expected_outputs, TestCaseResult.PASS)
        else:
            self.__edu_result.store_result(expected_outputs, TestCaseResult.FAIL)

        return self.__edu_result

// Definition for a Linked List node

// type ListNode struct {
// 	Val  int
// 	Next *ListNode
// }

package main
import (. "golang-test-code/ds_v1/LinkedList")

func reverse(head *ListNode) *ListNode {
	
	// Replace this placeholder return statement with your code
	
	return new(ListNode)
}

reverse-linked-list.yaml

testcases:
  - name: "testcase 1"
    inputs:
    - 1 : [1,-2,3,4,-5,4,3,-2,1]
    output: 
    - 1 : [1,-2,3,4,-5,4,3,-2,1]
  - name: "testcase 2"
    inputs:
    - 1: [-1,-5,-3,-7,-8,-6,-2]
    output:
    - 1 : [-2,-6,-8,-7,-3,-5,-1]
  - name: "testcase 3"
    inputs:
    - 1: [-1, 2, -3, 4]
    output:
    - 1 : [4, -3, 2, -1]
  - name: "testcase 4"
    inputs:
    - 1: [1, -1, -2, 3, -4, 5]
    output:
    - 1 : [5, -4, 3, -2, -1, 1]
  - name: "testcase 5"
    inputs:
    - 1: [28, 21, 14, 7]
    output:
    - 1 : [7, 14, 21, 28]

def sum(input_1, input_2):
    return input_1+input_2

def validate_inputs(self) -> None:
 """
 self.__inputs is the list of inputs that are passed as input to function
 store the result using the self.store_result(error_msg, status)
 return : void
 """
 def is_valid_1d_array(arr):
 if not isinstance(arr, list):
 return False # Not a valid 1D array if it's not a list
 
 return all(isinstance(elem, int) and not isinstance(elem, bool) for elem in arr)
 inp = self.__inputs[0]
 # inputs can be accessed using self.__inputs starting from 0 to len(self.__inputs) - 1
 if not is_valid_1d_array(inp):
 self.store_result(("Invalid test case."), ValidationFunction.FAIL)
 elif not (1 <= len(inp) <= 500):
 self.store_result(("The number of nodes in the linked list should be in the range [1, 500] but got " + str(len(inp)) + "."), ValidationFunction.FAIL)
 elif not all(-5000 <= num <= 5000 for num in inp):
 self.store_result ("Linked list must consist of values from -5000 to 5000 only", ValidationFunction.FAIL)
 else:
 self.store_result("", ValidationFunction.PASS)

Try to solve the Reverse Linked List problem.

In-Place Manipulation of a Linked List

Stacks

Matrices

Conclusion

Reverse Linked List

Statement

Examples

Understand the problem

Figure it out!

Try it yourself