## Sum of Fibonacci Numbers in a range

Given a range [l, r], the task is to find the sum fib(l) + fib(l + 1) + fib(l + 2) + ….. + fib(r)… Read More »

- How can one become good at Data structures and Algorithms easily?
- Quick Sort vs Merge Sort
- Find maximum in a stack in O(1) time and O(1) extra space
- Minimum number of items to be delivered
- Cracking Technical Interviews
- Reach the numbers by making jumps of two given lengths
- Print the nodes of binary tree as they become the leaf node
- Find the number of distinct islands in a 2D matrix
- Samsung Semiconductor Institute of Research(SSIR Software) intern/FTE | Set-3
- Lower and Upper Bound Theory
- Rearrange Odd and Even values in Alternate Fashion in Ascending Order
- Shannon-Fano Algorithm for Data Compression
- Sum of similarities of string with all of its suffixes
- Dijkstra's shortest path with minimum edges
- Sort the array of strings according to alphabetical order defined by another string
- Smallest power of 2 which is greater than or equal to sum of array elements
- Check if it is possible to reach a number by making jumps of two given length
- Code Optimization Technique (logical AND and logical OR)
- Dividing a Large file into Separate Modules in C/C++, Java and Python
- Program for SSTF disk scheduling algorithm
- How to write a Pseudo Code?
- Program to print the Zigzag pattern
- Largest perfect square number in an Array
- Number of array elements derivable from D after performing certain operations
- Iterative Letter Combinations of a Phone Number
- Longest subsequence such that adjacent elements have at least one common digit
- Ternary Search
- Smallest Pair Sum in an array
- Color N boxes using M colors such that K boxes have different color from the box on its left
- Length of the longest alternating subarray

Given a range [l, r], the task is to find the sum fib(l) + fib(l + 1) + fib(l + 2) + ….. + fib(r)… Read More »

Given the Selling price i.e ‘SP’ of the two items each. One item is sold at ‘P%’ Profit and other at ‘P%’ Loss. The task… Read More »

This article is aimed at giving a recursive implementation for pattern printing. Simple triangle pattern: filter_none edit close play_arrow link brightness_4 code // C++ code… Read More »

Given three non-zero integers a, b and c. The task is to find the maximum value possible by putting addition and multiplication signs between them… Read More »

Given an array arr[] of N integers and an integer K. Also given are Q queries which have two numbers L and R. For every… Read More »

Given three integers R, B and W which denote the number of runs, balls and wickets. One can score 0, 1, 2, 3, 6 or… Read More »

Given an array arr[] of N unique elements and Q queries. Every query consists of two integers L and R. The task is to print… Read More »

Given an array arr[] of N elements and an integer K where K < N. The task is to insert K integer elements to the… Read More »

Given a tree having every node’s value as either 0 or 1, the task is to find whether the given binary tree contains any sub-tree… Read More »

Given an array arr[] of N integers and an integer K, one can move from an index i to any other j if j ≤… Read More »

Given an integer N. The following tasks are performed: The number is noted. The leading digit from N is subtracted from N and the resulting… Read More »

Given a string str, the task is to find the longest prefix which is also the suffix of the given string. The prefix and suffix… Read More »

Given two integers A and B, the task is to calculate 22A % B. Examples: Input: A = 3, B = 5 Output: 1 223… Read More »

Given an array arr[] of size N and an integer K, the task is to find the smallest index in the array such that: floor(arr[i]… Read More »

Given an array arr[] and an integer K. The task is to sort the elements that are in between any two multiples of K. Examples:… Read More »