• 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

Flipkart Interview Questions

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

March 24, 2014 by Dhaval Dave

Given an array A[] and a number x, check for pair in A[] with sum as x

Write a C program that, given an array A[] of n numbers and another number x, determines whether
… Read More

Filed Under: Adobe Interview Questions, Flipkart Interview Questions, Interview Questions, problem Tagged With: Array, Sorting

  • « Previous Page
  • Page 1
  • …
  • Page 4
  • Page 5
  • Page 6

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

Generic Object Oriented Stack with Template

Find if a binary tree is height balanced ?

Connect n ropes with minimum cost

Best Java Book | Top Java Programming Book for Beginners

1014 Practice Question of New GRE – Princeton

Check Binary Tree is Binary Search Tree or not

Given Set of words or A String find whether chain is possible from these words or not

ADOBE Aptitude C Language Test

Advanced SQL Injection

Regular Expression Matching

Subset Sum Problem Dynamic programming

Fibonacci Hashing & Fastest Hashtable

Number of Islands BFS/DFS

Common Ancestor in a Binary Tree or Binary Search Tree

Edit Distance ( Dynamic Programming )

Diagonal Traversal of Binary Tree

BlueStone E-commerce Interview Experience

Singly linked list

VMWare SDEII Interview

Templates in C++

Daughter’s Age VeryGood Puzzle

Flipkart SDET Interview Experience

Trapping Rain Water

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Print Power Set of a Set

HackeEarth Flipkart’s Drone

Given a float number convert it into the string WITHOUT using any inbuilt Function

Find min element in Sorted Rotated Array (With Duplicates)

Find position of the only set bit

LeetCode: Container With Most Water

Copyright © 2026 · Genesis Framework · WordPress · Log in