OpenGenus Tech Review Team

linked list

Insertion Sort a Linked List

Algorithm Pseudocode Complexity Implementations Questions Reading time: 15 minutes | Coding time: 20 minutes Insertion sort is a comparison based sorting algorithm which can be utilized in sorting a Linked List as well. Insertion

linked list

Insert element in a sorted Linked List

Pseudocode Implementations Complexity Can binary search be used to improve performance? Reading time: 15 minutes | Coding time: 20 minutes In this session, we will explore how to insert an element in a sorted

linked list

Deletion operation in a Linked List

How to delete a node? Delete first node Delete last node Pseudocode Implementations Complexity Reading time: 15 minutes | Coding time: 20 minutes Linked List is an efficient data structure to store data. You

linked list

Insertion operation in a Linked List

How to insert a node at front? Insert a node at a particular location How to insert a node at end? Implementations Complexity Reading time: 15 minutes | Coding time: 20 minutes Linked List

linked list

Search an element in a Linked List

How to search a node? Why is searching in Linked List slower than arrays? Is binary search possible in Linked List? Implementations Complexity Reading time: 15 minutes | Coding time: 20 minutes Linked List

Data Structures

Singly Linked List

Singly Linked List is a variant of Linked List which allows only forward traversal of linked lists. This is a simple form yet it is effective for several problems such as Big Integer calculations. We will look into how various operations are performed and the advantages and disadvantages

game theory

Zobrist Hashing

Algorithm Complexity Implementations Applications Questions Reading time: 15 minutes | Coding time: 5 minutes Zobrist hashing (additionally alluded to as Zobrist keys or Zobrist marks ) is a hash function development utilized as a part

game theory

Alpha Beta Pruning in Minimax Algorithm

Algorithm Complexity Implementations Applications Questions Reading time: minutes | Coding time: minutes Like we discussed in earlier article, a hard coded AI can be used to create an intelligent opponent which you can challenge

game theory

Von Neumann's Minimax Theorem/ algorithm

Introduction Algorithm Complexity Implementations Applications Questions Reading time: 25 minutes | Coding time: 10 minutes Ever since the idea of artificial intelligence dawned upon the humanity, the basic concept of playing games against an

bitwise operation

Detect if a number is power of 4 using bitwise operators

Reading time: 15 minutes | Coding time: 2 minutes Algorithm Implementation Complexity Questions Bitwise operators are one of the most under-rated operators in C/C++, despite being quite fast as most of the processors

bitwise operation

Check if Two Numbers are Equal using Bitwise Operators

Bitwise Operators Explanation Implementations Applications Reading time: 15 minutes | Coding time: 2 minutes In this article, we will explore the technique of checking whether two numbers are equal using bitwise operators. Bitwise operator

bitwise operation

Detect if a number is power of 2 using bitwise operators

Reading time: 15 minutes | Coding time: 1 minutes Algorithm Implementation Complexity Questions Bitwise operators are one of the most under-rated operators in C/C++, despite being quite fast as most of the processors

bitwise operation

Basic Bitwise Operations: AND, OR, XOR, NOT, LEFT and RIGHT SHIFT

Reading time: 15 minutes Bitwise AND (&) Bitwise OR (|) Bitwise XOR (^) Bitwise Unary NOT (~) Left Shift ( Right Shift (>>) It is a well-known fact that computers do not interpret numbers and other data like we

java collection

Java Collections Framework: LinkedList

Reading time: 15 minutes Properties Java LinkedList Methods Implementations Java LinkedList is an implementation of the List and Deque interfaces. It is one of the frequently used List implementation class. It extends AbstractSequentialList

bitwise operation

Left and Right Bit Rotation using Bitwise Operators

Left Rotation Right Rotation Pseudocode Implementation Applications Question Reading time: minutes | Coding time: minutes A bitwise operation involves manipulation of one or more bits of a bit pattern. A bitwise operation can simply

String Algorithms

Z Algorithm function

The Z-function for a string S of length N is an array of length N where the i th element is equal to the greatest number of characters starting from the position i that coincide with the first characters of S.

java collection

Java Collections Framework: ArrayList

Java ArrayList is one of the most widely used Collection class. java.util.ArrayList class implements java.util.List interface. Java ArrayList also implements RandomAccess, Cloneable and Serializable interfaces. Java ArrayList class extends AbstractList class that the skeleton implementation of list

java collection

Java Collections Framework: Iterable Interface

The Iterable interface (java.lang.Iterable) is the root interface of the Java collection classes. The Collection interface extends Iterable interface, so all subtypes of Collection implement the Iterable interface. This interface is to represent structures whose value can be traversed one by one.

java collection

Java Collections Framework: Collection Interface

The Collection interface (java.util.Collection) is one of the root interfaces of the Java collection classes. A collection represents a group of objects known as its elements. The following 6 interfaces extends the Collection interface List, Set, SortedSet, NavigableSet, Queue, and Deque.

java memory management

Memory Management in Java: Garbage Collection Tuning and Optimization

Tuning garbage collection is an important task in designing scalable applications in Java. he three considerations for tuning are Latency Throughput and Capacity. This article presents a real life tuning example and general concepts

java memory management

Memory Management in Java: Garbage Collection algorithms

There are several strategies of Garbage Collection each of which is suitable fora particular use case. This is article we have explored some of the best Garbage Collection algorithms. Serial Garbage Collection, Parallel Garbage Collection, Concurrent Mark and Sweep and G1 garbage collection

suffix array

Suffix Array

A Suffix Array contains integers that represent the starting indices of all the suffixes of a given string, after the aforementioned suffixes have been sorted. There are two approaches to compute: O(N^2 * log N) and O(N * log N * log N) approach. Locate every occurrence of a pattern within a string

game theory

Sprague-Grundy Theorem and Game of Kayle

Sprague Grundy function returns smallest non negative integer which is not in the given set. Explore the application of Sprague Grundy Theorem using a famous game of Kayle. Find the complexity and implementation of Sprague Grundy theorem and game of kayle.

game theory

Nimber Arithmetic : A deeper dive in Nim

Explore Nimber Arithmetic in Game theory and always win a game. Nimbers have two particular operations. nim-addition and nim-multiplication. the nimbers are know as Grundy Numbers. Explore applications in the Game of Nim and odd Knight of the round table problem.

game theory

Exploring The Game of Nim

Nim is a mathematical game of strategy in which two players take turns removing objects from distinct heaps. The key to the theory of the game is the binary digital sum of the heap sizes "exclusive or" (xor). It is called the nim-sum. Find implementations of winning strategy and applications