ISKPRO Software Developer Interview Questions and Answers

Q1. How make a queue using a stack
Ans. 
To implement a queue using a stack, use two stacks and simulate the queue operations.
• Use two stacks, one for enqueue operation and one for dequeue operation.

• For enqueue operation, simply push elements onto the stack used for enqueueing.

• For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.

• Then pop from the dequeue stack to simulate dequeue operation.
Answered by AI
Add your answer
Q2. Create a linked list
Ans. 
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
• Create a Node class with data and next pointer

• Initialize a head pointer to null

• Add nodes by updating next pointers

• Traverse the list by following next pointers
Answered by AI
Add your answer

It was ok. I was not able to solve all the questions.

Q1. Remove the last element from a linkedlist
Add your answer
Q2. Some basic questions on oops dbms and os
Add your answer

The interviewer asked about javascript basics and DSA questions and some typescript questions

Q1. Tell me about
Add your answer
Q2. Your self they are asking
Add your answer
Q3. What is your weakness
Add your answer
Q4. Any questions ask for me
Add your answer
Q5. All the best future
Add your answer

Coding for international

Simple question on maths

Q1. Explain OOPS concept
Ans. 
OOPS (Object-Oriented Programming) is a programming paradigm based on the concept of objects, which can contain data and code.
• OOPS focuses on creating objects that interact with each other to solve complex problems

• Key principles include encapsulation, inheritance, polymorphism, and abstraction

• Encapsulation ensures that the internal state of an object is hidden from the outside world

• Inheritance allows a class to inherit...read more
Answered by AI
Add your answer
Q2. Coding array questions
Add your answer

60mintues DSA level coding exam

5 coding questions in 45 mins ...very easy questions, you can easily do..pen paper based exam. Programs were on strings, arrays and patterns

Round 2 is also coding test here questions were moderate. 3 questions given for 1.5 hours..
Again string and pattern programs were given.
Candidate should be clear with loops , strings arrays..thats it.. no need of studying linked lists ,stacks, queues or other data structures..your knowledge of algorithms doesnt matter here..its all about patterns, strings, arrays and loops

It is last coding round..here there is too much politics those who are working there call there friends and make them sit directly in final round..3 questions given no limit on time you have to do any 2 . They will roam around in roam and will discuss your code..they will help there friends as i was there without any referral there was noone for me..but it doesn't matter if u have strong basics u can crack it ..because problems are again on strings, arrays,patterns . I got bored doing same problems.

Q1. Data structures algorithms
Add your answer