i
Pepcoding
Filter interviews by
I applied via Referral and was interviewed before Oct 2022. There were 2 interview rounds.
To invert a binary tree, swap the left and right children of each node recursively.
Start from the root node
Swap the left and right children of the current node
Recursively invert the left subtree
Recursively invert the right subtree
Repeat until all nodes are inverted
Finding the middle element of a LinkedList
Traverse the LinkedList using two pointers, one moving one step at a time and the other moving two steps at a time
When the faster pointer reaches the end of the list, the slower pointer will be at the middle element
If the LinkedList has an even number of elements, there are two middle elements
To reverse an array, use a loop to swap the first and last elements until the middle is reached. To find elements in an array, use a loop to compare each element to the desired value.
To reverse an array, initialize two pointers at the beginning and end of the array. Swap the elements at the pointers and move the pointers towards the middle until they meet.
To find elements in an array, use a loop to iterate through each...
I applied via Company Website and was interviewed before Sep 2021. There was 1 interview round.
Finding the longest increasing sequence using recursion.
Define a recursive function that takes an array and the current index as parameters.
If the current index is the last index of the array, return 1.
If the current element is greater than the next element, return 1.
If the current element is less than or equal to the next element, recursively call the function with the next index and add 1 to the result.
Compare the re...
The longest increasing sum is the maximum sum of a subsequence of consecutive increasing numbers in an array.
Iterate through the array and keep track of the current sum and the maximum sum seen so far.
If the current element is greater than the previous element, add it to the current sum.
If the current sum is greater than the maximum sum, update the maximum sum.
Return the maximum sum.
Example: For the array [1, 2, 3, 2, ...
Pepcoding interview questions for popular designations
Top trending discussions
I applied via Campus Placement and was interviewed in Jun 2022. There were 3 interview rounds.
The test of the coding ninja Taship comes with three categories stages 1st. Easy which consist 2 question , for medium consist 3 & for hard 3 question comes which is related to your course. They want to test your skills about your knowledge, sometimes some other questions like to debug the code type questions which is easy so that's it and very interesting round this is i enjoyed a lot if have skills
I applied via Company Website and was interviewed in Aug 2023. There were 3 interview rounds.
One coding test or you need to score more than 90% to apply.
Yes, I am confident in my ability to solve doubts and help students understand the material.
I have a strong understanding of the subject matter and can explain concepts clearly
I am patient and willing to work through problems with students until they understand
I am resourceful and can find additional materials or resources to help clarify any confusion
I applied via Company Website and was interviewed in Sep 2023. There were 3 interview rounds.
I done the coding round in cpp14
I applied via Company Website and was interviewed before Sep 2021. There were 3 interview rounds.
5 questions 2 hours easy test some mcq also overall easy
Simmple dsa examlpe very easy veryeasy veryeasy
JavaScript is a programming language used to create interactive web pages and web applications.
JavaScript is used for client-side scripting, allowing for dynamic and interactive web pages.
It can also be used for server-side scripting with Node.js.
JavaScript is used for creating web applications, games, and mobile apps.
It is also used for creating browser extensions and add-ons.
JavaScript frameworks like React, Angular,...
No, IIFE is not irreplaceable.
There are other ways to achieve the same functionality as IIFE, such as using arrow functions or block-scoped functions.
IIFE can also be replaced by using modules in modern JavaScript.
However, IIFE is still a useful tool in certain situations, such as when you need to create a private scope for your code.
I applied via Company Website and was interviewed in Jan 2024. There were 2 interview rounds.
The Coding Test have duration of 2hr , Topics was Java Fundamenals & DSA
based on 2 interviews
Interview experience
based on 63 reviews
Rating in categories
Product Engineer
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Teaching Assistant
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Front end Developer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Executive
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Coding Ninjas
GeeksForGeeks
upGrad
Simplilearn