Filter interviews by
Be the first one to contribute and help others!
Yes, I know Java.
I have experience in Java programming.
I am familiar with Java syntax and concepts.
I have worked on Java projects in the past.
To retrieve data from the back end, you can use APIs or database queries.
Use API calls to fetch data from the back end server.
Execute database queries to retrieve data from the database.
Parse the response or query result to extract the required data.
Handle any necessary authentication or authorization for accessing the back end.
Examples: GET request to an API endpoint, SELECT query in SQL.
OOP is a programming paradigm based on the concept of objects, which can contain data and code.
OOP stands for Object-Oriented Programming
It focuses on creating objects that interact with each other to solve a problem
Encapsulation, inheritance, and polymorphism are key concepts in OOP
Example: A car object can have properties like color, make, and model, and methods like start and stop
OOP promotes code reusability and ma
I am a software engineer with experience in developing web applications and mobile apps.
I have a degree in Computer Science
I have worked with Java, Python, and JavaScript
I have experience with front-end frameworks like React and Angular
I have developed mobile apps using React Native
I am familiar with Agile methodologies
I have a passion for software development and enjoy the challenges it presents.
I have always been interested in technology and programming
I have taken courses and completed projects in software development
I enjoy problem-solving and finding efficient solutions
I believe software engineering is a constantly evolving field with endless opportunities for growth
A program to check if a given number is prime or not.
A prime number is a number that is only divisible by 1 and itself.
Start checking from 2 up to the square root of the number.
If the number is divisible by any number in the range, it is not prime.
Otherwise, it is prime.
Optimization: check only odd numbers after 2.
Fibonacci program generates a series of numbers where each number is the sum of the two preceding ones.
The program can be implemented using recursion or iteration.
The first two numbers in the series are always 0 and 1.
The next number is the sum of the previous two numbers.
Example: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418,...
Flowchart for two programs
Identify inputs and outputs
Determine program logic
Create decision points and loops
Connect program components
Include error handling
Test and debug
Document the flowchart
Find sum of all numbers formed from root to leaf path in a binary tree
Traverse the binary tree using DFS
At each leaf node, add the number formed from root to leaf path to a sum variable
Return the sum variable
Time complexity: O(n)
Example: For a binary tree with root value 1, left child 2 and right child 3, the sum would be 12 + 13 = 25
Given a string, print all possible strings that can be made by placing spaces (zero or one) in between them.
Use recursion to generate all possible combinations of spaces
For each recursive call, either add a space or don't add a space between the current character and the next character
Base case is when there are no more characters left to add spaces between
Time complexity is O(2^n) where n is the length of the string
Preorder traversal without recursion
Use a stack to keep track of nodes
Push right child first and then left child onto stack
Pop top of stack and print value
Repeat until stack is empty
Find longest continuous patch on a 12 km road with updates in patches
Maintain a variable to keep track of current patch length
Update the variable whenever a new patch is added
Maintain a variable to keep track of longest patch so far
Compare current patch length with longest patch length and update if necessary
Use a sorted data structure like a binary search tree to store the patches for efficient search
Time complexity: ...
Find median of an unsorted array.
Sort the array and find the middle element
Use quickselect algorithm to find the median in O(n) time
If the array is small, use brute force to find the median
Find 'k' elements closest to a given number from a stream of characters.
Use a priority queue to keep track of closest elements.
Update the queue as new characters come in.
Return the 'k' closest elements from the queue.
Design a data structure with O(1) insert, remove, find-max, and delete-max operations.
Use a doubly linked list to maintain the elements in sorted order.
Use a hash table to store the pointers to the nodes in the linked list.
Maintain a pointer to the maximum element in the hash table.
Update the pointers in the hash table when inserting or removing elements.
Update the maximum pointer when deleting or inserting the maximum
Check if a given linked list is a palindrome.
Traverse the linked list and store the values in an array.
Compare the first and last elements of the array, then move towards the center.
If all elements match, the linked list is a palindrome.
Alternatively, use two pointers to find the middle of the linked list and reverse the second half.
Compare the first half with the reversed second half to check for a palindrome.
I am interested in this profile because of my passion for finance and my experience in the banking industry.
I have a degree in finance and have worked in the banking industry for 5 years.
I am passionate about helping clients achieve their financial goals.
I have experience in managing portfolios and analyzing financial data.
I am excited about the opportunity to work with a team of professionals in the banking industry.
based on 2 reviews
Rating in categories
HR Manager
3
salaries
| ₹1.4 L/yr - ₹6.2 L/yr |
Sales Head
3
salaries
| ₹10.2 L/yr - ₹11.4 L/yr |
HR Recruiter
3
salaries
| ₹0.9 L/yr - ₹1.5 L/yr |
TCS
Accenture
Wipro
Cognizant