Flipkart interview questions: - Codeforces

Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

→ Pay attention

Before contest
Codeforces Round (Div. 2)
28:04:17
Register now »

*has extra registration

→ Streams

Codeforces Round 1995 (Div 2) - Official Solution Discussion

By Shayan

Before stream 30:09:15

Codeforces Round 960 Solution Discussion

By aryanc403

Before stream 30:14:15

View all →

→ Top rated

#	User	Rating
1	tourist	3880
2	jiangly	3669
3	ecnerwala	3654
4	Benq	3627
5	orzdevinwang	3612
6	Geothermal	3569
6	cnnfls_csy	3569
8	jqdai0815	3532
9	Radewoosh	3522
10	gyh20	3447

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	awoo	161
2	maomao90	160
3	adamant	156
4	maroonrk	153
5	-is-this-fft-	148
5	atcoder_official	148
5	SecondThread	148
8	Petr	147
9	nor	144
9	TheScrasse	144

View all →

→ Find user

→ Recent actions

Detailed →

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		moonrise07	2021-09-01 20:08:13	33
	en1		moonrise07	2021-09-01 20:06:40	447	Initial revision (published)