Truelancer Senior Java Developer Interview Questions and Answers

General leet code questions

- simple basic ios questions

Q1. Asked DSA array questions
Add your answer

Kadance algorithm and find the middle of the linklist

More on java and Python based coding questions

Q1. Behavioural questions were asked
Add your answer
Q2. What are your expectations from this job
Add your answer
Q3. What are your plans ahead
Add your answer
Q4. Where do you see yourself in 5 years ahead
Add your answer

Learn fundamentals, masted dsa and oop. after create 2 professional projects

Computer Fundamentals

Q1. Flatten a binary tree
Ans. 
Flatten a binary tree by converting it into a linked list in-place.
• Use a recursive approach to flatten the binary tree.

• Traverse the tree in a pre-order manner and keep track of the previous node.

• Set the left child of each node to null and the right child to the next node in the linked list.

• Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
Answered by AI
Add your answer

Leecode medium level question

Leetcode Hard level Question

Q1. This is cto round asked some interview questions
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Formal Introduction.
Asked About Projects.
Difference between SQL and NoSQL. Pros and Cons. Where should we use SQL and NoSQL.
Given a problem, I have to make a SQL Database structure and then interviewer told me to convert it into NoSQL.
asked coding questions

Q1. 
Search In Rotated Sorted Array Problem Statement
Given a sorted array of distinct integers that has been rotated clockwise by an unknown amount, you need to search for a specified integer in the array. Fo...read more
Ans. 
Implement a search function to find a specified integer in a rotated sorted array.
• Implement a binary search algorithm to find the target integer in the rotated sorted array.

• Handle the cases where the target integer may lie in the left or right half of the rotation.

• Keep track of the mid element and adjust the search range based on the rotation.

• Return the index of the target integer if found, else return -1.
Answered by AI
Add your answer
Q2. 
Zigzag Binary Tree Traversal Problem
Given a binary tree, compute the zigzag level order traversal of the node values in the tree. The zigzag traversal requires traversing levels from left to right, then ...read more
Ans. 
Zigzag level order traversal of a binary tree is computed by alternating between left to right and right to left traversal at each level.
• Use a queue to perform level order traversal of the binary tree.

• Maintain a flag to switch between left to right and right to left traversal at each level.

• Store the node values in a list while traversing and alternate the order based on the flag.

• Example: For input 1 2 3 4 -1 5 6 -1 7 -...read more
Answered by AI
Add your answer

Q1. Explain hoisting in js
Ans. 
Hoisting in JavaScript is the behavior where variable and function declarations are moved to the top of their containing scope during the compilation phase.
• Variable declarations are hoisted to the top of their scope, but not their assignments.

• Function declarations are fully hoisted, meaning they can be called before they are declared.

• Hoisting can lead to unexpected behavior if not understood properly.
Answered by AI
Add your answer
Q2. Explain closures in js
Ans. 
Closures in JavaScript allow functions to access variables from their outer scope even after the outer function has finished executing.
• Closures are created when a function is defined within another function and the inner function has access to the outer function's variables.

• Closures can be used to create private variables and functions in JavaScript.

• Closures can also be used to maintain state in asynchronous operations
Answered by AI
Add your answer

Q1. Javascript polyfills
Add your answer