Problem Statement There is n number of people standing in a circle. Numbering starts from 1 to n and is in the fixed clockwise direction. In each step, we are supposed to eliminate a person which is at the $k^{th}$ position from the current position such that only one man remains at the end who ...
The Uniform Cost Search Algorithm is a search algorithm to find the minimum cumulative cost of the path from the source node to the destination node. It is an uninformed algorithm i.e. it doesn’t have prior information about the path or nodes and that is why it is a brute-force approach. What is the Uniform ...
Given a sorted rotated array arr[] having N number of elements and a target element K. We are supposed to find the 0 (zero) based index (indexing starts from 0 rather than 1) of the target element if it exists and return -1 if it doesn’t. Let us assume for now that duplicates don’t exist, ...
An N-ary tree or Generic Tree is a tree that can have at most N children. If we replace N with 2 then we get a binary tree. In other words, an n-ary tree node can have between 0 to N child nodes. N-ary trees are used in various use cases but moreover, these are useful where we are required to represent hierarchical data with multiple branching points at ...
Linked lists data structures consist of a sequence of nodes that store data and point to the next node. Linked lists have multiple variations and two of the important variations are singly linked lists and doubly linked lists. The first node is called the head and the last node of the linked list is called the tail. ...
Given an array of random numbers and zeros, arrange the array such that all the numbers restoring their order are moved in front and move all zeros to end of array. There are so many ways to solve this problem. We can make use of additional arrays, pointers, partitions, etc. Example to Understand Let us ...
Searching refers to finding a sequence of various actions to find the solution to the problem in such a way that this sequence of actions solves the problem optimally by some criteria. The two major types of searching are Informed and Uninformed. Informed search uses problem definition as well as additional information about the guidance ...
Algorithm, pseudocode, and program are three related terms in computer programming. The difference between an algorithm and a pseudocode is algorithm is an informal representation of a solution to a problem whereas, a pseudocode acts as a bridge between an algorithm and a program. From the algorithm it is easier to convert into pseudocode and ...
Given a stack, write a program to reverse the order of the elements inside the stack using recursion. The element at the top should be moved to the bottom and so on. This program must use only standard stack operations – push(item), pop(), top(), size(), and isEmpty(). Example: Input: $23, 56, 82, 90$ Output: $90, ...