satveersm

unsigned int GetLeftIndexDigit(unsigned int num, unsigned int index, unsigned int base_multiplier)
{
	//todo
	return 0;
}

void CountEncoding(unsigned int num, unsigned int base_multiplier, unsigned int &counter)
{
	if (num <= 9)

satveersm

// MakeCoinChange.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
using namespace std;

satveersm

#include "stdafx.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
using namespace std;

vector<int> SplitsSentense(string s)
{
	vector<int> width_string_parts;

satveersm

// MakeCoinChange.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
#include <algorithm>
using namespace std;

void PrintChanges(int arr[], int coin_change[], int coin_index, int change_index, int max_index, int amount_req)
{

satveersm

// MakeCoinChange.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
#include <algorithm>
using namespace std;

void PrintChanges(int arr[], int coin_change[], int coin_index, int change_index, int max_index, int amount_req)
{

satveersm

https://www.gamedev.net/blogs/entry/2249317-a-guide-to-getting-started-with-boostasio/

satveersm

#include<iostream>
#include<future>
#include<thread>
#include<map>
#include <functional>
#include <queue>
#include <vector>
#include"TimerTask.h"
using namespace std;

satveersm

bool isChild(string str1, string str2)
{
    if(str1.length() != str2.length())
    return false;
    
    int i = 0;
    int count = 0;
    while(i < str1.length())
    {

satveersm

Capture Regions on Board

Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.

A region is captured by flipping all 'O's into 'X's in that surrounded region.

For example,

X X X X
X O O X

satveersm

How many minimum numbers from fibonacci series are required such that sum of numbers should be equal to a given Number N?
Note : repetition of number is allowed.

Example:

N = 4
Fibonacci numbers : 1 1 2 3 5 .... so on
here 2 + 2 = 4