• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Urban Ladder Written Test.

May 19, 2015 by Dhaval Dave

I have given Urban Ladder Online Test and my experience and questions are as below.

MCQ ROUND

Q1) An implementation of a queue Q, using two stacks S1 and S2, is given below:

void insert(Q, x) {
   push (S1, x);
} 
void delete(Q){
   if(stack-empty(S2)) then 
      if(stack-empty(S1)) then {
          print(“Q is empty”);
          return;
      }
      else while (!(stack-empty(S1))){
          x=pop(S1);
          push(S2,x);
      }
   x=pop(S2);
}

Let n insert and m (<=n) delete operations be performed in an arbitrary order on an empty queue Q. Let x and y be the number of push and pop operations performed respectively in the process. Which one of the following is true for all m and n?

Max. Marks 10.0
Q2)  If f, r are the front, rear indices respectively in a circular queue (implemented as array) then the condition (( f – r + size) % size == 1) && ((f != 0) || (r != -1)) represents
Max. Marks 10.0
 Q3)  Group A consists of X students and their total age is 221 and their average is an integer. When Group A is merged with Group B with twice the number of students (number of students between 30 and 40), average age of Group B is reduced by 1, what is the original age of Group B.
Max. Marks 10.0
Q4) What will be output when you will execute following c code?
#include<stdio.h>
#define var 3
int main(){
char *cricket[var+~0]={"clarke","kallis"};
char *ptr=cricket[1+~0];
printf("%c",*++ptr);
return 0;
}
Max. Marks 10.0

CODING ROUND

1 ) Print Fizz Buzz 

2) Wordify

Similar Articles

Filed Under: Hacker Earth Questions, Interview Experience

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Closed Parentheses checker

C++ OOPs Part2

ADOBE Aptitude C Language Test

The Magic HackerEarth Nirvana solutions Hiring Challenge

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Mirror of Tree

Skiing on Mountains Matrix

SAP Off Campus Hiring_ March 2015 Sample Questions

LeetCode: Binary Tree Maximum Path Sum

Generate largest number arranging a no. of given non negative integer numbers

Templates in C++

How strtok() Works

VMWare SDEII Interview

Practo Hiring Experience

HackeEarth Flipkart’s Drone

Fibonacci Hashing & Fastest Hashtable

DFS (Depth First Search)

Printing each word reverse in string

Possible sizes of bus to carry n groups of friends

K’th Largest Element in BST when modification to BST is not allowed

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Printing Longest Common Subsequence

strtok()

Convert number to words java

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Introduction To Number Theory ( Part 1 )

Binary Tree in Java

Max Sum in circularly situated Values

Find the element that appears once others appears thrice

Copyright © 2025 · Genesis Framework · WordPress · Log in