Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
The digital world has always been action packed and aggressively competitive since its existence. With exponentially continuous breakthroughs in the world of science and technology, the tech giants like Microsoft, Google, and Apple have been within a perpetual war against each other and the war doesn’t seem to come to an end in the near future.Unlike other kinds of war, whether real or virtual, instead of destructive consequences, this ‘tech-war’ only has constructive consequences bringing an immense amount of productivity for the end users like me and you. This competition in technology has shaped our present and will define our ... Read More
With the commercial launch of Reliance Jio services on September 5, 2016, the telecom operator introduced ‘Welcome Offer’ with free voice and data (with a cap of 4GB data per day) services on the Jio SIM up to December 31, 2016. The company extended the ‘Welcome Offer’ by another three months till March 31, 2017 by relaunching it as the ‘Happy New Year Offer.’Welcome Offer’ also offered free voice calls, video calling, messaging and data, but with a data limit of 1GB per day. Reliance Jio claimed to be the fastest growing technology company in the world, and had close ... Read More
Today, the time has been changed with the touch of automation technology which is developing enormously every now and then. Each new era of automobile is getting furnished with more mechanized components and crash averting technology. They are getting integrated with advanced options, such as blind-spot observing, forward-crash warnings, lane-departure warnings etc. Another such feature is auto-driving mode.Commonly, many have some misconception between ‘autonomous or automated driving’ and ‘self driving’. These terms are fundamentally different from each other. When it comes to the construction of auto-driving mode activated cars, they are similar to normal ones and can ready to assume ... Read More
We have one circle (center coordinate and radius), we have to find the quadrant of another given point (x, y) lies with respect to the center of the circle, if this is present in the circle, print quadrant, otherwise print error as the point is present outside.Suppose the center of the circle is (h, k), the coordinate of the point is (x, y). We know that the equation of the circle is −(𝑥−ℎ)2+(𝑦−𝑘)2+𝑟2=0Now there are few conditions, based on which we can decide the result.𝑖𝑓 (𝑥−ℎ)2+(𝑦−𝑘)2> 𝑟, 𝑡ℎ𝑒𝑛 𝑡ℎ𝑒 𝑝𝑜𝑖𝑛𝑡 𝑖𝑠 𝑜𝑢𝑡𝑠𝑖𝑑𝑒 𝑡ℎ𝑒 𝑐𝑖𝑟𝑐𝑙𝑒𝑖𝑓 (𝑥−ℎ)2+(𝑦−𝑘)2= 0, 𝑡ℎ𝑒𝑛 𝑡ℎ𝑒 𝑝𝑜𝑖𝑛𝑡 𝑖𝑠 ... Read More
Consider we have a set of points. We have to find a simple closed path covering all points. Suppose the points are like below, and the next image is making a closed path on those points.To get the path, we have to follow these steps −Find the bottom left point as PSort other n – 1 point based on the polar angle counterclockwise around P, if polar angle of two points are same, then put them as the distance is shortestTraverse the sorted list of points, then make the pathExample Live Demo#include using namespace std; class Point { public: ... Read More
Here we will see how to get the minimum and maximum value from one singly circular linked linear list. The basic concept is very simple. The next part of the last node will be pointed to the first node, the first node will also be pointed using start pointer. When we insert some element into the list, after inserting the next part of the newly inserted node will be updated with the address of the start node.Initially the min is assigned with positive infinity, and max is assigned with negative infinity. Now traverse the list from left to right. If ... Read More
Suppose we have a set of points. Our task is to find K points which are closest to the origin. Suppose the points are (3, 3), (5, -1) and (-2, 4). Then the closest two (K = 2) points are (3, 3), (-2, 4).To solve this problem, we will sort the list of points based on their Euclidean distance, after that take the top most K elements from the sorted list. Those are the K nearest points.Example Live Demo#include #include using namespace std; class Point{ private: int x, y; public: Point(int x = 0, int y = 0){ this->x = x; this->y = y; } void display(){ cout
Suppose there are few friends. They have borrowed money from each other. So there will be some cash flow on the network. Our task is to minimize the cash flow in the network. Suppose there are three friends P1, P2, and P3. The cash flow among them is like below −This cash flow is not minimum; we have to minimize it. Then the final diagram will be like −To solve this problem we will use the greedy approach. Here in each step settle all amounts of one person and recur for remaining n-1 persons. Now the question comes, how to ... Read More
Here we will see, how to check whether a number is a palindrome or not. The palindrome numbers are the same in both directions. For example, a number 12321 is a palindrome, but 12345 is not a palindrome.The logic is very straight forward. We have to reverse the number, and if the reversed number is the same as the actual number, then that is a palindrome, otherwise not. Let us see the algorithm to get a better idea.AlgorithmisPalindrome(n) −input − The number noutput − true, if the number is a palindrome, otherwise, falsebegin temp := n rev := ... Read More
Suppose, one parabola is given (the vertex coordinate (h, k) and distance from focus and vertex is a), another point is also given. We have to find whether the point is inside the parabola or not. To solve it, we have to solve the following equation for the given point (x, y)\left(y-k\right)^2=4a\left(x-h\right)If the result is less than 0, then this is present inside the parabola if it is 0, then it is on the parabola, and if greater than 0, then outside of the parabola.Example Live Demo#include #include using namespace std; int isInsideParabola(int h, int k, int x, int ... Read More