Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Today, technology is a crucial part of our life. We accomplished many things with the assistance of technology. It shapes the future and help to make it friendly with nature. It ought to be for the people in order to make things easier and not more complex. Technology increases the value of society and streamlines human life. So, we should develop it to fulfill every requirement of the society in a positive manner as the new generation needs a life of luxurious convenience.Need of Easy AccessPeople today just need a remote control in their hands to control everything without putting ... Read More
Here we will see how to check whether a string is sum-string or not. A string is said to be sum-string if the rightmost substring can be written as the sum of two substrings before it, and the same is recursively true for substring before it. Suppose a string like 12243660 is a sum string, like 12 + 24 = 36, and the 36 is present after 12 and 24 in the string, again 24 + 36 = 60, this is also present in the string.A string S can be called sum-string, if it follows this rule βπ π’ππ π‘ππππ(π, π₯)+π π’ππ π‘ππππ(π₯+1, π)= ... Read More
Suppose we have a graph. We have to check whether the graph is strongly connected or not. A graph is said to be strongly connected, if any two vertices have a path between them, then the graph is connected. An undirected graph is strongly connected graph. Some undirected graph may be connected but not strongly connected. This is an example of a strongly connected graph.This is an example of a connected, but not strongly connected graph.Here we will see, how to check a graph is strongly connected or not using the following steps.Steps βMark all nodes as not visitedStart DFS ... Read More
We have two circles. The center of both of them is at the origin. The radius of these two circles is given. They are r and R, R > r. Another circle is also present. Its radius (r1) and the center point are given, we have to check whether that point is inside the ring formed by the first two circles or not.We can solve this using the Pythagorean theorem. compute the distance from the center of the circle and origin. Then if (distance β r1) >= r and (distance β r1) = R && dis+r1
With the passing of every day at present, the landscape seems to change. Technology, with its rapidly innovative pace, sets the tone for a lot of the things β present and future. So is the case in the business landscape, where a lot of it has been transferred to the online ecosystem. Mobile has taken the world by storm in the past few years and having an application is the answer to everything that needs a solution. Likewise, most business people and entrepreneurs have switched to mobile apps to have an advantage in the markets they operate in.So, here are ... Read More
Here we will see how to check whether a binary tree is sum-tree or not. Now the question is what is the sum-tree. A sum-tree is a binary tree where a node will hold the sum value of its children. The root of the tree will contain an entire sum of all elements below it. This is an example of sum-tree βTo check this, we will follow a simple trick, we will find the sum of left and right subtree elements if the sum value is the same as the root, then that is sum-tree. This will be one recursive ... Read More
Virtual reality (VR) is all about hanging our suspicion and allowing our attention to imagine a different virtual world for experiencing thoughts. VR has taken our experience in movie and gaming to the next level. Now, VR has marked its presence into weather sensation too. Itβs really fascinating to experience the presence of new weather add-ons.A Brief Overview on VRVirtual reality is an attempt to mimic the real world environment through a digital touch. The custom software produces lifelike images, vibrations, echoes, noises and other such impressions that replicate a real environment. A viewer using a VR device is typically ... Read More
Here we will see how to check whether an unsorted array has duplicate elements within k distance from each other or not. Suppose a list of elements is {1, 2, 3, 1, 4, 5}, here if k = 3, then the program will return true, as the distance between two 1s is 3.We will solve this using a hash table. The steps will be like below βCreate one empty hash tableFor each index i, let the element e = arr[i] in the list, doif e is present in the hash table, then return trueotherwise, add e to hash table, and ... Read More
Every time your smartphone troubles you all you could think of is the time when things were so simple back. I mean β Yes I like smartphones where you carry a complete package of entertainment, news, and necessity with you. Never to forget the self-camera, apps like WhatsApp, Instagram and Snapchat makes itβs more irresistible. Still being unsatisfied humans we still want more battery backup, better performance, and minimal hanging.In short, we want a merger of our previous type based phone with our new smartphones. Remember the era when mobile phones were first launched? Nokia was the best option we ... Read More
Here we will see how to check a string is a palindrome or not using a Doubly linked list. Here we will push each character of a string inside one doubly linked list. There will be two pointers, left and right. Then start scanning from both sides. If a left character is the same as right character, then move the left pointer to the next node, and move the right pointer to the previous node. Otherwise, return false. This process will be continued until the left and right are pointing at the same node, or the right pointer is pointing ... Read More