Quikr interview experience Real time questions & tips from candidates to crack your interview

Software Developer

Quikr
upvote
share-icon
2 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: PHP, data base, data structures, Algorithms
Tip
Tip

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Interview rounds

01
Round
Easy
Coding Test - Pen and paper
Duration60 minutes
Interview date10 May 2015
Coding problem2

This was a written coding test with 2 coding questions to be solved in 60 minutes.

1. Find Missing Number In String

Moderate
15m average time
85% success
0/80
Asked in companies
AdobeOLX GroupAmazon

You had a sequence of consecutive nonnegative integers. You appended all integers at the end of each other to form a string ‘S’ without any separators. While appending each integer in a string, you forgot to append exactly one integer from the sequence. Now all the integers from a string and you don’t know which integer you have missed.

For example sequence 11, 12, 13 may form a string (without any separators) “1113” if you miss 12.

Your task is to find the missing number in the string such that it is possible to obtain a sequence of consecutive non-negative integers from the given string. If more than one missing integer is present or all the integers are already present or if the string is not valid then the answer will be -1 for all such cases.

Note:
1. The string consists of only digits 0 to 9.
2. The numbers will have no more than six digits. 
Problem approach

XOR approach can be used to solve this question in an efficient manner. The following property of XOR can be used :
1. If x1^x2^…xn = a and x1^x2^..xn-1 = b , then a^b = xn

Steps:
1. Declare two variables a= 0 and b = 0
2. Calculate the xor of numbers from 1 to n and store them in a i.e. 1^2^…n = a. 
3. Now traverse the array from start to end.
4. For every index i update b as b = b ^ arr[i]
5. Return the missing number as a ^ b. 
Time Complexity : O(N)
Space complexity : O(1)

Try solving now

2. First non repeating character

Easy
15m average time
80% success
0/40
Asked in companies
HCL TechnologiesWells FargoAmazon

Ninja is now bored with numbers and is now playing with characters but hates when he gets repeated characters. Ninja is provided a string, and he wants to return the first unique character in the string.The string will contain characters only from the English alphabet set, i.e., ('A' - 'Z') and ('a' - 'z'). If there is no non-repeating character, print the first character of the string. If there is no non-repeating character, return the first character of the string.

Problem approach

This problem can be solved using the hashing concept. The objective is to run over the string and record how many times each character appears in it in a hash map. Then we run over the string again, this time using the hash map as a reference to see if any of the characters are unique. If the character is unique, return the index.
Time Complexity: O(N) 
The above approach requires two traversals of the string. To solve the question in a single traversal only, along with storing the count of a character store the index a particular character was encountered the first time. So when it comes to finding the first non-repeating character, just scan the hash map, instead of the string and return the character with occurrences as 1 and least index in the string.

Try solving now
02
Round
Medium
Face to Face
Duration60 minutes
Interview date12 May 2015
Coding problem5

Technical interview round with questions around PHP and DBMS.

1. Technical Question

What is Connection Pooling?

Problem approach

A connection pool is a type of database connection cache that can be customized to meet unique needs. Connection pooling is a well-known data access method that aims to reduce the overhead of database connections and read/write database operations.

2. Technical Question

Create a singleton design pattern in PHP 5

Problem approach


class DataBaseConnector {

private static $obj;

private final function __construct() {
echo __CLASS__ . " initialize only once ";
}

public static function getConnect() {
if (!isset(self::$obj)) {
self::$obj = new DataBaseConnector();
}

return self::$obj;
}
}

$obj1 = DataBaseConnector::getConnect();
$obj2 = DataBaseConnector::getConnect();

var_dump($obj1 == $obj2);
?>

3. Technical Question

Write code to connect PHP to MySQL.

Problem approach

$servername = "localhost";
$username = "username";
$password = "password";

// Create connection
$conn = new mysqli($servername, $username, $password);

// Check connection
if ($conn->connect_error) {
die("Connection failed: " . $conn->connect_error);
}
echo "Connected successfully";
?>

4. Technical Question

Different types of error in PHP

Problem approach

The four types of PHP errors are:
1. Warning Error : A warning error in PHP does not stop the script from running. It only warns you that there is a problem, one that is likely to cause bigger issues in the future.
2. Notice Error : Notice errors are minor errors. They are similar to warning errors, as they also don’t stop code execution.
3. Parse Error : Parse errors are caused by misused or missing symbols in a syntax. The compiler catches the error and terminates the script.
4. Fatal Error : Fatal errors are ones that crash your program and are classified as critical errors. An undefined function or class in the script is the main reason for this type of error.

5. Technical Question

How session works in PHP?

Problem approach

When a user request a web page e.g. p1.php, session_start() function is used to create new session. The session ID is sent to browser, where its stored as cookie. When user send another request to same web application, session ID cookie is automatically added to HTTP request packet, which is used by server to identify particular session of the user from many others.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Quikr
849 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 11 problems
Interviewed by Quikr
1017 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Quikr
653 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Quikr
777 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Developer
5 rounds | 14 problems
Interviewed by Microsoft
3931 views
1 comments
0 upvotes
company logo
Software Developer
6 rounds | 12 problems
Interviewed by SAP Labs
2806 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 3 problems
Interviewed by Amazon
1133 views
0 comments
0 upvotes