×
Home Discussions Write at Opengenus IQ
×
  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner

Aswin Shailajan

Aswin Shailajan is a B. Tech Computer Science student at Vellore Institute of Technology and is a SDE, Intern at OpenGenus.

Kannur, Kerala, India •
23 posts •
Data Structures

Mean of Array problem solved with Treap

In this article at OpenGenus, we have solved the Mean of Array problem using Treap Data Structure.

Aswin Shailajan
Data Structures

Ghost Town problem solved with Treap Data Structure

In this article at OpenGenus, we will discuss the Ghost town problem. This involves the concept of Treap data structure.

Aswin Shailajan
Algorithms

Range greatest common divisor (GCD) query using Sparse table

In this article at OpenGenus, we will be discussing one of the common problem in computer science that involves finding the GCD of a given range of numbers in an array. One of the efficient solution is to use sparse table data structure to solve this problem.

Aswin Shailajan
Algorithms

Minimum cost to connect all points (using MST)

In this article, we will understand how to solve the minimum cost to connect all the points problem using Minimum Spanning Tree.

Aswin Shailajan
Minimum Spanning Tree (MST)

Water distribution [solved using Minimum Spanning Tree]

In this article, we have solved the problem of Water distribution using Minimum Spanning Tree, Union Find and Sorting Algorithms.

Aswin Shailajan
segment tree

Booking Concert Tickets in Groups [using BIT and Segment Tree]

In this article, we have solved the problem of Booking Concert Tickets in Groups. This involve the concept of Binary Indexed Tree and Segment Tree.

Aswin Shailajan
Algorithms

Schedule Events in Calendar Problem [Segment Tree]

In this article, we will discuss the My Calendar 1 problem where we need to schedule events in a calendar such that there is no conflict. This will involve the concept of Segment Tree.

Aswin Shailajan
Algorithms

Minimum Deletions to Make Array Divisible [3 Solutions]

In this article, we will explore how we can get the minimum number of deletion of smallest element such that the smallest element in the first array divides all the elements in the second array. This will involve the concept of Min Heap and Hash Map.

Aswin Shailajan
Algorithms

Find K closest numbers to a given value

In this article, we will explore on how to find the K closest numbers to a given value in a given set of numbers. We have presented two approaches using the concepts of binary search and Heap data structure.

Aswin Shailajan
trie

Lexicographic sorting using Trie

Lexicographic sorting is a way of sorting a set of strings based on their alphabetical order We can also say that the order in which those words appear in a dictionary.

Aswin Shailajan
C++

Restaurant Management System in C++

In this article, we are going to discuss about a restaurant management system which can handle table allocation and other services required by the customers.

Aswin Shailajan
C++

Multithreaded Matrix Multiplication in C++

In this article, we will explored how to implement Multithreaded Matrix Multiplication in C++ Programming Language. Matrix Multiplication is a critical operation in Deep Learning and this makes this topic critical.

Aswin Shailajan
C++

Calendar in C++

We are going to discuss how we can make a Gregorian calendar of a specific year using C++. It's also known as new style calendar.

Aswin Shailajan
Algorithms

Number of closed islands [2 solutions]

In this article, we have explored how to find the Number of closed islands in a graph. We have presented two approaches using the concept of BFS/ DFS and Union Find.

Aswin Shailajan
Algorithms

Longest Consecutive Subsequence [3 solutions]

In this article, we have solved the problem of Longest Consecutive Subsequence using the concept of Hash Map and Union Find.

Aswin Shailajan
C++

Snake Game using C++ & SFML

In this article, we'll dive into, a journey of mine, where I built a classic snake game. In this journey we will be building a Classic Snake Game through which we will learn how to build a game with boundaries, a growing snake, and food that the snake can eat.

Aswin Shailajan
C++

Keylogger in C++

In this article, we have developed a Keylogger in C++ Programming Language. This is a strong project for an SDE portfolio.

Aswin Shailajan
C Programming

Spell Checker in C

In this article, we have developed a Spell Checker tool in C Programming Language. It takes a string as input, highlight the words with wrong spelling and makes possible suggestions for each wrong word.

Aswin Shailajan
Data Structures

Applications of 24 Different Data Structures

In this article, we have listed and explained the real-life applications of 24 Different Data Structures ranging from common ones like Array, Linked List to Geometric Data Structures like R-Tree to Probabilistic Data Structures like LogLog.

Aswin Shailajan
Time Complexity

Time and Space Complexity of B+ Tree

B+ trees an interesting name isn't it? So in this article, we will closely analyze the time & space complexities for different operations in different cases of B+ Tree Data Structure.

Aswin Shailajan
Data Structures

(a,b) Tree Data Structure

An (a,b)-tree is a type of self-balancing tree data structure that is designed to maintain a balance between the height of the tree and the number of elements stored in the tree. In short we can say that (a,b)-tree is a generalization of a B-tree. Now lets get to know it in depth.

Aswin Shailajan
Graph Algorithms

Biconnected Components [Explained + Algorithm to find it]

Turns out, biconnected components are one of the most important topic in design analysis of algorithms, data structures and in many competitive exams. Biconnected components are defined as a maximal biconnected subgraph.

Aswin Shailajan
C++

Determine index from pointers in C++

In this article, we will look at how to compute the index using pointers returned by STL functions. It will be explained in such a way that even a 4th grader would get it.

Aswin Shailajan
OpenGenus IQ © 2025 All rights reserved â„¢
Contact - Email: team@opengenus.org
Primary Address: JR Shinjuku Miraina Tower, Tokyo, Shinjuku 160-0022, JP
Office #2: Commercial Complex D4, Delhi, Delhi 110017, IN
Top Posts LinkedIn Twitter
Android App
Apply for Internship