• 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

Hashing

Fibonacci Hashing & Fastest Hashtable

July 31, 2018 by Dhaval Dave

Fibonacci Hashing : How do we find out what this Fibonacci Hashing is?
In real world Fibonacci hashing is not implemented or used even a part of it, because it’s actually more (Time and Space) … Read More

Filed Under: Algorithm, Data Structure, problem Tagged With: Hashing, Hashmap, Mathematical

Hackerearth : Counting Subarrays

July 7, 2018 by Dhaval Dave

Given an array A of N positive integer values. A sub-array of this array is called Odd-Even sub-array if the number of odd integers in this sub-array is equal to the number  of even integers … Read More

Filed Under: Algorithm, Array, Hacker Earth Questions Tagged With: Array, Hashing, implementation

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

Walmart Labs Interview Experience

Find Percentage of Words matching in Two Strings

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

Advanced SQL Injection

Find the smallest window in a string containing all characters of another string

Find the element that appears once others appears thrice

Handle duplicates in Binary Search Tree

Check if an array has duplicate numbers in O(n) time and O(1) space

Get Minimum element in O(1) from input numbers or Stack

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

Maximum size of square sub matrix with all 1’s in a binary matrix

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

Edit Distance ( Dynamic Programming )

Print Power Set of a Set

Knight Tour Problem (Graph – Breadth First Search)

Adobe Interview Questions 8 month Exp

Given a sorted array and a number x, find the pair in array whose sum is closest to x

25 horses 5 tracks Find 3 fastest puzzle

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Facebook Interview Question : Interleave List

Check Binary Tree is Binary Search Tree or not

Test Cases for Round Function

Printing Longest Common Subsequence

SAP Off Campus Hiring_ March 2015 Sample Questions

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Amazon Interview On-Campus For Internship – 1

Calculate price of parking from parking start end time prices

C Program for TAIL command of UNIX

Copyright © 2026 · Genesis Framework · WordPress · Log in