• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

strtok()

March 21, 2014 by Dhaval Dave

Function Strtok

char * strtok ( char * str, const char * delimiters );
What it does : Split string into tokens
A sequence of calls to this function split str into tokens,
which are sequences of contiguous characters separated by any of
the characters that are part of delimiters

Example

/* strtok example */


int main ()
{
  char str[] ="This-is Go,Hired Site.";
  char * pch;
  printf ("Splitting string "%s" into tokens:n",str);
  printf ("--------");
  pch = strtok (str," ,.-"); // ',' '.' and '-' will be removed
  while (pch != NULL)
  {
    printf ("%sn",pch);
    pch = strtok (NULL, " ,.-");
  }
  return 0;
}
Output:
Splitting string “This-is Go,Hired Site.” into tokens:
——–
This is Go Hired Site

Similar Articles

Filed Under: problem Tagged With: Array, string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Difference between a LinkedList and a Binary Search Tree BST

HackeEarth Flipkart’s Drone

BlueStone E-commerce Interview Experience

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

C Program for TAIL command of UNIX

Knight Tour Problem (Graph – Breadth First Search)

Minimum insertions to form a palindrome

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Find the element that appears once others appears thrice

flattens 2 D linked list to a single sorted link list

Regular Expression Matching

Sequence Finder Dynamic Programming

Given a float number convert it into the string WITHOUT using any inbuilt Function

Test Cases for Round Function

Trapping Rain Water

Python String and numbers

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Cisco Hiring Event 21st – 22nd Feb 2015

Advanced SQL Injection

Check Binary Tree is Binary Search Tree or not

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Binary Tree in Java

Find the smallest window in a string containing all characters of another string

Implement a generic binary search algorithm for Integer Double String etc

VMWare SDEII Interview

SAP Interview Questions

Possible sizes of bus to carry n groups of friends

Length of the longest substring without repeating characters

Given a string, find the first character which is non-repetitive

Copyright © 2026 · Genesis Framework · WordPress · Log in