Ionic Software Services interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Ionic Software Services
upvote
share-icon
3 rounds | 9 Coding problems

Interview preparation journey

expand-icon
Journey
My journey from starting with the basics to reaching this job interview has been a remarkable and fulfilling experience. It all began with a strong passion for learning and a desire to push the boundaries of my knowledge. I started by acquiring a solid foundation in various subjects, including computer science with each step, I immersed myself in textbooks, online courses, and practical projects, seeking to deepen my understanding and develop practical skills. As I delved into programming and artificial intelligence, I discovered the power of language models and their potential to transform various fields. This realization sparked my interest in working with language processing and understanding technologies, motivating me to explore and master the domain.
Application story
I applied on LinkedIn, and after one week, I received an email for my interview. Then, I went from 2 technical interview rounds to one final HR interview online, which focused on the programming language Java and data structures and algorithms.
Why selected/rejected for the role?
Due to a combination of factors such as my strong technical skills, in-depth knowledge of the domain, adaptability, problem-solving abilities, and practical communication skills. Additionally, showcasing a genuine passion for the field and a continuous learning mindset can make a candidate stand out.
Preparation
Duration: 6 months
Topics: Data Structures, Dynamic Programming, SQL
Tip
Tip

Tip 1: Practice data Structures every day.
Tip 2: Work on a real-time project.
Tip 3: Focus on small targets, not go from 0 to 100. Go from 0 to 10 and then continue.

Application process
Where: Linkedin
Eligibility: Above 7.5 CGPA
Resume Tip
Resume tip

Tip 1: Make your resume simple and put only useful content and skills in which you are perfect. Don't lie.
Tip 2: Add your top project with a brief intro and also provide their git link.

Interview rounds

01
Round
Medium
Online Coding Test
Duration60 minutes
Interview date12 May 2023
Coding problem4

I was a little nervous but the interviewer was good he made me feel comfortable rest all was a goal he started with an introduction and asked about projects then tested my programming language knowledge (java) in the end there was one coding question.

1. Convert binary tree to mirror tree

Easy
15m average time
85% success
0/40
Asked in companies
AdobeWalmartThales

Given a binary tree, convert this binary tree into its mirror tree.

A binary tree is a tree in which each parent node has at most two children.

Mirror of a Tree: Mirror of a Binary Tree T is another Binary Tree M(T) with left and right children of all non-leaf nodes interchanged.

alt text

Note:
1. Make in-place changes, that is, modify the nodes given a binary tree to get the required mirror tree.
Problem approach

Step 1: Understand the problem 
Step 2: Define the data structure 
Step 3: Implement the preorder mirror traversal function\
Check if the current node is null. If so, return.
Swap the left and right child nodes of the current node.
Print or process the value of the current node.
Recursively call the function on the left and right child nodes (the swapped nodes).
Step 4: Test the solution

Try solving now

2. Technical Questions

What is an abstract class? (Learn)

What is the difference between public, private, and protected access modifiers? (Learn)

3. Guess output

a=123
b=123
System.out.println(a==b);

Problem approach

The code assigns the value 123 to variable a, then assigns the value of a to variable b. Finally, it prints the comparison result a == b, which is true because both variables hold the same value.

4. Sort 0 1 2

Easy
22m average time
0/40
Asked in companies
AmazonOracleWalmart

You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.

Note :
Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.
Problem approach

Step 1: Initialize three Variables to store a count of 0,1,2
Step 2: Count the frequency of the Elements
Step 3: Modify the Array based on their frequency.
Step 4:Return the Sorted Array

Try solving now
02
Round
Easy
Online Coding Test
Duration60 minutes
Interview date15 May 2023
Coding problem4

This time, I was confident before the interview started, but later, I got stuck in some theory questions, due to which my confidence went straight down, later, I somehow managed it, and the interview went well.

1. Balanced parentheses

Moderate
10m average time
90% success
0/80
Asked in companies
WalmartMakeMyTripGoldman Sachs

Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.

Note :

Conditions for valid parentheses:
1. All open brackets must be closed by the closing brackets.

2. Open brackets must be closed in the correct order.

For Example :

()()()() is a valid parentheses.
)()()( is not a valid parentheses.
Problem approach

Step 1: Understand the problem
Step 2: Define the algorithm
Step 3: Write code for the same
If the character is an opening bracket (such as '(', '[', or '{'), push it onto the stack.
If the character is a closing bracket (')', ']', or '}'), check if the stack is empty. If it is, or if the top of the stack does not match the current closing bracket, return false since the brackets are not in the correct order.
If the top of the stack matches the current closing bracket, pop the top element from the stack and continue iterating.
Step 4:Test the solution

Try solving now

2. Technical Question

What is an interface? (Learn)

3. Technical Question

Can you call the base class method without creating an instance? (Learn)

Problem approach

We can do the static method.

4. Technical Question

What is a finally block? (Learn)

03
Round
Easy
Telephonic
Duration25 minutes
Interview date20 May 2023
Coding problem1

It was a call from HR, mainly about whether I could manage the role and discussing some of my weaknesses and strengths from the interview.

1. Basic HR Questions

1. What are your strengths and weaknesses?

2. Do you think you'll be able to manage this role?

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
SDE - 2
3 rounds | 11 problems
Interviewed by Ionic Software Services
749 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8518 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3320 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
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
15480 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
15338 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
10142 views
2 comments
0 upvotes