Rashmitha - OpenGenus IQ: Learn Algorithms, DL, System Design

Find Duplicate File in System [Solved with hashmap]

In this article at OpenGenus, we will learn to how to solve the problem "Find duplicate files in the system" using string stream and hashmap.

Algorithms

My Calendar III Problem [Solved with Segment Tree, Sweep Line]

In this article at OpenGenus, we have solved the Calendar 3 problem that is to find number of conflicting meetings in a given range of time. We have solved this using the concept of Sweep Line and Segment tree with Lazy Propagation.

Data Structures

Fenwick Tree vs Segment Tree

In this article, we will understand the difference between two key data structures namely Fenwick Tree/ Binary Indexed Tree (BIT) and Segment Tree. We solve the problem "Sum Query Mutable" to explore the differences.

Algorithms

L-Systems and Carnatic Music

Ever been amazed by plant's geometry? Lindenmayer systems,in short , L-systems have been inspired by the recurrence pattern observed in plants. We will learn more about L-systems , its history , applications and learn how L-systems were used to generate plants and trees models, snowflakes and so on.

Algorithms

Nature Inspired Algorithms

There is no better teacher than nature herself , she never rushes but everything is established. Have you ever wondered how our human brain is able to distinguish thousands of dog breeds from cats' even if we had never seen few of the breeds before too?

Algorithms

Number of expressions that evaluate to value K

In this problem, we have to form expressions using + and - and find the number of expressions that evaluate to K. This can be solved efficiently using Dynamic Programming and is an extension of Count Subset Problem.

Algorithms

Heavy Light Decomposition of tree

Heavy Light Decomposition, a competitive programming algorithm is very useful in solving queries efficiently. We will see its usecase, implementation and finally solve few problems based on it.

Problems on Binary Tree

Counting subtrees where nodes sum to a specific value

We will learn about counting the subtrees in a binary tree whose nodes sum to a given value. We will be trying different methods to solve our problem We will solve it in O(N) time complexity and O(H) space complexity where N is number of nodes and H is the height of the tree.

Problems on Binary Tree

Find number of Universal Value subtrees in a Binary Tree

In this article, we will be working on finding number of subtrees whose nodes have same value, called universal value subtree or simply univalue subtree.

Algorithms

To check if the linked list is a circular linked list (2 methods)

We will be seeing two efficient methods to determine whether the given linked list is a circular linked list or not. With this, we solve the problem in linear time.

Software Engineering

<Button> tag in HTML web pages

Button are HTML elements that give a sense of click on webpages. Buttons can be formatted and styled using CSS. We can add javascript codes too to make the buttons interactive.