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

Vishwajith K

5 posts •
Algorithms

Construct BST from pre-order traversal (using monotonic stack; no recursion)

This article discusses on a way in which, Binary Search Tree (BST) can be reconstructed when corresponding pre-order traversal of the tree is input, using a concept of monotonic stack.

Vishwajith K
Algorithms

Number of sub-strings with each character occurring even times

This article discusses different algorithmic approach which we can use to find number of sub-strings with each character in it occurring even number times for a given string.

Vishwajith K
Algorithms

Generate all sub-strings of a string

We have explored the approach of generating / printing all sub-strings of a given String and have provided the implementation to do so. The time complexity to generate all substring is O(N^3) time and there are O(N^2) sub-strings for a string of length N.

Vishwajith K
Software Engineering

Idea of zero copy [with example]

The concept of copying data from one peripheral to another peripheral by kernel, without switching back to user-process is termed as zero copy. In this article, we have explained the concept with code examples.

Vishwajith K
Software Engineering

qsort: Sorting using stdlib.h in C [Explained with examples]

In this article, we have explained how to use qsort that is Sorting using stdlib.h in C. We have presented the use-case using code examples.

Vishwajith K
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