Upload Button Icon Add office photos

Filter interviews by

Ice Mortgage Technology Senior Software Engineer 2 Interview Questions and Answers

Updated 13 Jul 2024

Ice Mortgage Technology Senior Software Engineer 2 Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Program to max sum of sub array
  • Ans. 

    Program to find the maximum sum of a subarray within an array of integers.

    • Use Kadane's algorithm to find the maximum sum subarray in linear time complexity.

    • Initialize two variables maxEndingHere and maxSoFar to keep track of the current subarray sum and the maximum sum found so far.

    • Iterate through the array and update the variables accordingly.

    • Example: Input array [1, -3, 2, 1, -1] should return 3 (subarray [2, 1] has

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

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

I applied via Recruitment Consulltant and was interviewed before Jan 2023. There were 3 interview rounds.

Round 1 - Coding Test 

2 leetcode medium questions were asked

Round 2 - System Design 

(1 Question)

  • Q1. 1 feature design end to end
  • Ans. 

    Designing a feature for a social media platform to allow users to create and share photo albums.

    • Allow users to create and name albums

    • Provide an interface for users to upload and organize photos within albums

    • Implement privacy settings to control who can view and contribute to albums

    • Include features like tagging, commenting, and liking photos within albums

    • Enable users to share albums with others via links or social media

  • Answered by AI
Round 3 - HR 

(1 Question)

  • Q1. Basic hr questions
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Design Zomato Ordering System
  • Ans. 

    Design a Zomato Ordering System for online food delivery.

    • Allow users to browse restaurants and menus

    • Implement user authentication and profile management

    • Enable users to place orders and make payments online

    • Include features like order tracking and ratings/reviews

    • Integrate with restaurant partners for order fulfillment

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Need to be very strong on ur Design

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.

Round 1 - Coding Test 

2 Codes on Hackerrank

Round 2 - Technical 

(2 Questions)

  • Q1. Questions on Tree
  • Q2. Questions on Java
Round 3 - Technical 

(1 Question)

  • Q1. Hiring Manager Round

Interview Preparation Tips

Interview preparation tips for other job seekers - Just brush up on DSA And System Design
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed before Oct 2022. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

2 hackerearth problem solving questions was asked.

Round 3 - Technical 

(2 Questions)

  • Q1. 1. Trees related questions were asked.
  • Q2. 2. Some java basic questions were asked
Round 4 - Technical 

(1 Question)

  • Q1. Kinda cultural fitment round where manager use to ask what you’ll do in situation like that.
Round 5 - HR 

(1 Question)

  • Q1. Asked about expectations and all

Interview Preparation Tips

Interview preparation tips for other job seekers - The interview is quite hard to crack but with better ds algorithm and system design experience it’ll be easier to crack it.

I applied via Naukri.com and was interviewed in Jan 2021. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Major interview questions were based on sql concepts like joins, cte, sql functions, etc.
  • Q2. Some basic level questions on python like lists, dictionary, loop related questions, lambda function, map function, etc

Interview Preparation Tips

Interview preparation tips for other job seekers - 3 rounds in total.
1st round- Technical questions asked related to sql and python, approx half an hour interview.
2nd round - Again it was a technical round, questions related to sql and python and related to the projects I have worked in my last organizations. A brief intro about the project I will be joining in Tavant. A person from US took the interview ( although he was Indian).
3rd round-- It was managerial round, basically it was a round with my team manager, not technical, basic questions.
HR discussed the offer related things on call
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Feb 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 - Technical 

(1 Question)

  • Q1. 2nd round with a panel, this was a technical discussion as well.discussing on experience and all kinds of tools we have experience with, asking typical questions like what was the biggest challenge we face...
Round 3 - HR 

(1 Question)

  • Q1. Final round and had a generic HR round, negotiated salary and work timings

Interview Preparation Tips

Topics to prepare for Tavant Technologies Senior Software Engineer interview:
  • SQL
  • SSIS
  • ServiceNow
  • JIRA
  • SSRS
  • Azure databricks
Interview preparation tips for other job seekers - I believe having basic knowledge off your skill and being confident in your answers will help
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Apr 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

3-4 medium-based DSA questions

Round 3 - Technical 

(1 Question)

  • Q1. DSA question related to String, Arrays, Linked List

Interview Preparation Tips

Interview preparation tips for other job seekers - Must have clarity on basics on language

Interview Questionnaire 

21 Questions

  • Q1. AVL tree balance checking
  • Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
  • Ans. 

    Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity

    • Use binary search to find the partition point in both arrays

    • Calculate the median based on the partition point and array sizes

    • Adjust the partition points based on the median value

    • Repeat until the partition points are at the median

    • Handle edge cases such as empty arrays and uneven array sizes

  • Answered by AI
  • Q3. Strings Anagram in O(1) space complexity
  • Ans. 

    Anagram of strings in O(1) space complexity

    • Use a fixed size array of integers to store the frequency of characters in the first string

    • Iterate through the second string and decrement the frequency of each character in the array

    • If all the frequencies are zero, then the strings are anagrams

    • Return true or false accordingly

  • Answered by AI
  • Q4. Level order traversal of a tree using Queue
  • Ans. 

    Level order traversal of a tree using Queue

    • Create a queue and add the root node to it

    • While the queue is not empty, remove the front node and print its value

    • Add the left and right child nodes of the removed node to the queue

    • Repeat until the queue is empty

  • Answered by AI
  • Q5. Reverse level order traversal of a tree using Queue
  • Ans. 

    Reverse level order traversal of a tree using Queue

    • Create a queue and push the root node into it

    • While the queue is not empty, pop the front node and push its children into the queue

    • Add the popped node to a stack

    • Once the queue is empty, pop elements from the stack and print them

  • Answered by AI
  • Q6. BFS and DFS Difference
  • Ans. 

    BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.

    • BFS uses a queue while DFS uses a stack or recursion.

    • BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.

    • BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.

    • BFS can be used to find connected components while DFS

  • Answered by AI
  • Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
  • Q8. Parenthesis Balance Checking
  • Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
  • Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
  • Ans. 

    Find product of each element of an array except that element in O(N) time complexity without using / operation

    • Use prefix and suffix products

    • Multiply prefix and suffix products for each element to get the final product

    • Handle edge cases where array has 0 or 1 element separately

  • Answered by AI
  • Q11. Recursively deleting linked list
  • Ans. 

    Recursively delete a linked list

    • Create a recursive function that takes the head of the linked list as input

    • Base case: if the head is null, return

    • Recursively call the function with the next node as input

    • Delete the current node

  • Answered by AI
  • Q12. Recursively deleting linked list from end
  • Ans. 

    Recursively delete a linked list from the end.

    • Start from the head and recursively traverse to the end of the list.

    • Delete the last node and set the second last node's next pointer to null.

    • Repeat until the entire list is deleted.

    • Use a recursive function to implement the deletion process.

  • Answered by AI
  • Q13. Recursively deleting tree
  • Ans. 

    Recursively delete a tree by deleting all its child nodes and then the parent node.

    • Start from the leaf nodes and delete them first.

    • Then move up to the parent nodes and delete them.

    • Repeat until the root node is deleted.

    • Use post-order traversal to ensure child nodes are deleted before parent nodes.

  • Answered by AI
  • Q14. Recursively deleting from end
  • Ans. 

    Recursively delete elements from the end of an array.

    • Create a recursive function that removes the last element of the array.

    • Call the function recursively until the desired number of elements are removed.

    • Handle edge cases such as empty arrays and removing more elements than the array contains.

  • Answered by AI
  • Q15. Difference between Floyd Warshall and Djikstra
  • Ans. 

    Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.

    • Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.

    • Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).

    • Floyd Warshall can handle negative edge weights while Djikstra cannot.

    • Floyd Warshall can detect negative cycles while Dj

  • Answered by AI
  • Q16. Shortest path between 2 points in 2-D space in O(log N) time
  • Ans. 

    There is no known algorithm to find shortest path in 2-D space in O(log N) time.

    • The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).

    • Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).

    • If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).

  • Answered by AI
  • Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
  • Ans. 

    Design a system for putting newspapers using classes and functions

    • Create a Newspaper class with attributes like title, date, and content

    • Create a Publisher class with methods to publish and distribute newspapers

    • Create a Subscriber class with methods to subscribe and receive newspapers

    • Use inheritance to create different types of newspapers like daily, weekly, etc.

    • Implement a database to store newspaper information and ha

  • Answered by AI
  • Q18. SQL commands
  • Q19. Career Prospects - Long Term Plans
  • Q20. Why not higher studies?
  • Ans. 

    I believe practical experience is more valuable than higher studies.

    • I have gained valuable experience through internships and projects.

    • I prefer hands-on learning and problem-solving over theoretical knowledge.

    • I am constantly learning and improving my skills through online courses and workshops.

  • Answered by AI
  • Q21. Machine Learning Concepts - Based on my projects

Interview Preparation Tips

Round: Test
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.

General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc

Skills evaluated in this interview

I was interviewed before Jun 2016.

Interview Questionnaire 

7 Questions

  • Q1. What is JVM?
  • Ans. 

    JVM stands for Java Virtual Machine. It is a virtual machine that executes Java bytecode.

    • JVM is a part of the Java Runtime Environment (JRE).

    • It provides a platform-independent execution environment for Java programs.

    • JVM interprets Java bytecode and translates it into machine-specific instructions.

    • It manages memory, handles garbage collection, and provides runtime environment for Java applications.

    • JVM supports Just-In-T...

  • Answered by AI
  • Q2. Is JVM platform independent?
  • Ans. 

    Yes, JVM is platform independent.

    • JVM stands for Java Virtual Machine.

    • It provides a runtime environment for executing Java bytecode.

    • JVM abstracts the underlying hardware and operating system, making Java programs portable.

    • Java programs can run on any platform that has a compatible JVM installed.

    • JVM implementations exist for various operating systems, such as Windows, macOS, Linux, etc.

  • Answered by AI
  • Q3. What is software testing?
  • Ans. 

    Software testing is the process of evaluating a software application or system to ensure it meets the specified requirements.

    • Software testing is done to identify defects or errors in the software.

    • It involves executing the software with test cases and comparing the actual results with expected results.

    • Testing can be performed at different levels such as unit testing, integration testing, system testing, and acceptance t...

  • Answered by AI
  • Q4. What is Inheritence in Java
  • Ans. 

    Inheritance in Java allows a class to inherit properties and methods from another class.

    • Inheritance is a fundamental concept in object-oriented programming.

    • It promotes code reusability and allows for the creation of hierarchical relationships between classes.

    • The class that is being inherited from is called the superclass or parent class, while the class that inherits is called the subclass or child class.

    • The subclass c...

  • Answered by AI
  • Q5. How was your technical round
  • Ans. 

    My technical round was challenging but I was able to showcase my skills and problem-solving abilities.

    • I was asked to write code on a whiteboard to solve a specific problem.

    • I had to explain my thought process and reasoning behind my code.

    • I was given a technical scenario and asked how I would approach solving it.

    • I was asked about my experience with specific programming languages and technologies.

    • I was tested on my proble...

  • Answered by AI
  • Q6. Why do you want join Tavant
  • Ans. 

    I want to join Tavant because of its innovative projects and collaborative work environment.

    • Tavant's reputation for cutting-edge technology and innovative solutions

    • Opportunity to work with a talented and diverse team

    • Desire to contribute to impactful projects and make a difference

    • Positive company culture and focus on employee growth and development

  • Answered by AI
  • Q7. When can you join
  • Ans. 

    I can join within 2 weeks of receiving an offer.

    • I can start within 2 weeks of receiving an offer.

    • I need to give notice to my current employer.

    • I may need time to relocate if necessary.

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Written test for aptitude and technical questions
Duration: 30 minutes
Total Questions: 30

Round: Group Discussion
Experience: Put forwarded my point inbthe group.
Duration: 15 minutes

Round: Managerial round
Experience: I had been asked why do you want to join Tavant? How would your skill set add value to the organization?

College Name: BMS College Of Engineering, Bangalore

Skills evaluated in this interview

Ice Mortgage Technology Interview FAQs

How many rounds are there in Ice Mortgage Technology Senior Software Engineer 2 interview?
Ice Mortgage Technology interview process usually has 1 rounds. The most common rounds in the Ice Mortgage Technology interview process are Technical.

Tell us how to improve this page.

Ice Mortgage Technology Senior Software Engineer 2 Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

HDFC Bank Interview Questions
3.9
 • 2.1k Interviews
Oracle Interview Questions
3.7
 • 848 Interviews
Oracle Cerner Interview Questions
3.7
 • 157 Interviews
ServiceNow Interview Questions
4.1
 • 120 Interviews
Thomson Reuters Interview Questions
4.1
 • 112 Interviews
Amadeus Interview Questions
3.9
 • 107 Interviews
UKG Interview Questions
3.1
 • 100 Interviews
Atlassian Interview Questions
3.6
 • 88 Interviews
Temenos Interview Questions
3.2
 • 82 Interviews
View all
Document Processor
187 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
53 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate
24 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Technical Support Analyst
22 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior QA Engineer
20 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Ice Mortgage Technology with

Tavant Technologies

3.8
Compare

LendingKart

3.2
Compare

Sammaan Capital Limited

3.7
Compare

HDFC Bank

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