Filter interviews by
Be the first one to contribute and help others!
posted on 6 Aug 2015
I am a highly motivated individual with a passion for learning and a strong work ethic.
I have a degree in computer science and have worked in the tech industry for 5 years.
I am proficient in multiple programming languages including Java, Python, and C++.
I am a quick learner and enjoy taking on new challenges.
I am a team player and enjoy collaborating with others to achieve common goals.
In my free time, I enjoy hiking a
Analytics is my passion and expertise. My unique blend of technical skills and business acumen sets me apart from others.
Passionate about analytics and its potential to drive business growth
Expertise in data analysis, statistical modeling, and data visualization
Strong business acumen and ability to translate data insights into actionable strategies
Experience working with diverse industries and data sets
Constantly learn...
Factors considered in pricing television products
Cost of production
Market demand
Competition
Brand value
Features and technology
Distribution and logistics
Profit margin
Target audience
Economic conditions
Improving quality of education in India
Investing in teacher training and development
Increasing access to technology and digital resources
Encouraging parental involvement in education
Promoting vocational education and skill development
Addressing the issue of inadequate infrastructure and resources
posted on 20 Feb 2015
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 4 reviews
Rating in categories
TCS
Accenture
Wipro
Capgemini