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

Gifty Treesa Iju

Gifty Treesa Iju is a 3rd Year CSE Student at College Of Engineering, Trivandrum.

Kottayam, Kerala, India •
11 posts •
Algorithms

Preorder traversal in Binary Tree [Iterative + Recursive]

Preorder traversal is one of the traversal in binary tree in which the root node is visited first then the left subtree and then the right subtree. The order can be written as ROOT LEFT RIGHT.

Gifty Treesa Iju Gifty Treesa Iju
Algorithms

Hashing: Complete Guide

In hashing, we convert key to another value. It is a searching technique. In linear search the time complexity is O(n),in binary search it is O(log(n)) but in hashing it will be constant. We make use of a hash function and a hash table.

Gifty Treesa Iju Gifty Treesa Iju
Algorithms

Maximum area of island

In this article, we have presented an efficient algorithm to find the maximum area of island in a grid. This includes the concept of BFS and DFS.

Gifty Treesa Iju Gifty Treesa Iju
Time Complexity

Asymptotic Analysis

In this article, we will be discussing about the idea of Asymptotic Analysis of Algorithms, 3 asymptotic notations used to represent the time complexity of an algorithm along with examples and much more.

Gifty Treesa Iju Gifty Treesa Iju
divide and conquer

Skyline Problem

In this article, we have explained an efficient approach to solve the Skyline Problem using a Divide and Conquer algorithm.

Gifty Treesa Iju Gifty Treesa Iju
Algorithms

Majority element in sorted array

In this article, we will be learning how to find the majority element in a sorted array. This involve using Linear Search, Binary Search and a constant time algorithm.

Gifty Treesa Iju Gifty Treesa Iju
queue

Interleave first half of Queue with second half

In this article, we are going to explore an algorithm to interleave first half of queue with second half.

Gifty Treesa Iju Gifty Treesa Iju
Algorithms

Tail Recursion

In this article, we have explored the idea of Tail Recursion in depth with several code examples along with comparison with Non-Tail Recursion.

Gifty Treesa Iju Gifty Treesa Iju
Algorithms

Design LFU (Least Frequently Used) Cache

In this article, we will be designing a LFU (Least Frequently Used) Cache using different Data Structures such as Singly Linked List, Doubly Linked List, Min Heap and much more.

Gifty Treesa Iju Gifty Treesa Iju
List of Mathematical Algorithms

Convert Decimal to Hexadecimal

In this article, we will learn about decimal numbers, hexadecimal numbers and the algorithm to convert decimal to hexadecimal number.

Gifty Treesa Iju Gifty Treesa Iju
C++

Variable in C++

In this article, we will learn everything about the variables in C++ including rules of variable naming, types of variables and much more.

Gifty Treesa Iju Gifty Treesa Iju
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