Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (F ...

Design your implementation of the linked list. You can choose to use the singly linked list or the doubly linked list. A node in a singly linked list ...

Design a HashSet without using any built-in hash table libraries. To be specific, your design should include these functions: add(value): Insert a val ...

Design a HashMap without using any built-in hash table libraries. To be specific, your design should include these functions: put(key, value) : Insert ...

Implement the following operations of a queue using stacks. push(x) – Push element x to the back of queue.pop() – Removes the element from in front of ...

Implement the following operations of a stack using queues. push(x) – Push element x onto stack.pop() – Removes the element on top of the stack.top() ...

Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target. ...

Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all ...

Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be ...

Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numb ...