Kempston

N A

Interview Questions

Learn and Practice on almost all coding interview questions asked historically and get referred to the best tech companies.

Problem Title
Exp
Difficulty
Avg. time
Attempted
Upvotes
yellow-spark
80
Moderate
35 mins
289.8k
upvote
2.1 k
yellow-spark
40
Easy
15 mins
407.8k
upvote
1.5 k
yellow-spark
80
Moderate
15 mins
72.2k
upvote
799
yellow-spark
120
Hard
15 mins
51.1k
upvote
537
yellow-spark
80
Moderate
30 mins
49.5k
upvote
527
yellow-spark
40
Easy
25 mins
54k
upvote
452
yellow-spark
120
Hard
25 mins
43.2k
upvote
304
yellow-spark
40
Easy
20 mins
57k
upvote
282
Prev
Page of 3
Next

Guided Paths

Here is your ultimate guide for cracking your dream job interview, you can choose your tracks and start preparing for Kempston

Data structures & algorithms (Beginner to Intermediate)
If you are a complete beginner to data structures / want quick content to revise and practise questions for placements, this is the guided path for you . This guided path covers the absolute basics introducing every data structure, its need and then checks your understanding with relevant coding questions and mcqs to solve, so that you can have an all round understanding of the concepts studied.

Earn Certificate of completion

Average time to complete 35 days

Pre-requisites: Basics of programming in any language (CPP/Java/Python)

Earn & upgrade badge
badge
badge
badge

You can also try

InCred Financial Ser...
Interview Preparation

Includes:

  • Interview Experiences
  • Problem Listing
  • Guided Path
  • Mock Test
Total Problems
Total Score
Udaan-The Students M...
Interview Preparation

Includes:

  • Interview Experiences
  • Problem Listing
  • Guided Path
  • Mock Test
Total Problems
Total Score
Nineleaps Technologi...
Interview Preparation

Includes:

  • Interview Experiences
  • Problem Listing
  • Guided Path
  • Mock Test
Total Problems
Total Score
Quadrical AI
Interview Preparation

Includes:

  • Interview Experiences
  • Problem Listing
  • Guided Path
  • Mock Test
Total Problems
Total Score