Server Side Programming Articles - Page 1576 of 2650

While using Python dictionary we may need to identify each element of the dictionary uniquely. For that we have to assign unique IDs to each of the element in the dictionary. In this article we will see how to assign the same unique Id to an element if it is repeated in a Python dictionary.With enumerate() and OrderedDict.fromkeys()The enumerate function expands a given dictionary by adding a counter to each element of the dictionary. Then we apply the OrderedDict.fromkeys() which will extract the same value of the counter from the dictionary hence eliminating the duplicates values of IDs.Example Live Demofrom collections ... Read More

In this tutorial, we will be discussing a program to find maximum points from top left of matrix to bottom right and return backFor this we will be provided with matrix consisting of #-blocked path, *-points, .- allowed path. Our task is to go from one corner to another (right and below moves) and come back (left and top moves) such as to collect maximum pointsExample Live Demo#include #define MAX 5 #define N 5 #define M 5 #define inf 100000 using namespace std; //calculating points int cost(char grid[][M], int row1, int col1, int row2, int col2) {    if (row1 ... Read More

In this tutorial, we will be discussing a program to find maximum points covered after removing an IntervalFor this we will be provided with N intervals and the maximum range value . Our task is to find that one interval which when removed will give us the maxim numbers in the given range from 1 to maximum range valueExample Live Demo#include #define ll long long int using namespace std; //finding required interval void solve(int interval[][2], int N, int Q) {    int Mark[Q] = { 0 };    for (int i = 0; i < N; i++) {     ... Read More

Hibernate and Eclipse link both are object relational mapping tool. They both are the implementation of JPA.Hibernate is very popular implementation of JPA built by Red hat. It also has some extra features that JPA does not provide.Eclipse is an open source implementation of JPA built by Eclipse foundation. It 'is one of the first project which became part of EE4J. It is available in two forms −Eclipse link jar file format − It is complete package. It has everything which need to run any Eclipse link functionality.OSGI bundles for each of the eclipse link component.Sr. No.KeyHibernateEclipse link1BasicIt is a ... Read More

In this tutorial, we will be discussing a program to find maximum points collected by two persons allowed to meet onceFor this we will be provided with a matrix with cells containing points. Our task is to find the path when two people starting from two corners meet such that they are having maximum points collected.Example Live Demo#include #define M 3 #define N 3 using namespace std; int findMaxPoints(int A[][M]) {    //storing points    int P1S[M+1][N+1], P1E[M+1][N+1];    memset(P1S, 0, sizeof(P1S));    memset(P1E, 0, sizeof(P1E));    int P2S[M+1][N+1], P2E[M+1][N+1];    memset(P2S, 0, sizeof(P2S));    memset(P2E, 0, sizeof(P2E));    for (int ... Read More

String is an immutable class and its object can’t be modified after it is created but definitely reference other objects. They are very useful in multithreading environment because multiple threads can’t change the state of the object so immutable objects are thread safe.String buffer is mutable classes which can be used to do operation on string object such as reverse of string, concating string and etc. We can modify string without creating new object of the string. String buffer is also thread safe.Also, string concat + operator internally uses StringBuffer or StringBuilder class. Below are the differences.Sr. No.KeyStringStringBuffer1BasicString is an ... Read More

In this tutorial, we will be discussing a program to find maximum path sum that starting with any cell of 0-th row and ending with any cell of (N-1)-th rowFor this we will be provided with a matrix with possible moves of (i+1, j), (i+1, j-1), (i+1, j+1). Our task is to start from zeroth position and move to last row finding out the maximum sum path.Example Live Demo#include using namespace std; #define N 4 //finding maximum sum path int MaximumPath(int Mat[][N]) {    int result = 0 ;    int dp[N][N+2];    memset(dp, 0, sizeof(dp));    for (int i = ... Read More

Polymorphism is one of the most important OOPs concepts. Its is a concept by which we can perform single task in multiple ways. There are two types of polymorphism one is Compile-time polymorphism and another is run-time polymorphism.Method overloading is the example of compile time polymorphism and  method overriding is the example of run-time polymorphism.Sr. No.KeyCompile-time polymorphismRuntime polymorphism1BasicCompile time polymorphism means binding is occuring at compile timeR un time polymorphism where at run time we came to know which method is going to invoke2Static/DynamicBindingIt can be achieved through static bindingIt can be achieved through dynamic binding4.InheritanceInheritance is not involvedInheritance is ... Read More

In this tutorial, we will be discussing a program to find maximum path sum for each position with jumps under divisibility conditionFor this we will be provided with an array of n random integers. Our task is to jump from one position to another if it divides it and finally provide the maximum sum path for every given position.Example Live Demo#include using namespace std; //finding maximum sum path void printMaxSum(int arr[], int n) {    int dp[n];    memset(dp, 0, sizeof dp);    for (int i = 0; i < n; i++) {       dp[i] = arr[i];   ... Read More

In this tutorial, we will be discussing a program to find maximum parent children sum in Binary treeFor this we will be provided with a binary tree. Our task is to add up the parent node with its children nodes and finally find the maximum of all of that and print it out.Example Live Demo#include using namespace std; struct Node {    int data;    struct Node *left, *right; }; //inserting nodes struct Node* newNode(int n) {    struct Node* root = new Node();    root->data = n;    root->left = root->right = NULL;    return root; } int maxSum(struct ... Read More