Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Articles by Sunidhi Bansal
Page 67 of 81
Why does Python sometimes take so long to start on Windows?
Python is a very popular programming language among the Developers and very easy to understand. Its syntax is also very simple to understand, like JAVA and C. But this popular language has some problems and one of the major problems is that it takes so long to start. There can be so many reasons for being slow in Windows Maybe the system configuration is not identical, particular for python. Malware virus slowing the window system. Too many applications running on the window system so python is not getting the proper resources. Slow Execution problem As you know python ...
Read MoreArray Partition I in Python
We are given the array, let's say arr[] of 2n integers. We have to make the pair group of the integer elements like(a1, b1), (a2, b2)....(an, bn) which makes the sum of min(ai, bi) for all elements in the array as large as possible. The task is to find the maximum sum of pairs For example arr[] = [1, 2, 3, 4] and output is 4 the maximum sum of pairs is 4. The all possible are − (1, 2) and (3, 4) -> min(1, 2) + min(3, 4) = 1 + 3 = 4. (1, 4) and (2, 3) ...
Read MorePython Challenges to Develop Your Skills
As you know Python is ranked in topmost used programming language. Python programming language is easy to learn and easy to use. If you know the basics of python you can develop some easy projects like the TIC TAC TOE game and also you can enroll in easy python coding challenges. These coding challenges will help you to improve your coding logics and if you are an intermediate level python programmer you can take a python challenge to enhance your python skills to become a professional or experienced python programmer. Some python programming challenges for beginners. 1. Basic calculator. Basic ...
Read MoreMerge Sort Tree in C++
We are given an integer array, a set of segment start and end pointers and a key value and the problem statement here is to find all the values in the given range which are smaller than or equal to the given key value.Let us understand with exampleInput − arr[] = {7, 8 , 1, 4 , 6 , 8 , 10 }Segment 1: start = 2, end = 4, k = 2Segment 2: start = 1, end = 6, k = 3Output − Count of number which are smaller than or equal to key value in the given range are 2 ...
Read MoreMerge Sort using Multithreading in C++
We are given an unsorted integer array. The task is to sort the array using merge sort technique implemented via Multi-threadingMerge SortMerge sort is a sorting technique which is based on divide and conquer technique where we divide the array into equal halves and then combine them in a sorted manner.Algorithm to implement merge sort ischeck if there is one element in the list then return the element.Else, Divide the data recursively into two halves until it can’t be divided further.Finally, merge the smaller lists into new lists in sorted order.Multi-ThreadingIn the operating system, Threads are the lightweight process which ...
Read MoreMemorization (1D, 2D and 3D) Dynamic Programming in Java
Memorization is a technique based on dynamic programming which is used to improve the performance of a recursive algorithm by ensuring that the method does not run for the same set of inputs more than once by keeping a record of the results for the provided inputs(stored in an array).Memorization can be achieved by implementing top down approach of the recursive method.Let us understand this scenario with the help of basic Fibonacci example1-D MemorizationWe will be considering a recursive algorithm with only one non constant parameter (only one parameter changes its value) hence this method is called 1-D memorization. The ...
Read MoreFind array using different XORs of elements in groups of size 4 in Java
We are given with an integer array of size N(size of multiple 4) and we have to perform Xclusive OR operation on the array such that input[1- 4] resembles utility_arr[1- 4] and the conditions of computing is If arr[1 – 4] = {a1, a2, a3, a4} then q[1 – 4] = {a1 ⊕ a2 ⊕ a3, a1 ⊕ a2 ⊕ a4, a1 ⊕ a3 ⊕ a4, a2 ⊕ a3 ⊕ a4}Let us see various input output scenarios for this -In − int[] input = { 5, 2, 3, 4 };Out − Result after XOR operation 4 3 2 5Explanation −An Exclusive-OR gate's output ...
Read MoreMeet in the middle in Java
We are provided with an array and a sum value; the problem statement is to calculate the maximum subset sum which does not exceed the given sum value. We cannot apply the brute force approach here because the structure of the given array is not the same as the divide and conquer approach.Let us see various input output scenarios for this -Let us understand with exampleInput − long arr[] = { 21, 1, 2, 45, 9, 8 } long given_Sum = 12Output −The maximum sum subset having sum less than or equal to the given sum-->12Explanation −The array is split into a set ...
Read MoreMaximize the total profit of all the persons X in Java
We are given 5 Integer variables Num, P1, P2, profit_P1, profit_P2 and the task is to maximize the profit and from all the natural numbers in the range of [1, Num]. The approach here is that if a positive number is divisible by P1 the profit increases by profit_P1 and similarly if if the number in the range is divisible by P2 the profit margin of profit_P2 increases. Also, the profit from a positive integer can be added at most once.Let us understand with example:-Input − int num = 4, P1 = 6, P2 = 2, profit_P1 = 8, profit_P2 = ...
Read MoreMerge K sorted linked lists in Java
We are given a K number of linked lists of variable sizes which are sorted in their sequence and we have to merge the list into a resultant list in such a way that the resultant array is sorted in order and the resultant array is printed as the output to the user.Let us understand with example:-Input −int k = 3;list[0] = new Node(11);list[0].next = new Node(15);list[0].next.next = new Node(17);list[1] = new Node(2);list[1].next = new Node(3);list[1].next.next = new Node(26);list[1].next.next.next = new Node(39);list[2] = new Node(4);list[2].next = new Node(8);list[2].next.next = new Node(10);Output −The merged list is-->2>> 3>> 4>> 8>> 10>> 11>> 15>> 17>> ...
Read More