Posts by Aditya Goyal

Author Biographical Info: Not available

Clear screen in Python

By Aditya Goyal

In this tutorial, we are going to learn how to clear screen in Python. There are various methods to clear screen in Python is to use control+L. But we are going to discuss method t.... Read More

Operator.countOf in Python

By Aditya Goyal

In this tutorial, we are going to learn what is Operator.countOf function in Python. This function is used to count the occurrence of one element in another. The working parameters.... Read More

Iterative method to check if two trees are mirror of each other in Java

By Aditya Goyal

In this tutorial, we are going to learn an iterative approach to check if trees are mirror images. So, we will be comparing two trees’ returns true if both the trees are mirr.... Read More

Check for Symmetric Binary Tree (Iterative Approach) in Java

By Aditya Goyal

In this tutorial, will see how we can check for a Symmetric Binary Tree in Java. A Symmetric Binary Tree is a tree in which a tree is a mirror of itself. We will be doing this code.... Read More

How to iterate Map in Java

By Aditya Goyal

In this tutorial, we are going to learn how to iterate a map in Java. As we know, we cannot iterate a map directly using iterators as a map is not a Collection. Firstly we have to .... Read More

Compute Bigrams Frequency in a String in Python

By Aditya Goyal

In this tutorial, we are going to learn about computing Bigrams frequency in a string in Python. In this, we will find out the frequency of 2 letters taken at a time in a String. F.... Read More

How to convert an iterable to collection in Java

By Aditya Goyal

In this tutorial, we are going to learn how to convert an iterable to a collection in Java. An iterator is used to retrieve elements one by one whereas a collection is a group of o.... Read More

Check if a given Binary Tree is SumTree in Java

By Aditya Goyal

In this tutorial, we are going to learn to check if a Binary Tree is a Sum Tree or not in Java. It is a Tree in which the root node is equal to the sum of it’s left and right.... Read More

Related Posts