## Game Theory (Normal-form game) | Set 3 (Game with Mixed Strategy)

Consider the following payoff matrix with respect to player A and solve it optimally. Solution: If a game has no saddle point then the game… Read More »

- Data Structures and Algorithms Online Courses : Free and Paid
- Count pairs in array whose sum is divisible by K
- Why companies like Amazon, Microsoft, Google focuses on Data Structures and Algorithms : Answered
- Travelling Salesman Problem implementation using BackTracking
- Longest subsequence such that adjacent elements have at least one common digit
- Count common characters in two strings
- Double Knapsack | Dynamic Programming
- Coin Change | BFS Approach
- Design a Chess Game
- Comparison among Bubble Sort, Selection Sort and Insertion Sort
- Interactive Problems in Competitive Programming
- Microsoft Interview experience for full time position of software engineer at Microsoft Ireland Research
- Minimum number of cubes whose sum equals to given number N
- Count of integers of length N and value less than K such that they contain digits only from the given set
- Complexity Analysis of Binary Search
- Merge two BSTs with constant extra space
- Rearrange characters in a string such that no two adjacent are same using hashing
- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- Microsoft TechSetGo Summer Internship Interview Experience
- Find the number of binary strings of length N with at least 3 consecutive 1s
- Count how many times the given digital clock shows identical digits
- Program to generate all possible valid IP addresses from given string | Set 2
- Find a triplet in an array whose sum is closest to a given number
- Print path from root to all nodes in a Complete Binary Tree
- Rearrange numbers in an array such that no two adjacent numbers are same
- Range Queries to Find number of sub-arrays with a given xor
- Find maximum meetings in one room
- Count number of ways to reach destination in a maze
- Difference Between BFS and DFS
- Find the sum of the diagonal elements of the given N X N spiral matrix

Consider the following payoff matrix with respect to player A and solve it optimally. Solution: If a game has no saddle point then the game… Read More »

The task is to print a pattern as shown in the example for a given integer value. The goal is not to print just this… Read More »

Given N bottles. The ith bottle has A[i] radius. Once a bottle is enclosed inside another bottle, it ceases to be visible. The task is… Read More »

Given three integers a, b and c such that a + b + c = 0. The task is to find the roots of a… Read More »

Given two integers A and B. The task is to find the nearest greater value to B by interchanging the digits of A. If no… Read More »

Given an unsorted array with both positive and negative elements. The task is to find the smallest positive number missing from the array. Examples: Input:… Read More »

Given an array of pairs arr of size N which represents a game situation where the first player wins against the second player. Given multiple… Read More »

Given an array a of size N. The task is to print the length of the longest alternative odd/even or even/odd subsequence. Examples: Input: a[]… Read More »

Given two integer N and X. N represents the number of rows and columns of a table. And the element at the ith row and… Read More »

Given a tree of N nodes and an integer K, each node is numbered between 1 and N. The task is to find the number… Read More »

Game Theory (Normal – form game) | Set 1 (Introduction) Please go through the above article before proceeding. Given a payoff matrix. The task is… Read More »

Given an array a of size N. The task is to find a subsequence X of length K such that gcd(X[0], X[1]) + (X[2], X[3])… Read More »

There is one meeting room in a firm. There are N meetings in the form of (S[i], F[i]) where S[i] is the start time of… Read More »

Game theory is a mathematical model used for decision making. It has applications in all fields of social science, as well as in logic and… Read More »

Given a directed graph with N vertices and M edges that may contain cycles, the task is to find the lexicographically smallest topological ordering of… Read More »