PHP 5.4 introduced lot of new features and one of the best feature is PHP built-in web server. You can take the advantage of built-in web server for development and testing of your PHP application. It means you don’t need to configure Apache to run your PHP application.
In my last post i wrote the code to reverse linked list using iterative approach. In this post i am going to show how to reverse linked list using recursion. Time complexity of both iterative and recursive approach is O(n).
In my previous post i use iterative approach to print fibonacci series. In this post i’ll show how to print fibonacci series using recursion. In recursion function call itself until the base condition is reached. Read explanation of recursion and what’s the difference between iterative and recursive function.
In this blog post i’ll discuss what is interface, explain why you use interfaces while writing code. What’s the importance of interfaces.
Interfaces allow you to define common structure for class. You can think interface as a contract, through interfaces we lays out some rules, the classes that implement interfaces must follow those rules.
The Fibonacci sequence is the series of numbers such as 0,1,1,2,3,5,…… the next number is the sum of two previous numbers.
In Fibonacci series the first two numbers is 0,1 or 1,1 and next number is the sum of previous two numbers.
Given an unsorted array. How to find duplicates in array using PHP. These types of questions are generally asked in interviews. Sometimes interviewer allows to use in-built function sometimes not.
C Operators. C objective questions and answers on increment(++) and decrement(–) Operators. Before attempting questions let’s go through the concept quickly.
Phalcon is an open source, MVC based PHP framework. Apart from promoting MVC architecture, they offers you a lot of in-built features for faster web development such as ORM (Object Relational Mapping),Templating Engine (Volt),Events Management, Encryption, caching, Validation/Escaping/Filters etc.
Given an array of numbers from 1 to 100. The array is sorted. One number is missing from an array. You have to find the missing number from an array. There are no duplicates in an array.
To count the no. of nodes in a linked list you need to traverse the linked list and increment the count variable by 1. Loop will terminate when pointer points to NULL (means when it reaches at the end). When loop finishes, Print the value of count variable.