Algorithms

Algorithms

Applications of XOR operation

We will begin with a brief introduction of what the XOR operation is, followed by its syntax in C++ and its applications such as memory-optimized doubly linked lists, swapping, XOR ciphers, Comparing two values, Gray codes and Partiy check.

Algorithms

Adding 2 integers as linked lists

We will represent an Integer as Singly Linked List and define an addition algorithm to add two integers as Linked Lists. This is used to add very large integers which is not stored in existing data types.

Graph Algorithms

100+ Graph Algorithms and Techniques [Complete List]

We have listed 100+ problems on Graph data structure, Graph Algorithms, related concepts, Competitive Programming techniques and Algorithmic problems.

Algorithms

Swap 2 variables [6+ techniques]

We have explored about Swapping of 2 variables. We have presented different methods to do so including swapping using third variable, using arithmetic operations, XOR, macro and much more along with their pros and cons.

Time Complexity

Time Complexity of Multiplication

The Brute force Time Complexity of Multiplication operation is O(logM x logM) while the Theoretical limit of Time Complexity of Multiplication operation is O(logM x loglogM) for multiplying number number M x M.

Time Complexity

Time Complexity of Dynamic Array

We have explained Complexity Analysis of Dynamic Array along with Time and Space Complexity of different operations of Dynamic Array.

Time Complexity

Time Complexity Analysis of Linked List

We have presented the Time Complexity analysis of different operations in Linked List. It clears several misconceptions such that Time Complexity to access i-th element takes O(1) time but in reality, it takes O(√N * N) time. We have presented space complexity of Linked List operations as well.

Time Complexity

Time Complexity Analysis of Array

We have presented the Time Complexity analysis of different operations in Array. It clears several misconceptions such that Time Complexity to access i-th element takes O(1) time but in reality, it takes O(√N) time. We have presented space complexity of array operations as well.

Time Complexity

Time Complexity of Addition Operation

We have demonstrated the Time Complexity analysis of Addition operation. It is assumed to take constant time O(1) but it takes linear time O(N) in terms of number of bits. We have presented the space complexity along with implementation of addition using bitwise operations.

Algorithms

Two Pointer Technique in Array

We have explained the Two Pointer Technique in array which is used to solve a vast range of problems efficiently. Problems include Reversing an array and Find if a pair with given sum exists in a sorted array.

Algorithms

Block Swap Algorithm [for Array Rotation]

This article discusses Block Swap Algorithm. It is used to rotate an array by any number of positions with a Time Complexity of O(N) and Space Complexity of O(1).

Algorithms

List of 50+ Binary Tree Problems for Coding Interviews

We have listed important Problems on Binary Tree which you must practice for Coding Interviews and listed introductory and background topics on Binary Tree as well. You must bookmark this page and practice all problems listed.

Algorithms

Move even number to front of array

We have explained two efficient approaches to Move even number to front of array using Hoare's Partition and Lomuto Partition.

Algorithms

Two Sum Problem in Binary Search Tree

We have solved the Two Sum Problem in Binary Search Tree using three different approaches involving Depth First Search, Inorder Traversal and Augmented Binary Search Tree.

Algorithms

Longest Common Suffix Problem

In this article, we will see how we can find the longest common suffix (i.e ending) that all the strings given to us have. We shall start with the brute-force approach for two strings. Following this, we will implement the Trie data structure to solve the problem for more than two strings.

Algorithms

Lempel Ziv Welch compression and decompression

In this article, we will learn about the Lempel Ziv Welch compression and decompression algorithm, a famous compression technique that is widely used in Unix systems and GIF format files

Algorithms

Lomuto Partition Scheme

We have explained the Lomuto partition scheme, which is used in the famous Quicksort algorithm. It is an algorithm to partition an array into two parts based on a given condition.

Algorithms

Multiplication using bitwise operations

We have explained how to compute Multiplication using Bitwise Operations. We can solve this using left shift, right shift and negation bitwise operations.

Time Complexity

Basics of Time Complexity Analysis [+ notations and Complexity class]

We have explored the Basics of Time Complexity Analysis, various Time Complexity notations such as Big-O and Big-Theta, ideas of calculating and making sense of Time Complexity with a background on various complexity classes like P, NP, NP-Hard and others.

Time Complexity

Time Complexity for non-comparison based Sorting

We have explained why the minimum theoretical Time Complexity of non-comparison based sorting problem is O(N) instead of O(N logN). This is a must read. It will open up new insights.

Time Complexity

Time & Space Complexity of Binary Search [Mathematical Analysis]

We have presented the Mathematical Analysis of Time and Space Complexity of Binary Search for different cases such as Worst Case, Average Case and Best Case. We have presented the exact number of comparisons in Binary Search.

Time Complexity

Time & Space Complexity of Linear Search [Mathematical Analysis]

We have presented the Mathematical Analysis of Time and Space Complexity of Linear Search for different cases such as Worst Case, Average Case and Best Case. We have presented the exact number of comparisons in Linear Search.

Algorithms

Probability of Collision in Hash Function [Complete Analysis]

We present the Mathematical Analysis of the Probability of Collision in a Hash Function. You will learn to calculate the expected number of collisions along with the values till which no collision will be expected and much more.

Algorithms

Inside Outside Test [2 algorithms: Even-Odd and Winding Number]

In Computer Graphics, Inside Outside is performed to test whether a given point lies inside of a closed polygon or not. Mainly, there are two methods to determine a point is interior/exterior to polygon: Even-Odd / Odd-Even Rule or Odd Parity Rule and Winding Number Method.

Algorithms

Invert / Reverse a Binary Tree [3 methods]

Inverting a binary tree is one of the most common questions asked in the interviews of many companies. In this article, we will see in detail as to how one can understand and tackle this task of inverting a binary tree using recursion, stack and queue.