Upload Button Icon Add office photos

Filter interviews by

Wednesday Solutions Full Stack Developer Interview Questions and Answers

Updated 24 Jan 2025

Wednesday Solutions Full Stack Developer Interview Experiences

2 interviews found

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected
Round 1 - Technical 

(1 Question)

  • Q1. React hooks, basic react and javascript coding
Round 2 - Technical 

(1 Question)

  • Q1. React application coding challenge.
  • Ans. 

    React application coding challenge

    • Create a new React application using create-react-app

    • Implement a component that fetches data from an API and displays it

    • Use React Router to create multiple pages in the application

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. Architecture and problem solving related questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - I had three rounds and all the round were very good and had coding questions from react and javascript. Had routing related questions from NODEJS, CORS principles, lambda layers, s3 bucket related questions.
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed in Dec 2023. There was 1 interview round.

Round 1 - Technical 

(4 Questions)

  • Q1. Django middleware, React components, hooks, pure comonent
  • Q2. Generatos, Iteratos
  • Q3. Flask request and response process
  • Q4. Django serializers and deserilaizers and json renderes

Interview Preparation Tips

Interview preparation tips for other job seekers - Mangerail discussion abot projects aws , celery

Full Stack Developer Interview Questions Asked at Other Companies

asked in DBS Bank
Q1. Query and Matrix Problem Statement You are given a binary matrix ... read more
asked in Accenture
Q2. Find Duplicates in an Array Given an array ARR of size 'N', where ... read more
asked in MakeMyTrip
Q3. Tower of Hanoi Problem Statement You have three rods numbered fro ... read more
Q4. Maximum Difference Problem Statement Given an array ARR of N elem ... read more
asked in Samsung
Q5. LCA of Binary Tree Problem Statement You are given a binary tree ... read more

Interview questions from similar companies

I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. SOLID principals, oops, c# basics, SQL server, azure, design pattern

Interview Preparation Tips

Interview preparation tips for other job seekers - Clear basics of oops and design pattern

I applied via Job Portal and was interviewed before Apr 2021. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Solid principles in c#
  • Ans. 

    Solid principles are a set of design principles for writing maintainable and scalable code in C#.

    • Single Responsibility Principle (SRP) - a class should have only one reason to change

    • Open/Closed Principle (OCP) - a class should be open for extension but closed for modification

    • Liskov Substitution Principle (LSP) - derived classes should be substitutable for their base classes

    • Interface Segregation Principle (ISP) - client...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - good company for freshers as well as beginners

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. HTML, CSS, BOOTSTRAP, PHP. SQL

I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Simple program
  • Q2. I wrote a simple program in C

Interview Preparation Tips

Interview preparation tips for other job seekers - Be bold and confident

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

  • Q1. How can you check if two strings are anagrams of each other?
  • Ans. 

    Check if two strings are anagrams by comparing the sorted versions of the strings.

    • Sort both strings and compare if they are equal.

    • Use a hashmap to store the frequency of characters in each string and compare the maps.

    • Ignore spaces and punctuation when comparing the strings.

  • Answered by AI
Round 2 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round 3 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute Of Technology, Silchar, Assam. I applied for the job as SDE - 1 in SiddharthnagarEligibility criteria6 CGPAAmazon interview preparation:Topics to prepare for the interview - Basic Computer Science backgroundTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application resume tips for other job seekers

Add projects and Internships if you have done any and add only those things which you really know.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

  • Q1. 

    Detect Cycle in a Directed Graph

    You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...

  • Ans. 

    Detect cycle in a directed graph using depth-first search (DFS) algorithm.

    • Use DFS to traverse the graph and detect back edges indicating a cycle.

    • Maintain a visited array to keep track of visited nodes during traversal.

    • If a node is visited again during traversal and it is not the parent node, then a cycle exists.

    • Return true if a cycle is detected, false otherwise.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

  • Q1. 

    Next Smallest Palindrome Problem Statement

    Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.

    Explanation:

    You are given a number in string format, a...

  • Ans. 

    Find the next smallest palindrome greater than a given number represented as a string.

    • Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

    • Handle cases where the number is a palindrome or has all digits as '9'.

    • Consider both odd and even length numbers when finding the next palindrome.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

  • Q1. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.

    Input:

    The first line ...
  • Ans. 

    Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.

    • Traverse the left boundary nodes in a top-down manner

    • Traverse the leaf nodes from left to right

    • Traverse the right boundary nodes in a bottom-up manner

    • Handle cases where duplicates occur in the boundary nodes

    • Implement the function without printing as printing is already managed

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaGood knowledge of Data Structures, Some great projects which are used by the usersAmazon interview preparation:Topics to prepare for the interview - Data Structures, Web development, System Design, Algorithms, Dynamic Programming, Database, OS, Networking, OOPS, DevOpsTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart. 
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.

Application resume tips for other job seekers

Tip 1 : Always try to make it a single page 
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Company Website and was interviewed in Oct 2018. There was 0 interview round.

Interview Preparation Tips

General Tips: This interview was a technical one but was majorly a stress test. It lasted for about 1 hour 10 minutes. The interviewer wanted to test both my knowledge and communication skills. Most of the questions asked to me were related to my B.Tech curriculum i.e. computer science related topics. He stressed a lot on the basics related to my project topic. Luckily I was able to answer most of the questions correctly. I tried to answer each question with examples and also used props on the table (like pens, paperweights, pen stands etc.) to explain my theories. It was my first offcampus interview, and I think I did pretty well for a fresher.
You need to stay calm and should apply presence of mind. Please go through the job description thoroughly word-by-word and recheck your resume to ensure that you are a best-fit for the position.
Skills: Communication, Body Language, Problem Solving, Leadership, Presentation Skills
Duration: <1 week

Interview Questionnaire 

1 Question

  • Q1. Tell me about yourself?basics on c , then about projects

Wednesday Solutions Interview FAQs

How many rounds are there in Wednesday Solutions Full Stack Developer interview?
Wednesday Solutions interview process usually has 2 rounds. The most common rounds in the Wednesday Solutions interview process are Technical.
How to prepare for Wednesday Solutions Full Stack Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Wednesday Solutions. The most common topics and skills that interviewers at Wednesday Solutions expect are Python, Javascript, SQL, AWS and NoSQL.
What are the top questions asked in Wednesday Solutions Full Stack Developer interview?

Some of the top questions asked at the Wednesday Solutions Full Stack Developer interview -

  1. React application coding challen...read more
  2. Django middleware, React components, hooks, pure comon...read more
  3. django serializers and deserilaizers and json rende...read more

Tell us how to improve this page.

Wednesday Solutions Full Stack Developer Interview Process

based on 2 interviews

Interview experience

2.5
  
Poor
View more
Software Engineer
28 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Project Manager
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

UI/UX Designer
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Wednesday Solutions with

TCS

3.7
Compare

Accenture

3.8
Compare

Wipro

3.7
Compare

Cognizant

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