To make technologies simpler
by A Friend function is a function defined outside the class, but it has access to all private and protected members of the class. To declare a friend function, it’s prototype must be declared inside the class, preceding it with keyword “friend”. For eg:
class Demo
{
private:
int m;
int y;
public:
friend int sum (Demo d);
void print_val ();
Demo (int m, int y);
};
by Inline function is an important addition in C++. These inline functions mostly are not called and is expanded in line at the invocation place. Hence, these functions are called inline functions. To define a function as inline function, precede function definition with “inline” keyword. These functions are almost similar to Macros in C.
For eg:
inline int sum (int a, int b);
by Storage class specifiers are a way to tell compiler how to store the corresponding variable. There are following types of Storage class specifiers available in C/C++.
by Given an input string of characters write a function that returns another string that has the frequency of each consecutive character followed by the character itself.
eg:
aabbbbbzzzzzzzzzz
2a5b10z
abcdefgh
a1b1c1d1e1f1g1h1
by Given a string ‘s’ and a number ‘n’, write a function that returns a string with each character in s replaced with another character that is ‘n’ positions down the alphabet.
For example:
by Given an array of sizen, the array contains numbers in range from 0 to k-1 wherekis a positive integer and k <= n.
Find the maximum repeating number in this array.
For example:
Input arr = [1,3,4,5,6,7,4]
Maximum occurence element = 4
Maximum occurence = 2
by Given an unsorted array of size n. Array elements are in range from 1 to n.
One number from set {1, 2, …n} is missing and one number occurs twice in array.
Find these two numbers.
For example:
Input arr = [1,3,4,5,6,7,4]
Missing Item = 2
Duplicate Item = 4
by An AVL (Adelson-Velskii and Landis) Tree is a self balancing Binary Search Tree which has the following properties.
For any node “A”, the height of the left subtree of “A” and height of the right subtree of “A” differ by 1 at max.
In case of Binary search Trees worst case search complexity is O(n) in cases when the Binary Search Tree is skewed. In AVL tree, since heights of left and right subtree are balanced, hence search complexity improves to O(log n). Before going ahead have a look into AVL Tree Basics.
(more…)by An AVL (Adelson-Velskii and Landis) Tree is a self balancing Binary Search Tree which has the following properties.
For any node “A”, the height of the left subtree of “A” and height of the right subtree of “A” differ by 1 at max.
In case of Binary search Trees worst case search complexity is O(n) in cases when the Binary Search Tree is skewed. In AVL tree, since heights of left and right subtree are balanced, hence search complexity improves to O(log n). Before going ahead have a look into AVL Tree Basics.
(more…)by An AVL (Adelson-Velskii and Landis) Tree is a self balancing Binary Search Tree which has the following properties.
For any node “A”, the height of the left subtree of “A” and height of the right subtree of “A” differ by 1 at max.
In case of Binary search Trees worst case search complexity is O(n) in cases when the Binary Search Tree is skewed. In AVL tree, since heights of left and right subtree are balanced, hence search complexity improves to O(log n). Before going ahead have a look into AVL Tree Basics.
(more…)