## Largest perfect square number in an Array

Given an array of n integers. The task is to find the largest number which is a perfect square. Print -1 if there is no… Read More »

- Analysis of Algorithms | Set 1 (Asymptotic Analysis)
- Analysis of Algorithm | Set 4 (Solving Recurrences)
- Analysis of Algorithms | Set 2 (Worst, Average and Best Cases)
- Time Complexity of building a heap
- Analysis of Algorithms | Set 4 (Analysis of Loops)
- Analysis of Algorithms | Set 3 (Asymptotic Notations)
- NP-Completeness | Set 1 (Introduction)
- Analysis of Algorithm | Set 5 (Amortized Analysis Introduction)
- Tail Recursion
- What does 'Space Complexity' mean?
- Analysis of algorithms | little o and little omega notations
- Complexity of different operations in Binary tree, Binary Search Tree and AVL tree
- Understanding Time Complexity with Simple Examples
- A Time Complexity Question
- Practice Questions on Time Complexity Analysis
- Pseudo-polynomial Algorithms
- Time Complexity of Loop with Powers
- Time Complexity where loop variable is incremented by 1, 2, 3, 4 ..
- Time complexity of recursive Fibonacci program
- Performance of loops (A caching question)
- Analysis of Algorithms | Big-O analysis
- Sort elements by frequency | Set 5 (using Java Map)
- Analysis of different sorting techniques
- Different types of recurrence relations and their solutions
- Analysis of Algorithms | Set 5 (Practice Problems)
- Asymptotic Analysis and comparison of sorting algorithms
- Algorithm Practice Question for Beginners | Set 1
- Time Complexity of a Loop when Loop variable “Expands or Shrinks” exponentially
- In-Place Algorithm
- Time Complexity Analysis | Tower Of Hanoi (Recursion)

Given an array of n integers. The task is to find the largest number which is a perfect square. Print -1 if there is no… Read More »

Given N line segments where the length of the ith line segment is . The task is to find the maximum number of parallelograms can… Read More »

Given two coins which have probability of getting heads p% and q% respectively, the task is to determine the probability of getting two consecutive heads… Read More »

Given an array arr[] containing N numbers. The task is to check whether the bitwise-OR of the given N numbers is even or odd. Examples:… Read More »

The Jump pointer algorithm is a design technique for parallel algorithms that operate on pointer structures, such as arrays or linked list. This algorithm is… Read More »

Given n, m, A and B. The task is to count the number of pairs of integers (x, y) such that 1 x n and… Read More »

The Lower and Upper Bound Theory provides a way to find the lowest complexity algorithm to solve a problem. Before understanding the theory, first lets… Read More »

Given an integer array, sort the array according to the frequency of elements in decreasing order, if frequency of two elements are same then sort… Read More »

In deterministic algorithm, for a given particular input, the computer will always produce the same output going through the same states but in case of… Read More »

Prerequisite : HeapSort Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we… Read More »

In this article we will be discussing of applications of hashing. Hashing provides constant time search, insert and delete operations on average. This is why… Read More »

Given an array with integer elements in small range, sort the array. We need to write a non-comparison based sorting algorithm with following assumptions about… Read More »

Execution time : The execution time or CPU time of a given task is defined as the time spent by the system executing that task… Read More »

In-place has more than one definitions. One strict definition is. An in-place algorithm is an algorithm that does not need an extra space and produces… Read More »

Cyclomatic complexity of a code section is the quantitative measure of the number of linearly independent paths in it. It is a software metric used… Read More »