Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Python consists of numerous built-in functions that are designed to perform a wide range of operations including string manipulation, array analysis, algebraic reasoning etc. Strings in python is a data type in which characters are arranged in a sequence. These characters are indexed to acquire specific position in a sequence, we can initiate basic string operations with the help of these index values. This article will elaborate on a similar string-based operation where we will modify an input string to equalize the character frequency. Understanding the Problem Our task is to modify a string in a manner that each ... Read More
When it comes to searching for elements in a collection, Java provides different options depending on the data structure you're using. Two popular methods for searching in a list are binary search and the contains() method. In this blog post, we'll compare the performance of binary search and contains in a Java list, highlighting their differences, strengths, and best use cases. Binary Search Binary search is an efficient way for locating a specific member in a sorted list. The search space is divided in half on a regular basis until the target element is found or the search space is ... Read More
Graphical representation of the data provides an enhanced understanding of the complex sub structures of the data and it helps us to easily interpret the hidden patterns and trends. Imagine how convenient it would be if we could just draw a similar relationship programmatically? Python offers a prolific module that is precisely designed to perform such operation and it is known as “turtle”. The “turtle” module is a built-in python library that allows us to draw graphics on a “turtle graphics screen”. In this article, we will create a bar chart using this turtle module. Understanding the Turtle ... Read More
A dictionary is a unique form of array that is used to implement data structures in python. There are several characteristics associated with a dictionary that makes it a very powerful tool in Python. It stores data in the form of key-value pair where each key is a unique identifier and is used to access the corresponding value associated with it. We can perform several operations on this dictionary and manipulate the data stored in it. This article will explain one such operation where we will divide a dictionary and its key into K equal dictionaries. Understanding the ... Read More
Java is a well−known programming language that is used to create a variety of applications. The user experience could be harmed by performance issues that can be caused by poorly optimized Java code. In this blog post, you will come across 12 techniques for improving the performance of Java programming. Techniques to Optimize Java Code Use Efficient Data Structures The choice of a suitable data structure has a significant impact on the effectiveness and speed of Java programming. For instance, choosing a LinkedList over an ArrayList can be advantageous if you frequently add or delete entries from a list because ... Read More
Programming is all about coming up with the best and most efficient ways to solve the real−world problems. There are situations when you want to exit multiple loops simultaneously. This can be accomplished in Java by simply referencing the name of the loop you want to exit. In this tutorial, we'll look at how to break any outer nested loop in Java by referencing its name. Referencing Loop Names in Java You can break out of the Java nested loop by labelling the outer loop. This can be accomplished by using a label before the outer loop followed by a ... Read More
A binary tree is a data structure in which each node can have two children (at most). These children are known as left and right child respectively. Suppose we are given a parent array representation using which you have to a create a binary tree. The binary tree may have several isosceles triangles. We have to find the total number of possible isosceles triangles in that binary tree. In this article, we will explore several techniques in C++ to solve this problem. Understanding the Problem You are given a parent array. You have to represent it in the form ... Read More
A full binary tree is a special type of binary tree in which all the parent nodes either have two or no children. In data structures, these kinds of trees are considered as balanced and organized representation. Full binary trees may have a unique feature where each of the parent node is a product of its children. In this article, we will discuss about different methods for counting the number of full binary trees such that each node is product of its children using C++. Input Output Scenarios For example, in the array {1, 5, 3, 4}, we have ... Read More
Imagine a prisoner (or thief) wants to escape from a jail. In order to do so, he needs to cross N number of walls of varying lengths. He can climb X feet for each jump. But, since the walls are slippery, he falls down by Y feet after each jump. So, we need to calculate number of jumps required to cross all the walls. In this article, we will explore different C++ techniques to find the number of jumps required to escape the jail. Input Output Scenarios We have different heights of the N walls in the form of ... Read More
In this article, we will discuss the possible solution of an exciting analytical question of how many jumps are required to reach a point (d, 0) from the origin in a 2D plane where you have been specified fixed length of jumps. We will use the fixed length of jumps and the target coordinates to find the minimum number of jumps required. Input Output Scenarios Suppose jump length can be a or b while the target point is (d, 0). Then, the given output is the minimum number of jumps required to reach target. Input: a = 7, b ... Read More