## PHP Code – Find First Non-Repeated Character in a String

Given an input string, Write a PHP code to find the first Non-repeated character in a string. Suppose an input string is webrewrite, the first non-repeated character in this string is b.

## Top Five Websites to Learn Programming Online

Top Five Websites to Learn Programming Online. There is no age for learning and when it comes to learn programming. The online resources are best since you get to know the latest stuff and tricks. Another important reason why you would like learning programming online is that you won’t need any teacher as such and you will in turn save money. So basically which websites are best to learn programming online? We assimilated the 5 best websites from which you can easily learn programming/coding and achieve your purpose.

## Multiply Two Numbers without using * (Multiplication Operator)

Write a C program to multiply two numbers without using * multiplication operator.

Given two numbers, both numbers are positive.  Write a program to multiply two numbers without using * multiplication operator.  Think for a moment how to solve this problem .

You can use multiple approaches to find the solution of a problem. In this tutorial, we will multiply two numbers using recursion as well as using iterative approach.

Subscribe Our Tutorials

C Program to Multiply Two Numbers without using *

## C Program to Reverse a Linked List using Recursion

Write a c program to reverse a linked list using recursion. Given a singly linked list, we have to write a code to reverse a linked list using recursion. This question is very important in terms of interviews.

In my previous post, I have explained C program to reverse a singly linked list. In this post, We are going to write a code to reverse a linked list using recursion.  If you are not familiar with the concept of recursion then check my previous tutorial on recursion vs iteration.

The time complexity to reverse a linked list using recursion is O(n).

## C Program to Find Missing number in Array

Write a c program to find missing number in array. Given an array of numbers from 1 to n. The array is sorted. One number is missing from an array. You have to write a c code to find the missing number from an array. Also ,there is no duplicates in an array. This type of questions is generally asked in technical interviews

## Swap Two Numbers using Call by Reference in C

How to swap two numbers using call by reference in C , C++. In the interviews interviewer generally asked the difference between call by reference and call by value. In this post let’s understand what is call by reference and how to swap two numbers using call by reference method.

## MCQ on Recursion

Recursion is the most important concept in computer science. In this tutorial, You’ll find practice questions related to recursion.

Recursion video tutorials

In my previous posts, i have written about binary search implementation using recursion and difference between recursion and iteration.

These MCQ helps you to understand the concept of Recursion.

1) Which Data Structure is used to perform Recursion?

a) Queue
b) Stack
D) Tree

## Binary Search using Recursion in C

Write a program to implement binary search using recursion in c. Given a sorted array, we have to search a element in an array using binary search algorithm.

We have a sorted array and we have to search an element from an array using recursive binary search program in c.

## What is binary search?

Binary Search is a searching algorithm that search an element in a sorted array in O(logN) time complexity.

In my previous tutorial, I have discussed Binary search program in c using iterative approach. In this post, I am going to explain how to implement a binary search program in c using recursion.

## Binary Search Program in C

Write a code to implement binary search program in c. Given a sorted array, we have to write a code to search an element in an array using binary search.

## Binary Search

A Binary Search is used to search an element in a sorted array.  In binary search, we first calculate the mid position of an array.  Then, After that we compare element to be search to the middle element an array. If a value matches with the middle element then the index is returned otherwise the algorithm repeats if the value is less than or greater than the middle element.

A Binary search algorithm is efficient than the linear search algorithm. The time complexity of binary search is O(log(n)).

## Program to Print Middle Element of a Linked List

Write a program to print middle element of a linked list. It is also the most asked question in interviews.  I assume you have a basic understanding of linked list and it’s concept.