Circular Queue implementation in C
This article covers circular queue implementation in C. A queue is a linear data structure that serves as a collection of elements, with three main operations: Enqueue, Dequeue, and Peek.
Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedThis article covers circular queue implementation in C. A queue is a linear data structure that serves as a collection of elements, with three main operations: Enqueue, Dequeue, and Peek.
Write a program to determine if a given string is palindrome or not. A palindromic string is a string that remains the same with its characters reversed.
In this post, linked list implementation of stack is covered. A stack is a linear data structure that serves as a collection of elements, with three main operations: push, pop, and peek.
This articles covers stack implementation in C. A stack is a linear data structure that serves as a collection of elements, with three main operations: push, pop and peek.
This post will discuss the difference between a subarray, a substring, a subsequence, and a subset.
Write a recursive program to efficiently reverse a given string in C, C++, and Java.
Write an iterative program to reverse a string in C++ and Java.
Write a recursive C/C++, Java, and Python program to calculate the factorial of a given positive number.
Write a recursive program to find all factorial numbers less than or equal to n. The factorial n! of a non-negative integer n is the product of all positive integers less than or equal to n.
Write an iterative C/C++ and java program to find factorial of a given positive number.
Write an iterative program to print factorial series in a given range efficiently. The factorial n! of a non-negative integer n is the product of all positive integers less than or equal to n.
Write a program to determine if a given number is a palindrome or not. A palindromic number is a number that remains the same when its digits are reversed.