Role: Backend Developer (Experience: 2.5 years) I applied through LinkedIn and received the invitation for the first round (Hackerrank online test) within 1 week. Online… Read More
Tag Archives: Paytm
There were 3 rounds: Round 1(Online Coding Round – 60 mins): It consisted of 2 DSA questions to be solved. Story form of https://www.geeksforgeeks.org/sum-dependencies-graph/ Story… Read More
Online Assessment Time: 60 min Total number of questions: 8 Coding Questions: 2 Coding Question 1: (slight modification of below question)https://www.geeksforgeeks.org/lexicographically-smallest-string-formed-by-removing-duplicates/ Coding Question 2: The… Read More
Round 1: Technical (1 – 1.5 hrs): Introduction Discussion about my past experience at Amdocs. Questions on Web dev: HTML: What is Semantic HTML? Give… Read More
Paytm came to GL Bajaj campus for recruitment of SDET role. There were 3 rounds held in the complete process: Online Assessment Technical Interview- I… Read More
For the screening test Paytm conducted a 1-hour coding round on Hackerank. There were 2 questions : Problem 1. There are N tasks and two… Read More
I had already get selected for Capgemini, and Wipro in September 2022, Paytm Visited our college in October 2022, and I applied for the assessment… Read More
Paytm came to my campus GL BAJAJ INSTITUTE OF TECHNOLOGY & MANAGEMENT for the recruitment of SDET Role. I have gone through the following rounds… Read More
Round 1(Technical) [1hr]: Introduction Discussion on Project. Some SQL questions are easy to difficult level. like Remove duplicates from the table. nth height item in… Read More
Hello Everyone, I am honoured to share my Interview Experience of Paytm (Noida) . Company came for (CSE, IT, EC/EE branches). Criteria for the company… Read More
Efficient approach: If we are allowed to buy and sell only once, then we can use following algorithm. Maximum difference between two elements. Here we… Read More
Given a linked list, write a function to reverse every k nodes (where k is an input to the function). Examples: Input: 1->2->3->4->5->6->7->8->NULL and k =… Read More
Given a linked list, write a function to reverse every k nodes (where k is an input to the function). Examples: Input: 1->2->3->4->5->6->7->8->NULL and k =… Read More
Given a linked list, write a function to reverse every k nodes (where k is an input to the function). Examples: Input: 1->2->3->4->5->6->7->8->NULL and k =… Read More
Given a linked list, write a function to reverse every k nodes (where k is an input to the function). Examples: Input: 1->2->3->4->5->6->7->8->NULL and k =… Read More
