Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Sphera Solutions Sustainability Consultant Interview Questions and Answers

Updated 18 May 2021

Sphera Solutions Sustainability Consultant Interview Experiences

1 interview found

Interview Questionnaire 

2 Questions

  • Q1. GRI standard understand and Materiality analysis.
  • Q2. Carbon Emission factors

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Nov 2022. There were 2 interview rounds.

Round 1 - One-on-one 

(1 Question)

  • Q1. The only way I could do that
Round 2 - One-on-one 

(1 Question)

  • Q1. The only way I could do that
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Sep 2023. There were 2 interview rounds.

Round 1 - HR 

(1 Question)

  • Q1. What is your name?
Round 2 - Technical 

(1 Question)

  • Q1. Basics about coding andd project

Interview Questionnaire 

9 Questions

  • Q1. Questions related to the work done at my previous company
  • Q2. Find if a given directed graph is cyclic or not
  • Ans. 

    To check if a directed graph is cyclic or not

    • Use Depth First Search (DFS) algorithm to traverse the graph

    • Maintain a visited set to keep track of visited nodes

    • Maintain a recursion stack to keep track of nodes in the current DFS traversal

    • If a node is visited and is already in the recursion stack, then the graph is cyclic

    • If DFS traversal completes without finding a cycle, then the graph is acyclic

  • Answered by AI
  • Q3. You have a stream of bytes from which you can read one byte at a time. You only have enough space to store one byte. After processing those bytes, you have to return a random byte. Note: The probability of...
  • Ans. 

    Return a random byte from a stream of bytes with equal probability.

    • Create a variable to store the count of bytes read

    • Create a variable to store the current random byte

    • For each byte read, generate a random number between 0 and the count of bytes read

    • If the random number is 0, store the current byte as the random byte

    • Return the random byte

  • Answered by AI
  • Q4. Find if a given Binary Tree is BST or not
  • Ans. 

    Check if a binary tree is a binary search tree or not.

    • Traverse the tree in-order and check if the values are in ascending order.

    • For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.

    • Use recursion to check if all nodes in the tree satisfy the above condition.

  • Answered by AI
  • Q5. Devise an algorithm to determine the Nth-to-Last element in a singly linked list of unknown length. If N = 0, then your algorithm must return the last element. You should parse the list only once
  • Ans. 

    Algorithm to find Nth-to-Last element in a singly linked list of unknown length

    • Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning

    • Move both pointers simultaneously until the second pointer reaches the end of the list

    • The first pointer will be pointing to the Nth-to-Last element

    • If N=0, return the last element

    • Parse the list only once

  • Answered by AI
  • Q6. Given an array of integers, print all possible permutations. Also explain your approach
  • Ans. 

    Print all possible permutations of an array of integers

    • Use recursion to swap elements and generate permutations

    • Start with the first element and swap it with each subsequent element

    • Repeat the process for the remaining elements

    • Stop when all elements have been swapped with the first element

    • Print each permutation as it is generated

  • Answered by AI
  • Q7. Design a Stack DS that also prints in O(1) the minimum element you pushed in the stack
  • Ans. 

    Design a stack that prints the minimum element pushed in O(1)

    • Use two stacks, one for storing elements and another for storing minimums

    • When pushing an element, compare it with the top of minimum stack and push the smaller one

    • When popping an element, pop from both stacks

    • To get the minimum element, just return the top of minimum stack

  • Answered by AI
  • Q8. Given a linked list with loop, how would you find the starting point of the loop ?
  • Ans. 

    To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.

    • Use two pointers, one moving at twice the speed of the other.

    • When they meet, move one pointer to the head of the list and keep the other at the meeting point.

    • Move both pointers one step at a time until they meet again, which is the starting point of the loop.

  • Answered by AI
  • Q9. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-decreasingly. What will be the complexity of the solution
  • Ans. 

    To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.

    • Use binary search to find the number in each row and column

    • Start from the top-right corner or bottom-left corner to optimize search

    • Time complexity: O(m log n) or O(n log m) depending on the starting corner

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: Na

Skills evaluated in this interview

I applied via Company Website and was interviewed before May 2018. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Questions about Oops, data structures based on the projects I had done, and my resume
  • Q2. Questions about classes and abstraction

Interview Preparation Tips

Interview preparation tips for other job seekers - 2 parts; part 1 is a coding test and part 2 is discussion.

Interview Preparation Tips

Round: Test
Experience: A coding test (Students were asked to bring Laptops)
Tips: Be thorough with C/C++, networking, OS, Data structures and architecture
Duration: 90 minutes

Round: Interview
Experience: 3 rounds of interview, one hour each, all technical 
Interview Process:All the three rounds are oriented around programming. A lot of focus was given to Data structures, C/C++, OS and algorithmsThe code from previous test is shown and they expect you to fix any bugs if thereThe interviewers are quietly friendly and help if you get stuck at any pointIf you do have any related projects, anticipate some thorough questions on that
Tips: Though the interviewers are helpful, get your basics clear early on. Don't rely on them.Practice coding sessions, a lot of companies have them as a shortlisting criteria.

College Name: IIT Madras

Interview Preparation Tips

Round: Test
Experience: PAPER DURATION: 3 hours
NO. OF QUESTIONS: 2 (20 marks each)
MAXIMUM MARKS: 20*2 = 40 marksQUESTION 1:
JSON Prettier:-Write a program which takes JSON as input and gives prettified JSONYou need to read JSON from STDIN. Input gives one line of uglified JSON.Output should be formatted JSON. Check the standard output link.Use 2 white spaces (not‘\t’) for one indentation.SAMPLE INPUT:{“group” : {list : [1,2,3]}, “list” : [“a”,”b”,”c”]}SAMPLE OUTPUT:{“group” : {List : [1,2,3]},“list” : [“a”,”b”,”c”]}EXPLANATION: Input will be uglifiedjson in one line and output will be prettified format of that. QUESTION 2:XML parse plus series computationEvaluate an expression given in XML format. Keys will be Expr- contains the entire expression. Elem – contains the digit, sum, Prod- contains two or more keys whose evaluation needs to be summed or multiplied respectively. Sub will contain 2 keys or more, where the second key onwards will have to be subtracted from the first one. Div- will contain 2 keys in which first key will need to be divided by second. SAMPLE INPUT:4673 SAMPLE OUTPUT:
20EXPLANATION:Input will be xml file through standard input. End of xml file marked by .
Duration: 180 minutes
Total Questions: 2

College Name: NA

I was interviewed before Dec 2020.

Interview Questionnaire 

1 Question

  • Q1. Oops concept + html javascript + database is must

Interview Preparation Tips

Interview preparation tips for other job seekers - C# Oops concept + html javascript + db is must.
For experienced - react + Redux , microservices, Web API they will ask everything.
Ad-ons like Android , iOS is plus.

I applied via Company Website and was interviewed in Nov 2020. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Can you walk me through your resume?

Interview Preparation Tips

Interview preparation tips for other job seekers - You will be asked only on the skills you have mentioned in your CV. Prepare well before the interview. People who had taken the interview was my current manager and senior manager. They are very friendly with everyone. Just keep in mind that you have to perform in such a way like you are talking to a friend. All the very best.

I applied via Naukri.com and was interviewed before Jul 2019. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Questions about the projects you worked with. About how specific coding challenges were solved. How it could have been done other ways. etc.
  • Q2. About Python versions and differences. Impact on frameworks.
  • Q3. About module design, apis.

Interview Preparation Tips

Interview preparation tips for other job seekers - It is a relaxed interview, like a discussion. The questions are tough in that they make you think. Review your previous projects and be honest.
Contribute & help others!
anonymous
You can choose to be anonymous

Sphera Solutions Interview FAQs

What are the top questions asked in Sphera Solutions Sustainability Consultant interview?

Some of the top questions asked at the Sphera Solutions Sustainability Consultant interview -

  1. GRI standard understand and Materiality analys...read more
  2. Carbon Emission fact...read more

Recently Viewed

INTERVIEWS

Knest Manufacturers

No Interviews

INTERVIEWS

Waaree Energies

No Interviews

INTERVIEWS

Waaree Energies

No Interviews

INTERVIEWS

Knest Manufacturers

No Interviews

INTERVIEWS

Knest Manufacturers

No Interviews

INTERVIEWS

Waaree Energies

No Interviews

INTERVIEWS

Knest Manufacturers

No Interviews

INTERVIEWS

Schlumberger

No Interviews

INTERVIEWS

Sphera Solutions

No Interviews

INTERVIEWS

Advance Valves Global

No Interviews

Tell us how to improve this page.

Interview Questions from Similar Companies

BrowserStack Interview Questions
3.6
 • 48 Interviews
Fingent Interview Questions
4.4
 • 22 Interviews
Backbase Interview Questions
3.9
 • 22 Interviews
Khoros Interview Questions
3.7
 • 19 Interviews
3Pillar Global Interview Questions
3.3
 • 19 Interviews
Mentor Graphics Interview Questions
4.0
 • 18 Interviews
Yodlee Interview Questions
3.8
 • 17 Interviews
Saviynt Interview Questions
2.6
 • 17 Interviews
View all
Sphera Solutions Sustainability Consultant Salary
based on 4 salaries
₹18.5 L/yr - ₹23.6 L/yr
126% more than the average Sustainability Consultant Salary in India
View more details
Data Analyst
76 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
21 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Consultant
14 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Implementation Consultant
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Sphera Solutions with

ECOSYS

4.9
Compare

Intelegain Technologies

4.0
Compare

Gensuite Software Systems

3.9
Compare

ProcessMAP

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