Queries to check if array elements from indices [L, R] forms an Arithmetic Progression or not

Given an array arr[] consisting of N integers and an array Q[][2] consisting of M queries of the form {L, R}, the task for each… Read More The post Queries to check if array elements from indices [L, R] forms an Arithmetic Progression or not appeared first on GeeksforGeeks.

1d

Check if a Binary String can be sorted in decreasing order by removing non-adjacent characters

Given a binary string S of size N, the task is to check if the binary string S can be sorted in decreasing order by… Read More The post Check if a Binary String can be sorted in decreasing order by removing non-adjacent characters appeared first on GeeksforGeeks.

1d

How to check whether a passed string is palindrome or not in JavaScript ?

Given a string, our task is to find string is palindrome or not. Example: Input : "race" Output : passed string is not a palidrome… Read More The post How to check whether a passed string is palindrome or not in JavaScript ? appeared first on GeeksforGeeks.

1d

How to get the number of occurrences of each letter in specified string in JavaScript ?

Given a string, our task is finding the occurrence of a character in the string with the help of user-defined function. Example: Input : "hello"… Read More The post How to get the number of occurrences of each letter in specified string in JavaScript ? appeared first on GeeksforGeeks.

1d

Hamiltonian Path ( Using Dynamic Programming )

Given an adjacency matrix adj[][] of an undirected graph consisting of N vertices, the task is to find whether the graph contains a Hamiltonian Path… Read More The post Hamiltonian Path ( Using Dynamic Programming ) appeared first on GeeksforGeeks.

1d

Find the index in a circular array from which prefix sum is always non-negative

Given a circular array arr[] consisting of N integers, the task is to find the starting index of the circular array such that the prefix… Read More The post Find the index in a circular array from which prefix sum is always non-negative appeared first on GeeksforGeeks.

1d

Modify Linked List by replacing each node by nearest multiple of K

Given a singly Linked List L consisting of N nodes and an integer K, the task is to modify the value of each node of… Read More The post Modify Linked List by replacing each node by nearest multiple of K appeared first on GeeksforGeeks.

1d

Minimize sum of an array having Bitwise AND of all its pairs present in a given matrix

Given a square symmetric matrix mat[][] of size N, the task is to find the minimum sum possible of an array arr[] of size N,… Read More The post Minimize sum of an array having Bitwise AND of all its pairs present in a given matrix appeared first on GeeksforGeeks.

1d

Minimum number of bins required to place N items ( Using Best Fit algorithm )

Given an array weight[] consisting of weights of N items and a positive integer C representing the capacity of each bin, the task is to… Read More The post Minimum number of bins required to place N items ( Using Best Fit algorithm ) appeared first on GeeksforGeeks.

1d

Calculate Median from given values of Mean and Mode

Given two integers mean and mode, representing the Mean and Mode of a random group of data, the task is to calculate the median of… Read More The post Calculate Median from given values of Mean and Mode appeared first on GeeksforGeeks.

1d