Flipkart Runway: Season 3 | 2025 | Internship

 

Flipkart

2025


All that you need to know about Flipkart Runway: Season 3

We’re back with Season 3 of Flipkart Runway, our Early Career Program for Women Engineers that aims to provide them with an accelerated pathway to a successful career in technology. 

Runway aims at laying an early foundation for women in engineering by giving them early exposure to developmental opportunities through challenging & real-time problem statements, mentoring and networking opportunities.

The selected students get an opportunity to intern with Flipkart in 2023 and a chance to bag a PPI (Pre Placement Interview) for an internship with Flipkart in their pre-final year.

Eligibility & Round Details : 

  • Open to all women engineers who are in the 2nd year of their engineering course (either UG (2025 pass-outs)) or 3rd year of their dual degree courses (2025 pass-outs) any specialization (Full-Time Courses only) 
  • Ability to complete a full-time, 8 to 10-week internship between May to July 2023 (exact program dates will be provided at a later point in the process) 
  • Basic level programming experience in C/ C++/ Java/ JavaScript or Python, etc.

Program Selection Process: 

  • Step 1: Register on Unstop
  • Step 2: Online Test 
  • Step 3: Submit SOP 
  • Step 4: Interviews 
  • Step 5: Get an Offer Letter & Start Internship 

Rewards & Prizes:

  • Selected students get to intern with Flipkart in the summer of 2023 
  • PPI (Pre Placement Interview) opportunity for an internship at Flipkart in pre-final year
  • Opportunity to avail Career Development & Interviewing skills workshop by Flipkart leaders

What are the important dates & deadlines?

  • Registration Deadline16 Mar 23, 11:59 PM IST
  • Online Quiz Round Starts18 Mar 23, 12:00 PM IST
  • Online Quiz Round Deadline18 Mar 23, 08:00 PM IST
  • SOP (Statement of Purpose) Submission Round Deadline26 Mar 23, 11:59 PM IST

Contact the organisers

Rewards and Prizes

PPI Opportunities

PPI (Pre Placement Interview) opportunity for an internship at Flipkart in pre-final year!

Trophy Icon

Internship Opportunities

Selected students get an opportunity to intern with Flipkart in the summer of 2023!

Trophy Icon

APPLY NOW

Comments

Post a Comment

Popular posts from this blog

Global Alphathon | Internship OR Full-Time | Apply Now

Image
  All that you need to know about Global Alphathon Break into the world of quantitative finance and participate in WorldQuant BRAIN’s 2022 Global Alphathon — one of the world’s largest quant competitions. The Global Alphathon is a three-stage, team-based competition running from August to November 2022. Using WorldQuant BRAIN’s web-based simulation platform, Global Alphathon participants accumulate points by building alphas* using historical market data and predefined operators to simulate equity positions. *Alphas are mathematical models that seek to predict the future price movements of various financial instruments. About WorldQuant and WorldQuant BRAIN: Headquartered in the US, WorldQuant is a quantitative asset management firm founded in 2007 with over 750 employees spread across 13 countries. We seek to produce high-quality predictive signals (alphas) through our proprietary research platform. These signals are employed in financial strategies across a variety of asset classe...
Read more

Yet Another Tree Problem

Image
  Nayra doesn't like stories of people receiving random trees as birthday presents, but this time she received a tree as a present for her own birthday! After struggling for a day trying to figure out what to do with this tree, she asked Aryan for help. He gave her this problem. You are given a tree with  N N  vertices and weighted edges. It is rooted at vertex  1 1 . Define  g ( u , v ) g ( u , v )  to be the maximum weight of an edge on the shortest path between vertex  u u  and vertex  v v  in this tree. Just calculating  g ( u , v ) g ( u , v )  is too easy, so you have to process  Q Q  queries. In each query, you are given  K K   distinct  vertices  v 1 , v 2 , … , v K v 1 , v 2 , … , v K . You have to compute the sum of the  g g -values of each pair of vertices among these  K K , i.e, the value ∑ i = 1 K − 1 ∑ j = i + 1 K g ( v i , v j ) ∑ i = 1 K − 1 ∑ j = i + 1 K g ( v i , v j ) N...
Read more

Software Testing Week 5 : Assignment 5 | 2022

Image
  Week 5 : Assignment 5 Due date: 2022-08-31, 23:59 IST. Assignment not submitted 1 point State true or false: GACC subsumes predicate coverage.   True.   False. 1 point When we test to check if a particular clause does not determine a predicate, which kind of coverage criteria are we considering?   Active coverage criteria.   Inactive coverage criteria 1 point Which of the following represents a correct order of subsumption amongst logic coverage criteria? In the options below, read → as ‘subsumes’.   Correlated active clause coverage → Predicate coverage → Clause coverage.   Combinatorial coverage → Predicate coverage → Clause coverage.   Combinatorial coverage → Correlated active clause coverage → Predicate coverage.   General active clause coverage → Correlated active clause coverage → Clause coverage. Consider the logical predicate  p = a ∨ ( b ∧ c ) p = a ∨ ( b ∧ c ) . Truth table for the predicate is given below with rows numbered...
Read more