Upload Button Icon Add office photos

Filter interviews by

Smallcase Technologies Software Development Engineer II Interview Questions and Answers

Updated 10 Feb 2024

Smallcase Technologies Software Development Engineer II Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed before Feb 2023. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Design a LLD of portfolio management system where you can add any stock to your portfolio sell any stock. calculate % return on your port folio. list your portfolio which is stocks with current prices and ...
  • Ans. 

    Design a portfolio management system to add and sell stocks, calculate returns, and display current prices and returns.

    • Create a class for the portfolio with methods to add and sell stocks

    • Implement a method to calculate the percentage return on the portfolio

    • Maintain a list of stocks in the portfolio with their current prices and returns

    • Use arrays or lists to store the portfolio data

    • Ensure proper error handling for inval

  • Answered by AI
  • Q2. Design a referal bonus system.
  • Ans. 

    Design a referral bonus system.

    • Define the criteria for a successful referral

    • Determine the bonus amount or reward for successful referrals

    • Create a tracking system to monitor referrals

    • Establish a process for verifying and approving referrals

    • Communicate the referral program to employees or users

    • Implement a mechanism for distributing the referral bonus

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - be good at LLD and HLD. have good grasp of basics.

Skills evaluated in this interview

Interview questions from similar companies

Interview Questionnaire 

1 Question

  • Q1. Basic Questions of Oops and MVC

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

  • Q1. 

    Cycle Detection in a Singly Linked List

    Determine if a given singly linked list of integers forms a cycle or not.

    A cycle in a linked list occurs when a node's next points back to a previous node in the ...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.

    • Use Floyd's Cycle Detection Algorithm to determine if there is a cycle in the linked list.

    • Maintain two pointers, one moving at double the speed of the other, if they meet at any point, there is a cycle.

    • If one of the pointers reaches the end of the list (null), there is no cycle.

  • Answered by AI
  • Q2. 

    Next Greater Element Problem Statement

    Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...

  • Ans. 

    Find the Next Greater Element for each element in a list of integers.

    • Iterate through the list of integers from right to left.

    • Use a stack to keep track of elements for which the Next Greater Element is not yet found.

    • Pop elements from the stack until a greater element is found or the stack is empty.

    • Assign the Next Greater Element as the top element of the stack or -1 if the stack is empty.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. How would you design an ATM machine?
  • Ans. 

    Designing an ATM machine involves considering user interface, security measures, transaction processing, and hardware components.

    • User interface should be intuitive and easy to navigate for users of all ages.

    • Implement security measures such as PIN entry, card authentication, and encryption to protect user data.

    • Transaction processing should be fast and reliable, with options for cash withdrawals, deposits, transfers, and...

  • Answered by AI
Round 3 - HR 

Round duration - 45 Minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNAGroww interview preparation:Topics to prepare for the interview - DSA, Database Systems, OOP, Operating Systems, Computer NetworksTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice DSA daily
Tip 2 : Try to think of the solution first before jumping to the solution
Tip 3 : Go through interview experience
Tip 4 : Have mock interviews

Application resume tips for other job seekers

Tip 1 : Know in depth what is there in your resume
Tip 2 : Mention your skills and work properly

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.

Interview Preparation Tips

Topics to prepare for Angel One Software Developer interview:
  • Python
  • SQL
Interview preparation tips for other job seekers - Very nice and smooth interview process and quick responses.

I applied via Approached by company and was interviewed in Dec 2021. There were 4 interview rounds.

Round 1 - Coding Test 

2 questions. 1 was basic level. 2 was of medium level.

Round 2 - One-on-one 

(2 Questions)

  • Q1. An ambiguous problem statement was given. Asking relevant questions revealed the problem to be largest island in a binary matrix. Was asked to code on an ide. And reduce space complexity to O(1).
  • Q2. Maximum sum path from root to leaf in an N-ary tree. Was asked to design an appropriate data structure. Then code the solution in O(n) time and O(1) space.
Round 3 - One-on-one 

(3 Questions)

  • Q1. Through discuss of projects. Methods used.
  • Q2. First missing positive number in an array of integer in O(n) time O(1) space.
  • Ans. 

    Find first missing positive number in an array in O(n) time and O(1) space.

    • Traverse the array and mark the presence of each positive integer by changing the sign of the corresponding index.

    • Traverse the array again and return the index of the first positive integer.

    • If all integers are present, return the length of the array + 1.

    • Example: [3, 4, -1, 1] => mark 3rd and 4th index as negative => return 2.

    • Example: [1, 2, 0] =...

  • Answered by AI
  • Q3. Given an integer, print the relevant column name in an excel sheet. Ex: 1- A , 2-B.......... 26-Z , 27-AA, 28-AB........ Was asked code on an ide and test cases were given.
  • Ans. 

    Given an integer, print the relevant column name in an excel sheet.

    • Create a string array of alphabets from A to Z

    • Use modulo operator to get remainder and divide by 26 to get quotient

    • Append the corresponding alphabet to the result string

    • Reverse the result string

  • Answered by AI
Round 4 - HR 

(1 Question)

  • Q1. What are your salary expectations?

Interview Preparation Tips

Interview preparation tips for other job seekers - Focus on DSA and past experience.

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Topics:-
Duration-1.5 hours
Kadane's Algorithm, Even Numbers at even index & odd at odd index, print out the second highest node of the tree

Round 2 - One-on-one 

(1 Question)

  • Q1. DSA ZigZag tree traversal OS Architecture of RAM Types of RAM Difference between compiler and interpreter What is a scheduler What is multithreading Disadvantages of FCFS and how can we use RoundRobin to ...
  • Ans. 

    ZigZag tree traversal is a method to traverse a binary tree in a zigzag pattern.

    • In ZigZag tree traversal, we visit the nodes of a binary tree in a zigzag pattern, moving from left to right and then right to left.

    • We can use a stack or a queue to implement ZigZag tree traversal.

    • The algorithm involves maintaining two stacks or two queues to keep track of the nodes at each level.

    • We start with the root node and alternate be...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be clear with Basics and fundamentals

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Maths,quant for 1 hour duration

Round 2 - Coding Test 

Arrays, strings, linked list, palindrome

Interview Questionnaire 

1 Question

  • Q1. Online Test: First was the online test for 1hr you have to solve 2 coding questions.(Street light coverage & Candy distribution) After clearing the coding round, HR called me scheduling for technical in...
Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed in Jul 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Coding Test 

Arrays, LinkedList basic dsa questions

Round 3 - One-on-one 

(2 Questions)

  • Q1. Binary Tree 2nd largest node
  • Ans. 

    To find the 2nd largest node in a binary tree, we can perform an in-order traversal and keep track of the two largest nodes.

    • Perform an in-order traversal of the binary tree

    • Keep track of the two largest nodes encountered

    • Return the second largest node when traversal is complete

  • Answered by AI
  • Q2. Basic web questions

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Jan 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Easy coding question generally A, B level question of codeforces

Round 2 - Technical 

(1 Question)

  • Q1. OOPs, DBMS , Computer network and some basics over java

Interview Preparation Tips

Interview preparation tips for other job seekers - Easy interview rounds .No worries

Smallcase Technologies Interview FAQs

How many rounds are there in Smallcase Technologies Software Development Engineer II interview?
Smallcase Technologies interview process usually has 1 rounds. The most common rounds in the Smallcase Technologies interview process are One-on-one Round.
What are the top questions asked in Smallcase Technologies Software Development Engineer II interview?

Some of the top questions asked at the Smallcase Technologies Software Development Engineer II interview -

  1. design a LLD of portfolio management system where you can add any stock to your...read more
  2. design a referal bonus syst...read more

Tell us how to improve this page.

Smallcase Technologies Software Development Engineer II Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Angel One Interview Questions
3.9
 • 135 Interviews
Sharekhan Interview Questions
3.9
 • 81 Interviews
Groww Interview Questions
3.8
 • 65 Interviews
Edelweiss Interview Questions
3.9
 • 58 Interviews
Upstox Interview Questions
3.7
 • 35 Interviews
Paytm Money Interview Questions
3.2
 • 27 Interviews
Motilal Oswal Interview Questions
3.8
 • 19 Interviews
View all
Smallcase Technologies Software Development Engineer II Salary
based on 9 salaries
₹18 L/yr - ₹32 L/yr
At par with the average Software Development Engineer II Salary in India
View more details
Software Engineer
13 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

QA Engineer
13 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Development Engineer II
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Product Manager
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Smallcase Technologies with

Zerodha

4.1
Compare

Upstox

3.7
Compare

Groww

3.7
Compare

Paytm Money

3.2
Compare
Did you find this page helpful?
Yes No
write
Share an Interview