To make technologies simpler
by Given the number of digits “N” and sum “S” of all the digits. Write a program to find the largest number of N digits that can be possible with given sum S.
For eg:
Input – Digit – 5, Sum – 12
Output – 93000
Input – Digit – 4, Sum – 23
Output – 9950
by Given an array of size n with integer values. Write a program to find the subarray having largest sum.
For eg:
Input array — int arr[] = {3,-1,-4,4,-1,2,1,-5,4}
Largest subarray sum – {4,-1,2,1} = 6
by Given a binary string contains 0’s and 1’s. Write a program to find the longest contiguous occurrence of 0’s and 1’s.
For example:
Input string — 0 1 0 0 0 1 1 0 1 1 0 1 1 1 0 1 0 0 0 1
Length_0: 3 Length_1: 3
Input string — 1 0 0 1 1 1 0 1 1 0 0 0 0 0 1 0 1 0 1 0
Length_0: 5 Length_1: 3
by Standard library included with C++ compilers provides some specific resource management pointers classes which are also called as Smart Pointers.
A normal (raw) pointer typically points to an object, but it doesn’t indicate who owns the objects. This leads to the confusion most of the times, that who is supposed to delete the pointer and free the memory.
Also, by looking into the pointer, one can’t guess how the pointer should be deleted.
Smart pointers are designed to overcome these shortcomings of raw pointers.
by A Binary Search Tree is a Binary tree in which all the nodes have following properties.
As the name suggests, this data structure is mainly used for faster searching. In order to do that, restrictions are applied while inserting/deleting an element into the tree. As a result of these restrictions, worst case search time complexity remains at O(log n).
Below are some examples of Binary Search Trees.
(more…)by Tree data structures are similar to Linked list in which each node points to multiple nodes instead of simply pointing to the next node. A tree is called Binary tree if each node in a tree has maximum of two nodes.
An empty tree is also a Binary tree. We can call the two children of each node as Left and Right child of a node. The node of the tree which has no parent is called the Root of the tree. Perhaps Binary tree is the most used tree data structure in the programming world.
Below are some examples of Binary Tree.
(more…)by Queue data structures are used for storing collection of data where order in which data is arriving is important. In Queue, insertion and deletion both happened from the different end.
Data insertion are done at one end which is known as “rear end” while data deletion are done at other end known as “front end“. The data which is arrived first will be deleted first in Queue.
This data ordering is called as First in First out or FIFO.
by Stack data structures are used for storing collection of data where order in which data is arriving is important. In Stack, insertion, and deletion both happened from the same end which is known as “Top”.
The data which is arrived last will be deleted first in Stack.
This data ordering is called as Last in First out or LIFO.
by Hashing is a technique used to search an specific item in large group of items. Hashing uses hash table to perform search in an constant O(1) time. Hashing uses hash functions to fill items in a hash table. To search, each key is passed into the same hash function which computes an index which provides the corresponding value location.
A Hash table data structures are used in hashing which stores all the key value pairs.
Let’s have a look at the ideal hash table.
(more…)by Graph data structures contains a set of vertices which is called as Node, together with a set of collection of pair of vertices which is called as an Edge.
A graph data structure can be represented as a pair (V, E) where V is a set of nodes called vertices and E is a collection of pairs of vertices called edges.
Graphs are used to solve many real life problems such as fastest ways to go from A to B etc.
Let’s have a look into some graphical examples of Graphs.
(more…)