Entry-level Software Engineering Data Structures Coding Interview Questions
Find the minimum (or maximum) element of an array.
Remove duplicates from the sorted array.
Given a sorted array, return the index of a given value or -1 if the element cannot be found.
Delete the node in a linked list.
Insert a node into a sorted doubly linked list.
Convert sorted array to binary search tree.
Given the root of a binary tree, invert the tree, and return its root.
Count the number of subarrays having a given XOR.
Implementing our Own Hash Table with Separate Chaining in Java.
Find whether an array is a subset of another array.
Implement stack using queues.
Remove all adjacent duplicates in the string.
Evaluate the value of an arithmetic expression in Reverse Polish Notation.
Compute the running median of a sequence of numbers. That is, given a stream of numbers, print out the median of the list so far after each new element.
Given an integer array nums and an integer k, return the kth largest element in the array.