Flipkart interview questions:

Revision en1, by moonrise07, 2021-09-01 20:06:40

only 2 rounds interview Round 1 : Q1 : Given tree is bst or not Q2 : https://www.geeksforgeeks.org/rearrange-characters-string-no-two-adjacent/ Round 2: Q1 : https://www.geeksforgeeks.org/find-subarray-with-given-sum-in-array-of-integers/ Q2 : https://www.geeksforgeeks.org/partition-a-set-into-two-subsets-such-that-the-difference-of-subset-sums-is-minimum/ Q3 : https://www.geeksforgeeks.org/stock-buy-sell/

Tags #interview, #flipkart, #internship, #coding

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English moonrise07 2021-09-01 20:08:13 33
en1 English moonrise07 2021-09-01 20:06:40 447 Initial revision (published)