Filter interviews by
I applied via Company Website and was interviewed in Aug 2024. There were 3 interview rounds.
1. optimize your website for case study visibility....
2. Leverage social media platforms....
1.Assignment description. Provide a concise description (a few sentences)of the most essential elements of the assignment....
2. Learning goals......
A famous quote for job seekers is 'Success is not the key to happiness. Happiness is the key to success. If you love what you are doing, you will be successful.'
Success is not the key to happiness.
Happiness is the key to success.
If you love what you are doing, you will be successful.
The best career advice is to continuously learn, adapt, and network to advance in your field.
Continuously seek opportunities for learning and growth
Be adaptable and open to change in the workplace
Build a strong professional network for support and opportunities
Motivate job seekers by highlighting growth opportunities, providing positive reinforcement, and fostering a supportive work environment.
Set clear goals and expectations to give job seekers a sense of purpose
Recognize and reward their achievements to boost morale
Encourage open communication and feedback to address any concerns or challenges
Offer training and development opportunities to help job seekers enhance their s
Networking, researching, and tailoring resumes are key to finding a job.
Utilize networking to connect with professionals in your desired field
Research companies and industries to target your job search
Tailor your resume and cover letter to each job application
Practice for interviews to showcase your skills and experience
The 5 steps in the job seeker process involve researching job opportunities, preparing a resume and cover letter, applying for positions, interviewing with potential employers, and following up after interviews.
Research job opportunities to find positions that align with your skills and interests
Prepare a resume and cover letter tailored to each job application
Apply for positions through online job boards, company webs...
I am a highly skilled System Engineer with expertise in designing and implementing complex systems.
Experienced in managing and troubleshooting network infrastructure
Proficient in virtualization technologies such as VMware and Hyper-V
Strong knowledge of operating systems like Windows and Linux
Familiar with scripting languages like PowerShell and Bash
Excellent problem-solving and communication skills
Yes, I have experience working in teams.
I have worked on several group projects during my studies.
I have collaborated with colleagues to solve complex technical problems.
I have participated in cross-functional teams to implement system upgrades.
I have also been part of agile development teams, working closely with software engineers and testers.
One example of teamwork is when I led a team of engineers to successfully d
I am a software engineer with experience in developing and maintaining software applications.
I have a strong background in programming languages such as Java, C++, and Python.
I have worked on various projects, including developing web applications and implementing software solutions.
I am skilled in problem-solving and debugging, ensuring efficient and effective software development.
I have experience in collaborating wi...
I learned valuable teamwork and problem-solving skills during my summer internship.
Developed strong collaboration skills by working with a team of software engineers to complete projects
Gained experience in troubleshooting and debugging software issues
Learned to effectively communicate and present technical concepts to both technical and non-technical stakeholders
Improved problem-solving abilities by identifying and re...
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.
TCS
Accenture
Wipro
Cognizant