Top Fintech Software Engineer Interview Questions

Get to know how you can ace every interview round of FinTech to land a job as a Software Developer by practicing on CodeStudio.

Sort by

Problem Title

EXP

Difficulty

Avg Time to solve

Attempted

Minimum Subarray With Required Sum

44

80

Moderate

18 mins

1.3k

Mindbending Product

20

40

Easy

20 mins

1k

Delete Alternate Nodes

21

40

Easy

20 mins

53.2k

Edit Distance

71

80

Moderate

30 mins

16k

DFS Traversal

52

80

Moderate

35 mins

10.5k

Minimum Cost Path

26

80

Moderate

25 mins

1.3k

Replace ‘O’ With ‘X’

17

80

Moderate

35 mins

0.5k

Word Search - ll

8

80

Moderate

30 mins

0.5k

Smallest Subarray With K Distinct Elements

75

40

Easy

20 mins

3.4k

Count Subsequences

24

80

Moderate

30 mins

1k

Magical Pattern

6

40

Easy

20 mins

0.2k

Convert Decimal To Irreducible Fraction

4

40

Easy

25 mins

0.1k

Minimum K product

16

40

Easy

20 mins

1.5k

Make Maximum Number

18

80

Moderate

18 mins

0.7k

Left Short

21

40

Easy

50 mins

1.1k

Append Nodes

7

80

Moderate

38 mins

0.5k

Divide Linked List In Two

17

40

Easy

20 mins

0.2k

Flipping Coins

9

80

Moderate

32 mins

0.1k

Gary and multiplication

14

40

Easy

20 mins

0.8k

Count Ways To Reach The N-th Stairs

212

80

Moderate

30 mins

26.7k

Climbing the leaderboard

1

80

Moderate

15 mins

0.2k

Design a hashset

4

80

Moderate

25 mins

0.3k

Partition a set into two subsets such that the difference of subset sums is minimum.

139

120

Hard

10 mins

17.8k

LCS of 3 strings

9

120

Hard

45 mins

1.2k

Print Nodes at Distance K From a Given Node

14

120

Hard

20 mins

1k

Minimum Subarray With Required Sum

Moderate

80

44 upvotes

Mindbending Product

Easy

40

20 upvotes

Delete Alternate Nodes

Easy

40

21 upvotes

Edit Distance

Moderate

80

71 upvotes

DFS Traversal

Moderate

80

52 upvotes

Minimum Cost Path

Moderate

80

26 upvotes

Replace ‘O’ With ‘X’

Moderate

80

17 upvotes

Word Search - ll

Moderate

80

8 upvotes

Smallest Subarray With K Distinct Elements

Easy

40

75 upvotes

Count Subsequences

Moderate

80

24 upvotes

Magical Pattern

Easy

40

6 upvotes

Convert Decimal To Irreducible Fraction

Easy

40

4 upvotes

Minimum K product

Easy

40

16 upvotes

Make Maximum Number

Moderate

80

18 upvotes

Left Short

Easy

40

21 upvotes

Append Nodes

Moderate

80

7 upvotes

Divide Linked List In Two

Easy

40

17 upvotes

Flipping Coins

Moderate

80

9 upvotes

Gary and multiplication

Easy

40

14 upvotes

Count Ways To Reach The N-th Stairs

Moderate

80

212 upvotes

Climbing the leaderboard

Moderate

80

1 upvote

Design a hashset

Moderate

80

4 upvotes

Partition a set into two subsets such that the difference of subset sums is minimum.

Hard

120

139 upvotes

LCS of 3 strings

Hard

120

9 upvotes

Print Nodes at Distance K From a Given Node

Hard

120

14 upvotes

Page of 4