Pepcoding Interview Questions, Process, and Tips

To invert a binary tree, swap the left and right children of each node recursively.

• Start from the root node

• Swap the left and right children of the current node

• Recursively invert the left subtree

• Recursively invert the right subtree

• Repeat until all nodes are inverted

Finding the middle element of a LinkedList

• Traverse the LinkedList using two pointers, one moving one step at a time and the other moving two steps at a time

• When the faster pointer reaches the end of the list, the slower pointer will be at the middle element

• If the LinkedList has an even number of elements, there are two middle elements

To reverse an array, use a loop to swap the first and last elements until the middle is reached. To find elements in an array, use a loop to compare each element to the desired value.

• To reverse an array, initialize two pointers at the beginning and end of the array. Swap the elements at the pointers and move the pointers towards the middle until they meet.

• To find elements in an array, use a loop to iterate through each...read more

Finding the longest increasing sequence using recursion.

• Define a recursive function that takes an array and the current index as parameters.

• If the current index is the last index of the array, return 1.

• If the current element is greater than the next element, return 1.

• If the current element is less than or equal to the next element, recursively call the function with the next index and add 1 to the result.

• Compare the re...read more