Aditya Chatterjee's Blog, page 156

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).

Table of contents:

Problem statement of Array RotationBlock Swap AlgorithmExample: Dry Run of Block Swap AlgorithmImplementation of Block Swap AlgorithmTime Complexity of Block Swap AlgorithmSpace Complexity of Block Swap Algorithm

Let us get started with Block Swap Algorithm.

Problem statement of Array Rotation

Before we discus...

Inception V3 Model Architecture

In this article, we will learn about what is Inception V3 model Architecture and its working. How it is better than its previous versions like the Inception V1 model and other Models like Resnet. What are its advantages and disadvantages?

Table of contents:

Introduction to Inception modelsInception V3 Model ArchitecturePerformance of Inception V3

Let us explore Inception V3 Model Architecture.

Introduction to Inception models

The Inception V3 is a deep learning model based on Convolutional N...

Static and extern pointers in C/ C++

Static and extern are storage classes in C which defines scope and life-time of a variable. Similar to any variables in C, we can use these keywords with pointers for different use cases.

Table of content:

Static pointers in C/ C Extern pointers in C/ C

Let us get started.

Static pointers in C/ C

Static variables once initialized exists until the termination of the program. These variables holds their value even after they are out of their scope. Once declared and initialized they are no...

List of 50+ Binary Tree Problems for Coding Interviews

In this article, 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.

Table of Contents:

Introduction to Binary Tree + ImplementationTypes of Binary TreeProblems on Binary Tree (50+) (Important)

We have marked the important problems so if you are in a hurry or have limited time, go through the important problems to get t...

Move even number to front of array

In this article, we have explained two efficient approaches to Move even number to front of array using Hoare's Partition and Lomuto Partition.

Table of content:

Problem StatementApproach 1: Using Hoare's PartitionApproach 2: Using Lomuto Partition

Let us understand and solve this problem.

Problem Statement

Given an array of positive numbers, partition the array in such a way that all even numbers are at the front of array.

Example:

Input : {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}Output: {2, 4, 6, 8...

Entity Relationship Model

In this article, we have covered Entity Relationship Model in depth along with basics like entity, attributes, notations and much more. We have present an example of Entity Relationship Model for Job Portal database.

Table of content:

What is Entity relationship model?Entity and AttributesRelationshipMapping of EntitiesNotations for ER DiagramKeysConverting an ER model into Relational model

Let us get started.

What is Entity relationship model?

The Entity-Relationship model (or ER model)...

Two Sum Problem in Binary Search Tree

In this article, 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.

Table of content:

Problem StatementApproach 1: Using DFSApproach 2: Using Inorder traversalApproach 3: Using Augmented BST

Let us get started.

Problem Statement

Given a Binary Search Tree and an integer k, we have to determine if there exist two nodes in the the BST with sum of values equal to the given t...

"Time Complexity Analysis" book

"Time Complexity Analysis" is a book focused on Mathematical Analysis of Time and Space Complexity of various algorithms and data structures along with basics of Time Complexity like Big-O notations.

Get his book now:

E-book version (India, USA, Worldwide)Paperback versionHardcover version

This book “Time Complexity Analysis” 💻 introduces you to the basics of Time Complexity notations, meaning of the Complexity values and How to analyze various Algorithmic problems. This book includes Time ...

Software Development Lifecycles (SDLC)

In this article, we have covered the basics of Software Development Lifecycles along with the different types like Waterfall Model. We have covered advantages and different stages of SDLC.

Table of content:

What is a Software LifeCycle?How does SDLC work?Advantages of SDLCStages of SDLC (Software Development Lifecycle)Types of SDLCAdvantages of modern SDLC models compared to old ones

Let us get started.

What is a Software LifeCycle?

Software lifecycle refers to the methodology and all pha...

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.

Table of content:

Understanding the problem: Longest Common SuffixBrute force approach for two given stringsScaling of the brute force approachUsing Trie data structure for an optimized approach

Let us un...