10+ Worley Interview Questions and Answers

Calculate x raised to the power of n, given x and n as input from the user.

• Accept two integers x and n as input from the user

• Compute x^n and display the result

• Handle the case where x=0 and n=0 separately (0^0 = 1)

Sort the array in decreasing order based on the count of set bits in the binary representation of each integer.

• Iterate through the array and calculate the set bit count for each integer using bitwise operations.

• Use a custom comparator function to sort the array based on the set bit count.

• Maintain the original order for integers with the same set bit count.

• Modify the array in-place within the given function.

Validate if a binary tree is a Binary Search Tree (BST) based on given properties.

• Check if left subtree contains only nodes with data less than current node's data

• Check if right subtree contains only nodes with data greater than current node's data

• Recursively check if both left and right subtrees are also BSTs

Find the maximum sum of a subsequence without choosing adjacent elements in the original array.

• Iterate through the array and keep track of the maximum sum of non-adjacent elements.

• At each index, compare the sum of including the current element with excluding the current element.

• Return the maximum sum obtained.

• Example: For input [3, 2, 7, 10], the maximum sum is 13 by selecting 3 and 10.

• Example: For input [3, 2, 5], the maximum sum is 8 by selecting 3 and 5.

Reverse a singly linked list of integers and return the head of the reversed linked list.

• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

• Ensure to update the head of the reversed linked list at the end of the process.

• Example: Input: 1 -> 2 -> 3 -> 4 -> NULL, Output: 4 -> 3 -> 2 -> 1 -> NULL

The task is to fill a Knapsack with stones of different colors and weights, minimizing unused capacity.

• Given N stones with weights W and colors C, choose M stones (one of each color) to fill Knapsack with total weight not exceeding X

• Minimize unused capacity of Knapsack by choosing stones wisely

• If no way to fill Knapsack, output -1

• Example: N=5, M=3, X=10, W=[1, 3, 3, 5, 5], C=[1, 2, 3, 1, 2] -> Output: 1

Determine the minimum number of additional lamps needed to illuminate a string with dots and asterisks.

• Iterate through the string and check for free spaces that are not already illuminated by existing lamps

• Place a lamp at each free space that is not already illuminated by an existing lamp

• Consider edge cases where the first and last positions may need additional lamps

Given two linked lists that merge at some point, find the data value at the merging node.

• Traverse both lists to find their lengths and the difference in lengths

• Move the pointer of the longer list by the difference in lengths

• Traverse both lists simultaneously until the nodes match to find the merging node

The first question is about checking if a string formed by concatenating all string fields in a linked list is a palindrome or not.

• Traverse the linked list and concatenate all string fields

• Check if the concatenated string is a palindrome by comparing characters from both ends

• Consider edge cases like empty linked list or single node with an empty string field

Use the seesaw 3 times to find the person with different weight among 12 people on an island.

• Divide the 12 people into 3 groups of 4.

• Compare 2 groups on the seesaw, then narrow down the group with the different person.

• Take the 4 people from the identified group and compare 2 of them on the seesaw to find the person with different weight.

The Egg Dropping Puzzle is a classic problem in mathematics and computer science that involves finding the highest floor from which an egg can be dropped without breaking.

• The puzzle involves finding the minimum number of attempts needed to determine the highest safe floor using only two eggs.

• Strategies for solving the puzzle include binary search, dynamic programming, and optimal stopping theory.

• The puzzle was discussed in the context of algorithm design and optimization duri...read more

Questions on binary tree traversal, multiplying big numbers represented as strings, and detecting k-th node from the back of a linked list.

• Binary tree traversal can be done in three ways: in-order, pre-order, and post-order.

• To multiply two big numbers represented as strings, you can use the grade-school algorithm or Karatsuba algorithm.

• To detect the k-th node from the back of a linked list, you can use two pointers approach or find the length of the list first.

A process is an instance of a program, while a thread is a unit of execution within a process.

• A process is an independent entity that runs in its own memory space, while threads share the same memory space within a process.

• Processes have their own resources, such as file handles and memory, while threads share these resources.

• Processes are heavyweight and have higher overhead, while threads are lightweight and have lower overhead.

• Processes provide better isolation and securit...read more

C++ memory management involves allocating and deallocating memory for variables, while pointers store memory addresses.

• Pointers are variables that store memory addresses.

• They are used to access and manipulate data stored in memory.

• Example: int* ptr = new int; *ptr = 10; delete ptr;