Dabbang Pattern in C++
In this article, we gonna tell you how to draw Dabbang Pattern in C++.
In this article, we gonna tell you how to draw Dabbang Pattern in C++.
Kruskal Algorithm in Greedy Algorithm in C/C++/Java/Python.It is an Algorithm that is used to generate a minimum spanning tree for a given graph.A Spanning tree is a subset, connected graph G, and all the edges are connected in such a way that we can traverse to any edge from a particular edge with or without intermediates. So, if there are n vertices in a connected graph then the no. of edges that a spanning tree may have is n-1.
Activity Selection Problem in Greedy Algorithm in C/C++/Java/Python.The Activity Selection problem is an approach to selecting non-conflicting tasks based on start and end time which can be solved in O(N logN) time using a simple greedy approach.
In the case of an even number of elements in the linked list, we can easily split the list into two halves.Store the mid and last pointers of the circular linked list using the tortoise and hare algorithm. Now, make the second half circular and the first half circular. Set the head (or start ) pointers of the two linked lists.
A circular linked list is a linked list where common nodes are connected to form a circle. There is no NULL at the end. In this, any node can be at the starting point. So, we can traverse from any point. We can maintain a pointer to the last inserted node and the front can…
Instagram Clone: We build an Instagram Clone using HTML and CSS. In this, the users are allowed to post images and scroll the page. It involves the use of UI design and makes it easier for the user to access the page and add more posts. We will divide the HTML page into 3 sections…
A simple calculator includes addition, subtraction, multiplication, and division. This calculator programĀ in C helps the user to enter the Operator (+, -, *, or /) and two values. Using those two values and operand, it will perform Arithmetic Operations. You can use other methods also to solve this problem. This is the simplest way one…
3 JUG Problem Easy Python Code – The Three Water Jug Puzzle. These are the steps to approach this problem
Competitive programming is a way to solve big problems by thinking optimally. With increased problem-solving skills, we will be able to do well in a work environment and break down an issue in the least time.
Insertion sort- It places sorted elements at their suitable place in iteration. If we get a larger element then check with other elements whether it’s suitable at that place or not, the other unsorted one is kept on the right side. It is more simple and more adaptive in nature