AwanTunai interview experience Real time questions & tips from candidates to crack your interview

Java Developer

AwanTunai
upvote
share-icon
2 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I applied in Awan Tunai Company on LinkedIn for Java developer profile and got shortlisted for the interview. AwanTunai is a supply chain digitisation solution with embedded financing for unbanked SMEs and micro SMEs in Indonesia. Total interview rounds: 1
Application story
I applied on Naukri and got shortlisted for the first interview which went for 1 hr next day I got the news that I have another round 2 days later I went for another round which was managerial and got to know they rejected me.
Why selected/rejected for the role?
I got shortlisted because I was consistently preparing for the role and working on my fundamentals and core learning, also basic coding questions I was practising. Java 8 is must with good knowledge of Threading.
Preparation
Duration: 2 Months
Topics: Data Structures, Algorithms, Java 8, Sql, Spring Boot
Tip
Tip

Tip 1 : Prepare fundamental theory well
Tip 2 : Prepare Easy and medium level questions
Tip 3 : Go through you resume well

Application process
Where: Naukri
Eligibility: B.Tech/M.tech
Resume Tip
Resume tip

Tip 1 : Make your resume relevant
Tip 2 : Mention projects

Interview rounds

01
Round
Easy
Online Coding Interview
Duration60 Minutes
Interview date30 Aug 2022
Coding problem3

1. Intersection of Two Linked Lists

Easy
25m average time
73% success
0/40
Asked in companies
Hewlett Packard EnterpriseSamsungIntuit

You are given two Singly Linked Lists of integers, which may have an intersection point.

Your task is to return the first intersection node. If there is no intersection, return NULL.


Example:-
The Linked Lists, where a1, a2, c1, c2, c3 is the first linked list and b1, b2, b3, c1, c2, c3 is the second linked list, merging at node c1.

alt.txt

Problem approach

public ListNode getIntersectionNode(ListNode headA, ListNode headB) {

if(headA==null || headB==null) return null;

ListNode tempA = headA; 
ListNode tempB = headB; 

while(tempA!=tempB){
tempA = (tempA==null)?headB:tempA.next;
tempB = (tempB==null)?headA:tempB.next;
}
return tempA;
}

Try solving now

2. OS Questions

What are the wait() and sleep() methods?

3. Java Question

What is Runnable and Callable Interface?

02
Round
Easy
HR Round
Duration20 Minutes
Interview date4 Apr 2022
Coding problem2

1. Technical Question

how to convert monolithic to microservices?

2. Basic HR Questions

Introduce yourself

How can  you support work?

What are your hobbies?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8518 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS
907 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3319 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
2580 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Java Developer
3 rounds | 20 problems
Interviewed by Ernst & Young (EY)
9061 views
2 comments
0 upvotes
company logo
Java Developer
3 rounds | 4 problems
Interviewed by SAP Labs
3148 views
0 comments
0 upvotes
company logo
Java Developer
2 rounds | 2 problems
Interviewed by HCL Technologies
7165 views
0 comments
0 upvotes