×
Home Discussions Write at Opengenus IQ
×
  • Join our Internship 🎓
  • #7daysOfCode
  • C Interview questions
  • Linux 💽
  • 🔊 Data Structures
  • Graph Algorithms
  • Dynamic Programming 💑
  • Greedy Algo 📔
  • Algo Book 🧠
  • String Algo 🧬
  • Home
Aditya Chatterjee

Aditya Chatterjee

Aditya Chatterjee is an Independent Algorithmic Researcher, Software Developer and Technical Author. He is the founding member of OPENGENUS, an organization with focus on changing Internet consumption

Higashikurume, Tokyo, Japan •
45 posts •

Algorithms

Succinct (0-1) Encoding of Binary Tree

Succinct (0-1) Encoding of Binary Tree is an approach to encode a Binary Tree to the lowest possible space and maintain the structural information.

Srishti Guleria Srishti Guleria
Algorithms

LCA in Binary Tree using Euler tour and Range Minimum Query

In this problem, we will find the Lowest Common Ancestor of a Binary Tree using Euler tour and Range Minimum Query. We can solve the LCA problem by reducing it to a RMQ problem.

Srishti Guleria Srishti Guleria
Algorithms

Lowest Common Ancestor in a Binary Tree

In binary trees, for given two nodes a and b, the lowest common ancestor is the node of which both a and b are descendants. We explored the algorithm to find Lowest Common Ancestor in a Binary Tree.

Srishti Guleria Srishti Guleria
Machine Learning (ML)

How a ML Dataset is designed?

In this article, we have explored How a (Machine Learning) ML Dataset is designed? with the example of the PASCAL dataset (Pascal-1 Visual Object Classes (VOC)) and how it evolved over the years and how the initial dataset was prepared.

Ayush Mehar
Algorithms

Assembly Line Scheduling using Dynamic Programming

The main goal of solving the Assembly Line Scheduling problem is to determine which stations to choose from line 1 and which to choose from line 2 in order to minimize assembly time. We solve this using Dynamic Programming.

Shubham Sood Shubham Sood
Algorithms

Commonly asked interview questions on sorting algorithms. Power booster for your interview preparation!

In this article, we have presented several multiple choice questions (MCQs) on Sorting Algorithms for coding interviews with answers. This will help you get prepared.

Sushma Narayan Hegde
Algorithms

Dice Throw Problem (Dynamic Programming)

There are d dice each having f faces. We need to find the number of ways in which we can get sum s from the faces when the dice are rolled. We have explored a Dynamic Programming solution to Dice Throw problem.

Amruta U. Koshe Amruta U. Koshe
Problems on Binary Tree

Convert Binary Tree to Threaded Binary Tree

We will focus on different approaches on how to convert a normal binary tree into a threaded binary tree. We will convert our binary tree to single threaded binary tree with right pointers pointing to inorder successor (if it exists).

Hrithik Shrivastava
Algorithms

Maximum Sum Decreasing Subsequence (Dynamic Programming)

Given an array of n positive integers, find the sum of the maximum sum decreasing subsequence (msds) of the given array such that the integers in the subsequence are sorted in decreasing order.

Aditya Kumar Saroj
Culture

Will you hire Donald Knuth as a programmer?

A manager said Donald Knuth is too theoretical and he would not hire him to lead his team or as a programmer. Donald is widely respected for his theoretical contributions and have been recognized with awards. We will show that Donald is practically strong as a programmer as well.

Aditya Chatterjee Aditya Chatterjee
Algorithms

Algorithm to check if a linked list is sorted

In this article, we have explored an algorithm to check if a given Linked List is sorted or not in linear time O(N). It takes constant space O(1).

Shubham Kumar
Algorithms

Check if Linked List is Empty

Checking if the given Linked List is empty depends on the ways Linked List has been formed (with or without root). We have covered both approaches.

Aayushi Rawat
Data Structures

Probabilistic Data Structures

This is a general overview of probabilistic data structures (with examples of data structures over 5 different categories).

Ethan Z. Booker
Software Engineering

Tough Interview questions on C Programming

These are some of the most tough Interview questions on C Programming which tests your knowledge on how well you know the language. Even if you are not a master of C, you must try it once.

Aditya Chatterjee Aditya Chatterjee

Contribute and grow 🌱 with Hacktoberfest 2020

Hacktoberfest is a month long virtual event where you can make four contributions towards your favorite Open Source project (such as Cosmos by OpenGenus). You will not only get to learn new things but also get free goodies delivered to you at your doorstep.

Ue Kiao, PhD Ue Kiao, PhD
Data Structures

List of Advanced Data Structures

This article has the list of 100+ Advanced Data Structures that you must understand to prepare to solve advanced problems and compete in competitions like ICPC, Google Code Jam, Facebook Hacker Cup and many more.

Aditya Chatterjee Aditya Chatterjee
Machine Learning (ML)

Capsule neural networks or CapsNet

Capsule neural networks or CapsNet is an artificial neural network which consists of capsules(bunch of neurons) which allow us to confirm if entities(components) are present in the image. We will cover Capsule Networks in depth.

Sandeep Bhuiya
Data Structures

Must read research papers on Data Structures

We presented research papers on Data Structures that are a must read for everyone. These come from authors like Raimund Seidel, Knuth, Rubinchik and others

OpenGenus Foundation OpenGenus Foundation
Algorithms

Must read research papers on Algorithms

We presented some of the must read research papers in the field of Algorithms. The papers come from authors like C. A. R. Hoare, D. E. Knuth, V. Strassen and many others.

OpenGenus Foundation OpenGenus Foundation
Algorithms

Bozosort

Bozosort is a random sorting algorithms where the key idea is to swap any two elements of the list randomly and check if the list is sorted. The average time complexity of Bozosort is O(N!) and the space complexity is O(1).

OpenGenus Foundation OpenGenus Foundation

Best Programming Memes of 2019

This is the ultimate list of the best programming memes of 2019. It includes epic memes of Elon Musk, Greta Thunberg to attacking JavaScript. Enjoy.

OpenGenus Foundation OpenGenus Foundation
Algorithms

Easiest IMO problems that will make you feel like a Genius

IMO problems are known to be difficult but we have identified 5 problems which you can solve without using a paper. This will make you feel like a GENIUS

OpenGenus Foundation OpenGenus Foundation
Machine Learning (ML)

Understand basic TensorFlow programming concepts

We understand basic TensorFlow programming concepts using a code to add two numbers in TensorFlow. We created placeholders like tf.placeholder, operations like tf.constant and tf.add, sessions using tf.session and configuration using tf.configProto

Aditya Chatterjee Aditya Chatterjee
Machine Learning (ML)

Training vs Inference

Training and Inference are two major processes of Machine Learning and is deeply connected. Training is the process by which we generate various parameters such as weights and biases which are used in a particular model. Inference is the process of using the trained model to do a particular task

Aditya Chatterjee Aditya Chatterjee
Machine Learning (ML)

Deep Learning on 2-Dimensional Images

Applying deep learning concepts on images has proved to be one of the important work which has resulted in early detection of diseases resulting in saving millions of life to monitoring activities on the entire Earth We take a look at medical images, Satellite Images and the various Python libraries

Priyanshu Shekhar Sinha Priyanshu Shekhar Sinha
×

Visit our discussion forum to ask any question and join our community

View Forum
OpenGenus IQ © 2021 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter